Implicit Factoring with Shared Most Significant and Middle Bits

DOI10.1007/978-3-642-13013-7_5MaRDI QIDQ3562889zbMATH OpenOpenAlexFDO

Authors Jean-Charles Faugère, Raphaël Marinier, 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

latticesRSAimplicit factorization

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Recommendations

• Factoring multi-power RSA moduli with primes sharing least or most significant bits
• A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
• Factoring RSA moduli with primes sharing bits in the middle
• Efficient Factoring Based on Partial Information
• Factoring unbalanced moduli with known bits
• Implicit factorization of unbalanced RSA moduli
• Further improvement of factoring \(N=p^rq^s\) with partial known bits
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Approximate Integer Common Divisor Problem Relates to Implicit Factorization
• scientific article; zbMATH DE number 1304111

Cited in

(18)

• Generalized implicit factorization problem
• Implicit factorization of RSA moduli revisited (short paper)
• Deterministic factoring with oracles
• Implicit related-key factorization problem on the RSA cryptosystem
• Improved results on cryptanalysis of prime power RSA
• A probabilistic analysis on a lattice attack against DSA
• Revisiting orthogonal lattice attacks on approximate common divisor problems
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
• Attacking (EC)DSA given only an implicit hint
• Implicit factorization of unbalanced RSA moduli
• Further improvement of factoring RSA moduli with implicit hint
• Towards optimal bounds for implicit factorization problem
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Implicit-key attack on the RSA cryptosystem
• Factoring RSA moduli with primes sharing bits in the middle
• Further results on implicit factoring in polynomial time
• Improved bounds for the implicit factorization problem

This page was built for publication: Implicit Factoring with Shared Most Significant and Middle Bits

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