Cryptanalysis against an Improved RSA Algorithm
LI Yun-fe · 2013
Cryptanalysis against an improved RSA algorithm,client assistant RSA algorithm(CA-RSA),is carried out by using the Jochemsz and May's techniques for finding small roots of polynomials.We perform cryptanalytic attacks based on the LLL Lattice basis reduction algorithm.Security of the CA-RSA algorithm with two private exponents is analyzed.CA-RSA can effectively be broken when the two decryption exponents are less than modular N to the power of 1/12.