Abstract
We discuss the different possibilities to choose elliptic curves over different finite fields with respect to application for public key cryptosystems.In 1985 it was proposed to use the multiplication on elliptic curves for the implementation of one way functions.Supersingular curves E with #E(Fq) = q + 1 elements were proposed at that time. New results due to A. Menezes, T. Okamoto and S. Vanstone show, that these curves are not well suited for that purpose. They can be attacked with a new division algorithm recently presented.However, by using non-supersingular elliptic curves this attack can be avoided. We show how to construct suitable curves. Furthermore some aspects of a VLSI-implementation for such a cryptosystem are discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
