Improving the parallelized Pollard lambda search on anomalous binary curves
Open Access
- 19 May 1999
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 69 (232) , 1699-1705
Abstract
The best algorithm known for finding logarithms on an elliptic curve ( E ) (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a set of equivalence classes derived from E E , which requires fewer iterations than the standard approach. In the case of anomalous binary curves over F 2 m F_{2^m} , the new approach speeds up the standard algorithm by a factor of 2 m \sqrt {2m} .Keywords
This publication has 5 references indexed in Scilit:
- CM-Curves with Good Cryptographic Properties2001
- Faster Attacks on Elliptic Curve Cryptosystems1999
- Speeding up Pollard's rho method for computing discrete logarithms1998
- An improved algorithm for arithmetic on a family of elliptic curves1997
- Monte Carlo Methods for Index Computation (mod p)Mathematics of Computation, 1978