Breaking RSA Generically Is Equivalent to Factoring
From MaRDI portal
Publication:5901923
DOI10.1007/978-3-642-01001-9_2zbMath1239.94031OpenAlexW1579491709MaRDI QIDQ5901923
Ueli M. Maurer, Divesh Aggarwal
Publication date: 12 May 2009
Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_2
Related Items (12)
Breaking RSA may be as difficult as factoring ⋮ New Ideas to Build Noise-Free Homomorphic Cryptosystems ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ Zero-knowledge proofs of knowledge for group homomorphisms ⋮ RSA: a number of formulas to improve the search for \(p+q\) ⋮ Computing primitive idempotents in finite commutative rings and applications ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ Arithmetic Expression Construction. ⋮ Unifying Zero-Knowledge Proofs of Knowledge ⋮ Efficiency Limitations for Σ-Protocols for Group Homomorphisms ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Breaking RSA may be as difficult as factoring
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Complexity of a determinate algorithm for the discrete logarithm
- Algorithms for Black-Box Fields and their Application to Cryptography
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA may not be equivalent to factoring
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- The RSA Group is Pseudo-Free
- When e-th Roots Become Easier Than Factoring
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Cryptography and Coding
- Theory of Cryptography
This page was built for publication: Breaking RSA Generically Is Equivalent to Factoring
