Towards Optimal Bounds for Implicit Factorization Problem

DOI10.1007/978-3-319-31301-6_26zbMath1344.94061OpenAlexW2399975739MaRDI QIDQ2807227

Lei Hu, Rui Zhang, Liqiang Peng, Yao Lu, Dong-Dai Lin

Publication date: 19 May 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-31301-6_26

zbMATH Keywords

latticesLLL algorithmCoppersmith's methodimplicit factorization problem

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (4)

The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ On oracle factoring of integers ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem

Cites Work

• Unnamed Item
• Unnamed Item
• Some applications of lattice based root finding techniques
• Factoring polynomials with rational coefficients
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Further results on implicit factoring in polynomial time
• Improved bounds for the implicit factorization problem
• Solving Linear Equations Modulo Unknown Divisors: Revisited
• Approximate common divisors via lattices
• Reconstructing RSA Private Keys from Random Key Bits
• Implicit Factoring with Shared Most Significant and Middle Bits
• Correcting Errors in RSA Private Keys
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Efficient Factoring Based on Partial Information
• Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors
• Further Improvement of Factoring RSA Moduli with Implicit Hint
• RSA Meets DPA: Recovering RSA Secret Keys from Noisy Analog Data
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
• An Introduction to Mathematical Cryptography

This page was built for publication: Towards Optimal Bounds for Implicit Factorization Problem