We study the security of individual bits in an
RSA encrypted message E_N(x). We show that given E_N(x),
predicting any single bit in x with only a non-negligible
advantage over the trivial guessing strategy, is (through a
polynomial time reduction) as hard as breaking ... more >>>