| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331344 | Information Processing Letters | 2005 | 6 Pages |
Abstract
In 1999, Smart has shown how to solve in linear time ECDLP for elliptic curves of trace 1 defined over a prime finite field Fp, the so-called anomalous elliptic curves. In this article, we show how to construct such cryptographically weak curves for primes p of industrial length, using complex multiplication theory.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Franck Leprévost, Jean Monnerat, Sébastien Varrette, Serge Vaudenay,