On the Design of RSA with Short Secret Exponent
Authors:
- 1 January 1999
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 150-164
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Factoring Large Numbers with the TWINKLE Device1999
- Attacks on Shamir's ‘RSA for paranoids’Information Processing Letters, 1998
- Generating RSA Moduli with a Predetermined Portion1998
- A new public-key cryptosystem as secure as factoring1998
- A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption1998
- Small Solutions to Polynomial Equations, and Low Exponent RSA VulnerabilitiesJournal of Cryptology, 1997
- Finding a Small Root of a Univariate Modular Equation1996
- Extending the Wiener attack to RSA-type cryptosystemsElectronics Letters, 1995
- Solving Simultaneous Modular Equations of Low DegreeSIAM Journal on Computing, 1988
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978