论文信息 - Generating anomalous elliptic curves

Generating anomalous elliptic curves

In 1999, Smart has shown how to solve in linear time ECDLP for elliptic curves of trace 1 defined over a prime finite field F"p, 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.

[1] Nigel P. Smart,et al. The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.

[2] Jean Monnerat. Computation of the discrete logarithm on elliptic curves of trace one ? Tutorial , 2002 .

[3] Neal Koblitz,et al. p-adic numbers , 1977 .

[4] Ian F. Blake,et al. Elliptic curves in cryptography , 1999 .

[5] Joseph H. Silverman,et al. The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[6] N. Koblitz. p-adic Numbers, p-adic Analysis, and Zeta-Functions , 1977 .