Implicit-key attack on the RSA cryptosystem
From MaRDI portal
Publication:6536396
DOI10.1007/978-3-030-34637-9_26zbMATH Open1540.94079MaRDI QIDQ6536396FDOQ6536396
Authors: Mengce Zheng, Hong Gang Hu 
Publication date: 26 April 2024
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Title not available (Why is that?)
- Using LLL-reduction for solving RSA and factorization problems
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
- Advances in Cryptology - EUROCRYPT 2004
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- Implicit Factoring with Shared Most Significant and Middle Bits
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
This page was built for publication: Implicit-key attack on the RSA cryptosystem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536396)
