The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications

DOI10.1007/978-3-031-31368-4_6OpenAlexW4367663818MaRDI QIDQ6091132

Keegan Ryan, Nadia Heninger

Publication date: 24 November 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_6

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Further results on implicit factoring in polynomial time
• Towards Optimal Bounds for Implicit Factorization Problem
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Hidden number problem with hidden multipliers, timed-release crypto, and noisy exponentiation
• Further Improvement of Factoring RSA Moduli with Implicit Hint
• Hermite’s Constant and Lattice Algorithms
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Extended Hidden Number Problem and Its Cryptanalytic Applications
• Toward a Rigorous Variation of Coppersmith’s Algorithm on Three Variables
• Predicting Lattice Reduction
• Algorithmic Number Theory
• Lattice attacks on digital signature schemes

This page was built for publication: The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications