## CryptoDB

### Paper: A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves

Authors: Igor Semaev URL: http://eprint.iacr.org/2003/166 Search ePrint Search Google Let $E$ be an elliptic curve defined over a prime finite field $F_p$ by a Weierstrass equation. In this paper we introduce a new partition of $E(F_p)$ into classes which are generally larger than $\{\pm R\}$. We give an effective procedure to compute representatives of such classes. So one can iterate the pseudorandom function, related to a discrete logarithm problem in $E(F_p)$, on the set of representatives of classes and get probably some speed up in computing discrete logarithms. The underlying idea how to enlarge known classes on anomalous binary elliptic curves is given.
##### BibTeX
@misc{eprint-2003-11880,
title={A reduction of the space for the parallelized Pollard lambda search on elliptic curves over prime finite fields and on anomalous binary elliptic curves},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / elliptic curve cryptosystem, discrete logarithms, Pollard lambda search},
url={http://eprint.iacr.org/2003/166},
note={ Igor.Semaev@wis.kuleuven.ac.be 12275 received 11 Aug 2003},
author={Igor Semaev},
year=2003
}