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

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

zbMATH Keywords

latticesCoppersmith's methodLLL algorithmimplicit factorization problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

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

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)