Further results on implicit factoring in polynomial time

DOI10.3934/amc.2009.3.205zbMath1231.11141OpenAlexW2041258513MaRDI QIDQ2268250

Subhamoy Maitra, Santanu Sarkar

Publication date: 10 March 2010

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

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

zbMATH Keywords

lattice reductionefficient factoringimplicit informationRSA numbers

Mathematics Subject Classification ID

Cryptography (94A60) Factorization (11Y05)

Related Items (7)

Attacking (EC)DSA Given Only an Implicit Hint ⋮ The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications ⋮ Deterministic factoring with oracles ⋮ Non-Interactive Key Exchange ⋮ Towards Optimal Bounds for Implicit Factorization Problem ⋮ A probabilistic analysis on a lattice attack against DSA ⋮ Implicit factorization of unbalanced RSA moduli

This page was built for publication: Further results on implicit factoring in polynomial time