On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree

DOI10.1007/978-3-642-33383-5_4zbMath1401.94162OpenAlexW26608263MaRDI QIDQ4648490

Noboru Kunihiro

Publication date: 9 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33383-5_4

zbMATH Keywords

LLL algorithmRSA cryptosystemsmall inverse problemapproximate GCD problem

Mathematics Subject Classification ID

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

Related Items (7)

Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ On the optimality of lattices for the Coppersmith technique ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Generalized cryptanalysis of small CRT-exponent RSA

This page was built for publication: On Optimal Bounds of Small Inverse Problems and Approximate GCD Problems with Higher Degree