On Some Attacks on Multi-prime RSA
Authors:
- 17 February 2003
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 385-404
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Unbelievable Security Matching AES Security Using Public Key Systems2001
- Low Secret Exponent RSA Revisited2001
- An Advantage of Low-Exponent RSA with Modulus Primes Sharing Least Significant BitsLecture Notes in Computer Science, 2001
- Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’992000
- Cryptanalysis of RSA with private key d less than N/sup 0.292/IEEE Transactions on Information Theory, 2000
- An Attack on RSA Given a Small Fraction of the Private Key Bits1998
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Finding small roots of univariate modular equations revisited1997
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978