On optimal bounds of small inverse problems and approximate GCD problems with higher degree

DOI10.1007/978-3-642-33383-5_4MaRDI QIDQ4648490zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• General bounds for small inverse problems and its applications to multi-prime RSA
• On the optimality of lattices for the Coppersmith technique
• Maximizing small root bounds by linearization and applications to small secret exponent RSA
• scientific article; zbMATH DE number 1182510
• Solving linear equations modulo unknown divisors: revisited

Cited in

(9)

• Cryptanalysis of the RSA variant based on cubic Pell equation
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• On the optimality of lattices for the Coppersmith technique
• Generalized cryptanalysis of small CRT-exponent RSA
• General bounds for small inverse problems and its applications to multi-prime RSA
• Small CRT-exponent RSA revisited
• Partial prime factor exposure attacks on some RSA variants
• Small CRT-Exponent RSA Revisited
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents

This page was built for publication: On optimal bounds of small inverse problems and approximate GCD problems with higher degree

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