International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Grzegorz Wojtenko

Publications

Year
Venue
Title
2007
EPRINT
PRIME POINTS ON ELLIPTIC CURVES AND ITS IMPACT ON ECDLP
Grzegorz Wojtenko
In this paper we present that some statistical properties of points on elliptic curve can be used to form new equivalence classes. This can have an impact on solving discrete logarithm (ECDLP) owing to the reduction of the number of points among which a logarithm is searched to points of particular features. It should lead to an improvement of the Pollard-rho algorithm.
2007
EPRINT
A Pollard-like pseudorandom number generator over EC
Grzegorz Wojtenko
In this short paper we propose a pseudorandom number generator over EC based on Pollard-like method. In contrast to the well known Elliptic Curve Random Number Generator (see e.g. ANSI and NIST draft standards) the generator is based on a random walk over the group of EC-points like in the original Pollard’s rho algorithm and only resembles a little bit the linear congruential generator over elliptic curve. Compared to other approaches, the method allows to decrease the cost of generating pseudorandom numbers. This generator could be used in resource constrained devices like smart cards which have already been equipped with EC-based tools for other cryptographic purposes.