A cycling-like attack on RSA
Pla Information · 2009
A cycling-like attack on rivest,shamir and adleman(RSA)is presented.Let(e,N)be a RSA public key with corresponding private key d.If there exists a proper integer k such that both ek and dk mod (N)are relatively small,then based on some known low private exponent attacks,the problem of factoring RSA modulus N can be changed into the problem of finding small roots of RSA key equations,which can be solved in polynomial time.Experiments show that our method can find some new weak keys of RSA.