Some applications of lattice based root finding techniques

DOI10.3934/amc.2010.4.519zbMath1225.11093OpenAlexW2090059638MaRDI QIDQ540395

Santanu Sarkar, Subhamoy Maitra

Publication date: 3 June 2011

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

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

zbMATH Keywords

latticeRSAgreatest common divisorfactorizationLLLCRT-RSAdecryption exponentimplicit factorizationsmooth integers

Mathematics Subject Classification ID

Cryptography (94A60) Relations with coding theory (11H71) Factorization (11Y05)

Related Items (1)

Towards Optimal Bounds for Implicit Factorization Problem

This page was built for publication: Some applications of lattice based root finding techniques