Improved bounds for the implicit factorization problem

DOI10.3934/AMC.2013.7.243MaRDI QIDQ2391412zbMATH OpenOpenAlexFDO

Authors Yao Lu, Rui Zhang, Dongdai Lin

Publication date 31 July 2013

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/amc.2013.7.243

zbMATH Keywords

approximate integer common divisorimplicit factorizationlattice

Mathematics Subject Classification ID

Factorization (11Y05) Cryptography (94A60)

Recommendations

• Further improvement of factoring RSA moduli with implicit hint
• Implicit Factoring with Shared Most Significant and Middle Bits
• Implicit factorization of RSA moduli revisited (short paper)
• Implicit factorization of unbalanced RSA moduli
• Further results on implicit factoring in polynomial time

Cited in

(13)

• Improved bound for rank revealing LU factorizations
• Implicit factorization of RSA moduli revisited (short paper)
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Implicit factorization of unbalanced RSA moduli
• On oracle factoring of integers
• Towards optimal bounds for implicit factorization problem
• Improved results on cryptanalysis of prime power RSA
• Improved Balanced Incomplete Factorization
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• Further improvement of factoring RSA moduli with implicit hint
• Generalized implicit factorization problem
• Elliptic-curve factoring, witnesses and oracles
• Implicit factorization with shared any bits

This page was built for publication: Improved bounds for the implicit factorization problem

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