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

DOI10.1007/978-3-642-00468-1_1zbMath1220.11152OpenAlexW2103832773MaRDI QIDQ3617509

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

latticesFactoring with an oracle

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (16)

Attacking (EC)DSA Given Only an Implicit Hint ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Analysis of hidden number problem with hidden multiplier ⋮ Deterministic factoring with oracles ⋮ On oracle factoring of integers ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ A Simple and Improved Algorithm for Integer Factorization with Implicit Hints ⋮ Implicit-key attack on the RSA cryptosystem ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ Generalized implicit factorization problem ⋮ Approximate common divisor problem and lattice sieving ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Implicit factorization of unbalanced RSA moduli ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

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