Conjectured Security of the ANSI-NIST Elliptic Curve RNG (original) (raw)

Paper 2006/117

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.

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}, url = {https://eprint.iacr.org/2006/117} }