Abstract: In this paper we introduce Ben-or's paper-"On the cryptographic security of single RSA bits",and improve its main theorem.We show that unless a cryptanalyst can completely break the RSA encryption,any heuristic oracle he uses to determine the least significant bit of the cleartext must have an error probability greater than 1/2-ε.