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-1706
- https://doi.org/10.1090/s0025-5718-99-01119-9
Abstract
The best algorithm known for finding logarithms on an elliptic curve is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a set of equivalence classes derived from , which requires fewer iterations than the standard approach. In the case of anomalous binary curves over , the new approach speeds up the standard algorithm by a factor of .Keywords
This publication has 0 references indexed in Scilit: