How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
On the cryptographic security of single RSA bits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Why and how to establish a private code on a public network
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We consider the following problem: Let s be a n-bit string with m ones and n - m zeros. Denote by CEt(s) the number of pairs, of equal bits which are within distance t apart, in the string s. What is the minimum value of CEt(驴), when the minimum is taken over all n-bit strings which consists of m ones and n - m zeros?.We prove a (reasonably) tight lower bound for this combinatorial problem.Implications, on the cryptographic security of the least significant bit of a message encrypted by the RSA scheme, follow. E.g. under the assumption that the RSA is unbreakable; there exist no probabilistic polynomial-time algorithm which guesses the least significant bit of a message (correctly) with probability at least 0.725, when given the encryption of the message using the RSA. This is the best result known concerning the security of RSA's least significant bit.