摘要
给出了RSA加密算法中模n的几个有趣的性质.并把RSA的破译归结为求Diophantine方程x^2-y^2=n的非平凡整数解问题或n的连续奇数序列和表示问题,进而讨论了x^2-y^2=n的求解,并提出了一种时间复杂度为O(n^(1/6)的攻击RSA的随机算法。
In this paper, several interesting properties of the modulusn in RSA cryptoalgorithm are presented and used to deduce the problemof breaking RSA to the problem of finding the nontrivial solution of theDiopharitine equation x^2-y^2=n, and the problem of representing n as thesum of some successive odd positive numbers less than n.Further, theproblem of finding the nontrivial solution of x^2-y^2=n is discussed anda probabilistic algorithm of time complexity O(n^(1/6))for attacking RSA isproposed.
出处
《湘潭大学自然科学学报》
CAS
CSCD
1991年第3期113-118,共6页
Natural Science Journal of Xiangtan University
关键词
密码学
公开钥加密学
加密学
cryptology
cryptography
cryptanalysis
public key cryptography
security protection
