摘要： 椭圆曲线密码的数学基础是椭圆曲线离散对数问题()。除了一些极特殊的椭圆曲线,求解的算法都为完全指数时ECDLPECDLP间,其中目前最好的算法是并行算法,文章给出了用该算法求解的一个实例。Pollard's rhoECDLP

关键词: 椭圆曲线密码, 离散对数问题, 椭圆曲线离散对数问题

Abstract: Elliptic curve cryptosystem bases on elliptic curve discrete logarithm problem(ECDLP). Except a special class of elliptic curves, algorithms for ECDLP take fully exponential time. Distributed version of Pollard's rho algorithm is the fastest general-purpose algorithm known for the ECDLP. An example is given to show how to solve ECDLP using this algorithm.

中图分类号: 

• TN918.1