Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography
On the Security of an RSA Based Encryption Scheme
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
An Improved Pseudo-random Generator Based on Discrete Log
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Informatics - 10 Years Back. 10 Years Ahead.
Emerging Standards for Public-Key Cryptography
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Further Results and Considerations on Side Channel Attacks on RSA
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Hard bits of the discrete log with applications to password authentication
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Hi-index | 0.00 |
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 RSA. We briefly discuss a related result for bit security of the discrete logarithm.