Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

DOI10.1007/978-3-642-00468-1_1MaRDI QIDQ3617509zbMATH OpenOpenAlexFDO

Authors Alexander May, Maike Ritzenhofen

Publication date 24 March 2009

Published in Public Key Cryptography – PKC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00468-1_1

zbMATH Keywords

Factoring with an oraclelattices

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

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

Cited in

(25)

• Analysis of hidden number problem with hidden multiplier
• Implicit factorization of RSA moduli revisited (short paper)
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Factoring with hints
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• A probabilistic analysis on a lattice attack against DSA
• Implicit factorization of unbalanced RSA moduli
• On oracle factoring of integers
• A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
• Towards optimal bounds for implicit factorization problem
• Improved results on cryptanalysis of prime power RSA
• Implicit related-key factorization problem on the RSA cryptosystem
• Approximate common divisor problem and lattice sieving
• Attacking (EC)DSA given only an implicit hint
• Implicit Factoring with Shared Most Significant and Middle Bits
• Further improvement of factoring RSA moduli with implicit hint
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Deterministic factoring with oracles
• Implicit-key attack on the RSA cryptosystem
• Generalized implicit factorization problem
• Solving modular linear equations via automated Coppersmith and its applications
• Elliptic-curve factoring, witnesses and oracles
• Better bounds for finding fixed-degree isogenies via Coppersmith's method
• Implicit factorization with shared any bits
• Small public exponent brings more: improved partial key exposure attacks against RSA

This page was built for publication: Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

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