You are looking at a specific version 20070807:152724 of this paper. See the latest version.

Paper 2007/281

A Pollard-like pseudorandom number generator over EC

Grzegorz Wojtenko

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
Published elsewhere. elliptic curve cryptosystem; pseudo-randomness
Contact author(s)
Grzegorz Wojtenko @ wincor-nixdorf com
History
2007-08-07: received
Short URL
https://ia.cr/2007/281
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.