Generalized implicit factorization problem

DOI10.1007/978-3-031-53368-6_18MaRDI QIDQ6620059zbMATH OpenFDO

Authors Yansong Feng, Abderrahmane Nitaj, Yanbin Pan

Publication date 16 October 2024

zbMATH Keywords

latticeLLL algorithmimplicit factorization problemCoppersmith's algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Recommendations

• Improved bounds for the implicit factorization problem
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit factorization of unbalanced RSA moduli
• Implicit factorization of RSA moduli revisited (short paper)
• Further results on implicit factoring in polynomial time

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1182510 (Why is no real title available?)
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Factoring RSA keys from certified smart cards: Coppersmith in the wild
• Factoring polynomials with rational coefficients
• Finding a small root of a univariate modular equation
• 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
• Implicit factorization of RSA moduli revisited (short paper)
• Side-Channel Attack against RSA Key Generation Algorithms
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Some applications of lattice based root finding techniques
• Towards optimal bounds for implicit factorization problem

This page was built for publication: Generalized implicit factorization problem

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