Satisfiability of word equations with constants is in NEXPTIME
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Discrete Logarithms: The Past and the Future
Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Equational theory of context unification is undecidable
Theoretical Computer Science
On the Linear Complexity of the Power Generator
Designs, Codes and Cryptography
On Word Equations in One Variable
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
On the Security of an RSA Based Encryption Scheme
ACISP '99 Proceedings of the 4th Australasian Conference on Information Security and Privacy
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
Stratified Context Unification Is in PSPACE
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
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
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
Satisfiability of Word Equations with Constants is in PSPACE
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Decidability of bounded second order unification
Information and Computation
The security of all RSA and discrete log bits
Journal of the ACM (JACM)
Satisfiability of word equations with constants is in PSPACE
Journal of the ACM (JACM)
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Simultaneous Hardcore Bits and Cryptography against Memory Attacks
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Decidability of bounded higher-order unification
Journal of Symbolic Computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A word equation solver based on Levensthein distance
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Systems of equations satisfied in all commutative finite semigroups
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
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.