Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with bitsecurity:
TR99-037 | 27th August 1999
Johan Håstad, Mats Näslund

The Security of all RSA and Discrete Log Bits

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 >>>

ISSN 1433-8092 | Imprint