Factoring unbalanced moduli with known bits

DOI10.1007/978-3-642-14423-3_5MaRDI QIDQ3578261zbMATH OpenOpenAlexFDO

Authors Éric Brier, David Naccache, Mehdi Tibouchi

Publication date 16 July 2010

Published in Information, Security and Cryptology – ICISC 2009 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Implicit factorization of unbalanced RSA moduli
• Factoring multi-power RSA modulus N = p^r q with partial known bits
• Further improvement of factoring \(N=p^rq^s\) with partial known bits
• Factoring RSA moduli with primes sharing bits in the middle
• scientific article; zbMATH DE number 1942424

Cited in

(5)

• Further improvement of factoring \(N=p^rq^s\) with partial known bits
• Factorization of Square-Free Integers with High Bits Known
• Factoring RSA modulus using prime reconstruction from random known bits
• Implicit Factoring with Shared Most Significant and Middle Bits
• Factoring multi-power RSA modulus N = p^r q with partial known bits

This page was built for publication: Factoring unbalanced moduli with known bits

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