2 search results - page 1 / 1 » Estimating the Prime-Factors of an RSA Modulus and an Extens... |
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
In the RSA system, balanced modulus N denotes a product of two large prime numbers p and q, where q < p < 2q. Since IntegerFactorization is difficult, p and q are simply esti...
PKC
2005
Springer
13 years 10 months ago
2005
Springer
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...