research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Inproceedings
Entered by:
TitleOn the Efficient Generation of Elliptic Curves over Prime Fields
Bibtex cite IDRACTI-RU1-2002-17
Booktitle Workshop on Cryptographic Hardware and Embedded Systems
Series Lecture Notes in Computer Science
Year published 2002
Month August
Volume 2523
Pages 333-348
Organization CHES 2002
Location Redwood City, USA
We present a variant of the complex multiplication method that generates elliptic curves of cryptographically strong order. Our variant is based on the computation ofWeber polynomials that require significantly less time and space resources than their Hilbert counterparts. We investigate the time efficiency and precision requirements for generating off-line Weber polynomials and its comparison to another variant based on the off-line generation of Hilbert polynomials. We also investigate the efficiency of our variant when the computation of Weber polynomials should be made on-line due to limitations in resources (e.g., hardware devices of limited space).We present trade-offs that could be useful to potential implementors of elliptic curve cryptosystems on resource-limited hardware devices.
Konstantinou, Elisavet
Stamatiou, Yannis
Zaroliagis, Christos
C29-ches2002-gen-ec.pdf (main file)
Publication ID404