期刊名称：International Journal of Computer and Information Technology
印刷版ISSN：2279-0764
出版年度：2015
卷号：4
期号：4
页码：728
出版社：International Journal of Computer and Information Technology
摘要：Pollard's Rho method is well–known as an efficient method for solving discrete logarithm problems such as the ellip- tic curve discrete logarithm problem (ECDLP). It consists of two parts: a random walk and collision detection. This paper propos- es associative rational points for accelerating the random walk procedure. In detail, it considers two associative rational points .? .?+.? + =T i .W i and .? .?+.? . =T i .W i , where T i and W i are rational points. In order to make the random walk more efficient, random ra- tional points should be efficiently generated to which associative rational points has a contribution. .? .?+.? + and .? .?+.? . are obtained by less computational cost than that of two elliptic curve additions. In order to show the contribution of the proposed idea, this paper experiments with small ECDLPs as examples.
关键词：elliptic curve cryptography; elliptic curve discrete loga- ; rithm problem; Pollard's rho method; random walk
