Title :
RSA/Rabin Bits are 1/2 + 1 / Poly (Log N) Secure
Author :
Alexi, W. ; Chor, Benny ; Goldreich, Oded ; Schnorr, Claus P.
Author_Institution :
Fachbereich Mathematik, Universitat Frankfurt
Abstract :
We prove that RSA least significant bit is 1/2 + (1/[logc N]) secure, for any constant c (where N is the RSA modulus). This means that an adversary, given the ciphertext, cannot guess the least sigiiilicatnt bit of the plaintext with probability better than 1/2 + (1/[logc N]), unless he can break RSA.
Keywords :
Information security; Public key cryptography; Utility programs;
Conference_Titel :
Foundations of Computer Science, 1984. 25th Annual Symposium on
Conference_Location :
Singer Island, FL
Print_ISBN :
0-8186-0591-X
DOI :
10.1109/SFCS.1984.715947
