论文信息 - Cryptanalysis of RSA with Small Prime Difference

Cryptanalysis of RSA with Small Prime Difference

We show that choosing an RSA modulus with a small difference of its prime factors yields improvements on the small private exponent attacks of Wiener and Boneh-Durfee.

Benne de Weger | B. Weger

[1] Dan Boneh,et al. New Results on the Cryptanalysis of Low Exponent Rsa , 1997 .

[2] Dan Boneh,et al. Cryptanalysis of RSA with private key d less than N0.292 , 1999, IEEE Trans. Inf. Theory.

[3] Robert D. Silverman. Fast Generation Of Random, Strong RSA Primes , 1997 .

[4] Eric R. Verheul,et al. Cryptanalysis of ‘Less Short’ RSA Secret Exponents , 1997, Applicable Algebra in Engineering, Communication and Computing.

[5] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[6] Dan Boneh,et al. Cryptanalysis of RSA with private key d less than N0.292 , 2000, IEEE Trans. Inf. Theory.

[7] Nick Howgrave-Graham,et al. Finding Small Roots of Univariate Modular Equations Revisited , 1997, IMACC.

[8] 염흥렬,et al. [서평]「Applied Cryptography」 , 1997 .

[9] Don Coppersmith,et al. Finding a Small Root of a Univariate Modular Equation , 1996, EUROCRYPT.

[10] Karim Belabas,et al. User’s Guide to PARI / GP , 2000 .

[11] Michael J. Wiener,et al. Cryptanalysis of Short RSA Secret Exponents (Abstract) , 1990, EUROCRYPT.

[12] D. Boneh. Cryptanalysis of RSA with Private Key d Less Than N 0 , 1999 .

[13] Don Coppersmith,et al. Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known , 1996, EUROCRYPT.