Breaking RSA may be as difficult as factoring

DOI10.1007/s00145-014-9192-yzbMath1351.94030OpenAlexW2037848441MaRDI QIDQ271594

Daniel R. L. Brown

Publication date: 7 April 2016

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-014-9192-y

zbMATH Keywords

RSAfactoringstraight line programs

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Impact of Group Theory in Cryptosystem ⋮ RSA: a number of formulas to improve the search for \(p+q\) ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Using LLL-Reduction for Solving RSA and Factorization Problems ⋮ Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing ⋮ Unnamed Item ⋮ A new cryptosystem using generalized Mersenne primes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
• Riemann's hypothesis and tests for primality
• A method for obtaining digital signatures and public-key cryptosystems
• Breaking RSA may not be equivalent to factoring
• On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
• Breaking RSA Generically Is Equivalent to Factoring

This page was built for publication: Breaking RSA may be as difficult as factoring