Implicit Related-Key Factorization Problem on the RSA Cryptosystem

DOI10.1007/978-3-030-31578-8_29zbMath1452.94098OpenAlexW2979740538MaRDI QIDQ3297646

Mengce Zheng, Hong Gang Hu

Publication date: 20 July 2020

Published in: Cryptology and Network Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-31578-8_29

zbMATH Keywords

RSAfactorizationlattice-based attackCoppersmith's techniquesimplicit related-key

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of Dual RSA
• 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
• Finding a Small Root of a Univariate Modular Equation
• Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known
• Dual RSA and Its Security Analysis
• Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
• Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
• 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 0.292
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Advances in Cryptology - EUROCRYPT 2004
• Partial Key Exposure Attacks on RSA up to Full Size Exponents
• Predicting Lattice Reduction
• Small CRT-Exponent RSA Revisited