Generalized implicit factorization problem

DOI10.1007/978-3-031-53368-6_18MaRDI QIDQ6620059

Yanbin Pan, Abderrahmane Nitaj, Yansong Feng

Publication date: 16 October 2024

zbMATH Keywords

latticeLLL algorithmimplicit factorization problemCoppersmith's algorithm

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

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
• Implicit factorization of RSA moduli revisited (short paper)
• Further results on implicit factoring in polynomial time
• Towards Optimal Bounds for Implicit Factorization Problem
• Factoring RSA Keys from Certified Smart Cards: Coppersmith in the Wild
• Finding a Small Root of a Univariate Modular Equation
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Cryptanalysis of RSA with Private Key d Less than N 0.292
• Side-Channel Attack against RSA Key Generation Algorithms
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization

This page was built for publication: Generalized implicit factorization problem