Implicit Factoring with Shared Most Significant and Middle Bits

DOI10.1007/978-3-642-13013-7_5zbMath1271.11117OpenAlexW1604127192MaRDI QIDQ3562889

Raphaël Marinier, Jean-Charles Faugère, Guénaël Renault

Publication date: 28 May 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-13013-7_5

zbMATH Keywords

RSAlatticesimplicit factorization

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (9)

Attacking (EC)DSA Given Only an Implicit Hint ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Deterministic factoring with oracles ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ 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 with Shared Most Significant and Middle Bits