### Conjectured Security of the ANSI-NIST Elliptic Curve RNG

Daniel R. L. Brown

##### Abstract

An elliptic curve random number generator (ECRNG) has been proposed in ANSI and NIST draft standards. This paper proves that, if three conjectures are true, then the ECRNG is secure. The three conjectures are hardness of the elliptic curve decisional Diffie-Hellman problem and the hardness of two newer problems, the x-logarithm problem and the truncated point problem.

Note: Revised to refer to independent similar work of K. Gjosteen, and to give some heuristics on the hardness of the truncated point problem.

Available format(s)
Category
Secret-key cryptography
Publication info
Published elsewhere. Unknown where it was published
Keywords
Random number generationElliptic curve cryptography
Contact author(s)
dbrown @ certicom com
History
2006-03-29: revised
See all versions
Short URL
https://ia.cr/2006/117

CC BY

BibTeX

@misc{cryptoeprint:2006/117,
author = {Daniel R.  L.  Brown},
title = {Conjectured Security of the ANSI-NIST Elliptic Curve RNG},
howpublished = {Cryptology ePrint Archive, Paper 2006/117},
year = {2006},
note = {\url{https://eprint.iacr.org/2006/117}},
url = {https://eprint.iacr.org/2006/117}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.