DocumentCode
932345
Title
A modification of the RSA public-key encryption procedure (Corresp.)
Author
Williams, Henry
Volume
26
Issue
6
fYear
1980
fDate
11/1/1980 12:00:00 AM
Firstpage
726
Lastpage
729
Abstract
The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer 
used as the modulus can be factored. It my however be possible to break this system without factoring . 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, then can 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.
used as the modulus can be factored. It my however be possible to break this system without factoring . 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, then can 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
Cryptography; Computer science; Digital signatures; Public key; Public key cryptography;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1980.1056264
Filename
1056264
Link To Document