将基于离散比特的RSA私钥泄漏攻击转化为模方程的求解问题,并利用格基约化算法进行有效攻击。如果RSA算法的公钥参数e=N^β〈N^1/2,并且私钥d的未知部分N^α〈N^1/2-β,则可以在多项式时间恢复出私钥d。
The partial key exposure attack on RSA given discrete private key bits is turned into sol-ving module equations. Then RSA could be attacked effectively with lattice reduction algorithm.With the method we advanced, if the public parameter satisfies e = N^β〈N^1/2and the unknown part of private key d satisfies N^β〈N^1/2-β, the private key d could be recovered in polynomial time.