Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography

Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography

The subject of the thesis at hand is the description of an efficient algorithm for finding an elliptic curve over a finite prime field of large characteristic suitable for use in cryptography. The algorithm is called cryptoCurve. It makes use of the theory of complex multiplication. Our work relies...

Full description

Bibliographic Details
Main Author: Baier, Harald
Format: Others
Language:English
en
Published: 2002
Online Access:https://tuprints.ulb.tu-darmstadt.de/211/1/dissertation_harald_baier.pdf
Baier, Harald <http://tuprints.ulb.tu-darmstadt.de/view/person/Baier=3AHarald=3A=3A.html> (2002): Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000211 <http://elib.tu-darmstadt.de/diss/000211> <official_url>],[Ph.D. Thesis]

Internet

https://tuprints.ulb.tu-darmstadt.de/211/1/dissertation_harald_baier.pdf
Baier, Harald <http://tuprints.ulb.tu-darmstadt.de/view/person/Baier=3AHarald=3A=3A.html> (2002): Efficient Algorithms for Generating Elliptic Curves over Finite Fields Suitable for Use in Cryptography.Darmstadt, Technische Universität, [Online-Edition: http://elib.tu-darmstadt.de/diss/000211 <http://elib.tu-darmstadt.de/diss/000211> <official_url>],[Ph.D. Thesis]

Similar Items