论文部分内容阅读
破译RSA密码系制的一种方法己由西蒙斯(simmons)和诺利斯(Norris)提出。他们的方法首先是对密文y求出使得ye~m≡y(modn)的整数m(≠0),其次是利用X=ye~(m-1) modn得到对应于y的明文X。吕韦斯特(Rivest)指出,这种破译方法,成为加密基础的参数p、q、e。如果满足某种条件的话,那未要破译RSA密码体制几乎是不可能的。本文指出,由于对西蒙斯等人的方法作了比吕韦斯特更精确地评价,求得了关于e的新条件,如果把这个条件化为e,把吕韦斯特的条件也化为e,那么RSA密码体制的安全性还可提高。此外,克鲁什(Knuth)指出了关于西蒙斯等人的方法存在的问题,本文还阐明了两者之间的联系。
One way to decipher RSA cryptography has been proposed by Simmons and Norris. Their method is to find the integer m (≠ 0) such that ye ~ m≡y (modn) is obtained for the ciphertext y, and the plaintext X corresponding to y is obtained by using X = ye ~ (m-1) modn. Rivest pointed out that this method of deciphering becomes the basis of cryptography parameters p, q, e. If you meet certain conditions, then it is almost impossible to decipher the RSA password system. This paper points out that since the method of Simons et al. Is evaluated more precisely than Lucius, a new condition about e is obtained. If this condition is e, the condition of Lüweste is also reduced to e , Then the security of RSA password system can be improved. In addition, Knuth points out the problems with the methods of Simons et al. This article also illustrates the connection between the two.