Paper 2007/281 Original: eprint.iacr.org/2007/281 ↗
A Pollard-like pseudorandom number generator over EC
Abstract
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.
Metadata
- Available format(s)
PDF- Category
- Applications
- Publication info
- Preprint.
- History
- 2007-08-07: last updated
- 2007-08-07: published
- Short URL
- https://ia.cr/2007/281
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/281,
author = {Grzegorz Wojtenko},
title = {A Pollard-like pseudorandom number generator over EC},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/281},
year = {2007},
url = {https://eprint.iacr.org/2007/281}
}