Key points are not available for this paper at this time.
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 sigiiilicatnt bit of the plaintext with probability better than 1/2 + (1/log c N), unless he can break RSA.
Alexi et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: