Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
From MaRDI portal
Publication:2025379
DOI10.3934/amc.2020076zbMath1472.11315OpenAlexW3015954852MaRDI QIDQ2025379
Longjiang Qu, Chao Li, Shaojing Fu, Hao Chen, Shixiong Wang
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020076
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deterministic polynomial-time equivalence of computing the RSA secret key and factoring
- Factoring polynomials with rational coefficients
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Cryptanalysis of RSA with small prime difference
- Partial prime factor exposure attacks on RSA and its Takagi's variant
- Implicit factorization of RSA moduli revisited (short paper)
- Implicit factorization of unbalanced RSA moduli
- Improved bounds for the implicit factorization problem
- Partial Key Exposure Attacks on RSA: Achieving the Boneh-Durfee Bound
- Towards Optimal Bounds for Implicit Factorization Problem
- Solving Linear Equations Modulo Unknown Divisors: Revisited
- Finding a Small Root of a Univariate Modular Equation
- Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
- A New Attack on RSA and CRT-RSA
- Partial Key Exposure Attack on RSA – Improvements for Limited Lattice Dimensions
- Partial Key Exposure: Generalized Framework to Attack RSA
- 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
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of RSA with Private Key d Less than N 0.292
- Further Improvement of Factoring RSA Moduli with Implicit Hint
- Algorithmic Cryptanalysis
- Approximate Integer Common Divisor Problem Relates to Implicit Factorization
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Partial Key Exposure Attacks on RSA up to Full Size Exponents
- Advances in Cryptology - CRYPTO 2003
