Cryptology ePrint Archive: Report 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.
Category / Keywords: secret-key cryptography / Random number generation, Elliptic curve cryptography
Date: received 24 Mar 2006, last revised 29 Mar 2006
Contact author: dbrown at certicom com
Available format(s): PDF | BibTeX Citation
Note: Revised to refer to independent similar work of K. Gjosteen, and to give some heuristics on the hardness of the truncated point problem.
Version: 20060329:220621 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]