Further Improvement of Factoring RSA Moduli with Implicit Hint

DOI10.1007/978-3-319-06734-6_11zbMath1288.94081OpenAlexW159286319MaRDI QIDQ4981766

Lei Hu, Zhangjie Huang, Liqiang Peng, Jun Xu, Yong Hong Xie

Publication date: 24 June 2014

Published in: Progress in Cryptology – AFRICACRYPT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06734-6_11

zbMATH Keywords

Coppersmith's techniquefactorization with implicit hintRSA modulus

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (6)

The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Cryptanalysis of Dual 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 ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey

This page was built for publication: Further Improvement of Factoring RSA Moduli with Implicit Hint