Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
From MaRDI portal
Publication:3011906
DOI10.1007/978-3-642-21969-6_6zbMath1281.94030OpenAlexW185651473MaRDI QIDQ3011906
Publication date: 29 June 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21969-6_6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology -- ASIACRYPT 2008. 14th international conference on the theory and application of cryptology and information security, Melbourne, Australia, December 7--11, 2008. Proceedings
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- Public-Key Locally-Decodable Codes
- On the Validity of the Φ-Hiding Assumption in Cryptographic Protocols
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Attacking Power Generators Using Unravelled Linearization: When Do We Output Too Much?
- Automata, Languages and Programming
This page was built for publication: Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
