[Resource Topic] 2006/117: Conjectured Security of the ANSI-NIST Elliptic Curve RNG

Welcome to the resource topic for 2006/117

Title:
Conjectured Security of the ANSI-NIST Elliptic Curve RNG

Authors: 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.

ePrint: https://eprint.iacr.org/2006/117

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .