中文摘要：

运用Jochemsz和May寻找多项式小根的技术对RSA改进算法——客户端辅助RSA（CA—RSA）算法进行攻击，可以对CA—RSA算法实现基于LLL格归约算法的密码分析．通过分析含有两个私钥指数的CA—RSA算法的安全性，得到当两个私钥指数小于大数模Ⅳ的1／12次幂时，CA-RSA算法能在多项时间内被有效破解．

英文摘要：

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.