Improved Results on Cryptanalysis of Prime Power RSA
From MaRDI portal
Publication:2988352
DOI10.1007/978-3-319-53177-9_15zbMath1441.94093OpenAlexW2586633282MaRDI QIDQ2988352
Publication date: 19 May 2017
Published in: Information Security and Cryptology – ICISC 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53177-9_15
cryptanalysisprime power RSACoppersmith's methodimplicit factorization problemmultiple private exponents
Related Items
Uses Software
Cites Work
- Unnamed Item
- Revisiting prime power RSA
- Small secret exponent attack on RSA variant with modulus \(N=p^rq\)
- The LLL algorithm. Survey and applications
- Factoring polynomials with rational coefficients
- The Magma algebra system. I: The user language
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Improved bounds for the implicit factorization problem
- Towards Optimal Bounds for Implicit Factorization Problem
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- New Attacks on RSA with Moduli N = p r q
- Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
- Cryptanalysis of short RSA secret exponents
- Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
- Implicit Factoring with Shared Most Significant and Middle Bits
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Further Improvement of Factoring RSA Moduli with Implicit Hint
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Better Lattice Constructions for Solving Multivariate Linear Equations Modulo Unknown Divisors
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Public Key Cryptography – PKC 2004
