Type of publication: | Inproceedings |
Entered by: | |
Title | On the Efficient Generation of Elliptic Curves over Prime Fields |
Bibtex cite ID | RACTI-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 |
URL | http://www.iacr.org/workshops/ches/ches2002/index.html |
Abstract | 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. |
Authors | |
Topics
| |
BibTeX | BibTeX |
RIS | RIS |
Attachments |
C29-ches2002-gen-ec.pdf (main file) |
|
Publication ID | 404 |