Title :
M mod 3 security of RSA
Author :
Kurosawa, K. ; Matsu, K.
Author_Institution :
Tokyo Inst. of Technol., Yokohama, Japan
fDate :
3/30/1989 12:00:00 AM
Abstract :
The letter shows that guessing M and 3 with probability 1/3+1/poly (n) is equivalent to breaking the RSA, where M is the plaintext. A simple technique is developed instead of the modified binary gcd.<>
Keywords :
codes; cryptography; information theory; M mod 3 security; RSA; modified binary gcd; public key cryptosystem; Codes; Cryptography; Information theory;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19890305
