LCS Publication Details
Publication Title: RSA/RABIN LEAST SIGNIFICANT BITS ARE 1/2 +1/poly(logN)SECURE
Publication Author: Chor, Benny
Additional Authors: Goldreich, Oded
LCS Document Number: MIT-LCS-TM-260
Publication Date: 5-1-1984
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
We prove that RSA least significant bit is 1/2+1 log c N secure, for any constant c ( where N is the RSA modulus). This means that an adversary, given the ciphertext, cannot guess the least significant bit of the plaintext with probability better than 1/2+ log 1 c N, unless he can break RSA. Our proof technique is strong enough to give, with modifications, the following related results:
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.