[1] RIVEST R L,SHAMIR A,ADLEMAN L.A Method for Obtaining Digital Signatures and Public Key Cryptosystems [J].Communications of the ACM,1978,21(2):120-126.[2] ELGAMAL L.A Public Key Cryptosystem and a Signature Scheme Base on Discrete Logarithm [J].IEEE Trans. Info. Theory,1985,31:469-472.[3] KOBLITZ NEAL.Elliptic Curve Cryptosystems [J].Mathematics of Computation,1987,48:203-209.[4] MILLER V.Uses of Elliptic Curves in Cryptography [C]//Advances in Cryptology CRYPTO’85,Lecture Notes in Computer Science.Berling:Springer-Verlag,1986,218:417-426.[5] 金晨辉,郑浩然,张少武,等.密码学 [M].北京:高等教育出版社,2009.[6] MENEZES A J,OKAMOTO T,VANSTONE S A.Reducing Elliptic Curve Logarithms to a Finite Field [J].IEEE Trans. Info. Theory,1993,9:1 639-1 646.[7] XU Guang-wu.Short Vectors,the GLV Method and Discrete Logarithms [J].Journal of Lanzhou University:Natural Sciences,2009,45(1):73-77.[8] 陈智华.基于DNA计算自组装的Diffie-Hellman算法破译 [J].计算机学报,2008,31(12):2 116-2 122.[9] 司光东,董庆宽,李艳平,等.一种基于离散对数群签名方案的分析 [J].哈尔滨工程大学学报,2007,28(10):1 131-1 134.[10] 吕欣,冯登国.密码体制的量子算法分析 [J].计算机科学,2005,32(2):166-168.[11] SHOR PETER W.Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [J].SIAM J. on Computing,1997,26(5):1 484-1 509. |