Implicit factorization of RSA moduli revisited (short paper)

DOI10.1007/978-3-319-22425-1_5zbMATH Open1398.94150OpenAlexW2224456416MaRDI QIDQ1800575FDOQ1800575

Zhangjie Huang, Yao Lu, Liqiang Peng, Jun Xu, Lei Hu

Publication date: 24 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-22425-1_5

Recommendations

• Further improvement of factoring RSA moduli with implicit hint
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit factorization of unbalanced RSA moduli
• Improved bounds for the implicit factorization problem
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint

zbMATH Keywords

middle bitCoppersmith's techniquefactorization with implicit hintRSA modulus

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Cited In (4)

• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Further results on implicit factoring in polynomial time
• Generalized implicit factorization problem

This page was built for publication: Implicit factorization of RSA moduli revisited (short paper)

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