Conjectured Security of the ANSI-NIST Elliptic Curve RNG
Conjectured Security of the ANSI-NIST Elliptic Curve RNG
复制标题
ANSI-NIST 椭圆曲线 RNG 的安全性推测
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Daniel R. L. Brown
中科院分区：
文献类型：
--
作者：
Daniel R. L. Brown
椭圆曲线随机数发生器（ECRNG）已在ANSI和NIST标准草案中提出。本文证明了，如果三个条件为真，则ECRNG是安全的。这三个问题分别是椭圆曲线决定性Diffie-Hellman问题的困难性和两个较新的问题x-对数问题和截点问题的困难性。
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.