A modification of the RSA public-key encryption procedure (Corresp.)
- 1 November 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (6), 726-729
- https://doi.org/10.1109/tit.1980.1056264
Abstract
The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integerRused as the modulus can be factored. It my however be possible to break this system without factoringR. A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, thenRcan be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.Keywords
This publication has 7 references indexed in Scilit:
- Some remarks concerning the M.I.T. public-key cryptosystemBIT Numerical Mathematics, 1979
- Critical remarks on “Critical Remarks on Some Public-Key Cryptosystems” by T. HerlestamBIT Numerical Mathematics, 1979
- Critical remarks on some public-key cryptosystemsBIT Numerical Mathematics, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- REMARKS ON A PROPOSED CRYPTANALYTIC ATTACK ON THE M.I.T. PUBLIC-KEY CRYPTOSYSTEMCryptologia, 1978
- PRELIMINARY COMMENTS ON THE M.I.T. PUBLIC-KEY CRYPTOSYSTEMCryptologia, 1977
- New directions in cryptographyIEEE Transactions on Information Theory, 1976