On an attack on RSA with small CRT-exponents
暂无分享,去创建一个
[1] Don Coppersmith,et al. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities , 1997, Journal of Cryptology.
[2] D. Boneh. Cryptanalysis of RSA with Private Key d Less Than N 0 , 1999 .
[3] Loo Keng Hua,et al. Introduction to number theory , 1982 .
[4] Hung-Min Sun,et al. An Approach Towards Rebalanced RSA-CRT with Short Public Exponent , 2005, IACR Cryptol. ePrint Arch..
[5] Steven D. Galbraith,et al. Tunable Balancing of RSA , 2005, ACISP.
[6] Alexander May,et al. A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073 , 2007, CRYPTO.
[7] László Lovász,et al. Factoring polynomials with rational coefficients , 1982 .
[8] J. Quisquater,et al. Fast decipherment algorithm for RSA public-key cryptosystem , 1982 .
[9] Alexander May,et al. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent , 2002, CRYPTO.
[10] Alexander May,et al. New Attacks on RSA with Small Secret CRT-Exponents , 2006, Public Key Cryptography.
[11] Michael J. Wiener,et al. Cryptanalysis of Short RSA Secret Exponents (Abstract) , 1990, EUROCRYPT.
[12] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.