Towards optimal bounds for implicit factorization problem

DOI10.1007/978-3-319-31301-6_26zbMATH Open1344.94061OpenAlexW2399975739MaRDI QIDQ2807227FDOQ2807227

Authors Yao Lu, Liqiang Peng, Rui Zhang, Lei Hu, Dongdai 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

latticesCoppersmith's methodLLL algorithmimplicit factorization problem

Mathematics Subject Classification ID

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

Recommendations

• Improved bounds for the implicit factorization problem
• Further improvement of factoring RSA moduli with implicit hint
• Implicit factorization of unbalanced RSA moduli
• Implicit factorization of RSA moduli revisited (short paper)
• Implicit related-key factorization problem on the RSA cryptosystem

Cites work

• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• An Introduction to Mathematical Cryptography
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Approximate common divisors via lattices
• Correcting errors in RSA private keys
• Efficient Factoring Based on Partial Information
• Factoring multi-power RSA modulus \(N = p^r q\) with partial known bits
• Factoring polynomials with rational coefficients
• Further improvement of factoring RSA moduli with implicit hint
• Further results on implicit factoring in polynomial time
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Improved bounds for the implicit factorization problem
• RSA meets DPA: recovering RSA secret keys from noisy analog data
• Reconstructing RSA Private Keys from Random Key Bits
• Recovering RSA secret keys from noisy key bits with erasures and errors
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
• Solving linear equations modulo unknown divisors: revisited
• Some applications of lattice based root finding techniques

Cited in

(6)

• Generalized implicit factorization problem
• Improved results on cryptanalysis of prime power RSA
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Improved bound for rank revealing LU factorizations
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• On oracle factoring of integers

This page was built for publication: Towards optimal bounds for implicit factorization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807227)