General bounds for small inverse problems and its applications to multi-prime RSA

DOI10.1007/978-3-319-15943-0_1zbMATH Open1457.94185OpenAlexW599933888MaRDI QIDQ2942822FDOQ2942822

Authors: Atsushi Takayasu, Noboru Kunihiro 

Publication date: 11 September 2015

Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_1

Recommendations

• On optimal bounds of small inverse problems and approximate GCD problems with higher degree
• Cryptanalysis of RSA with multiple small secret exponents
• Cryptanalysis of multi-prime RSA with small prime difference
• Attacks on multi-prime RSA with small prime difference
• Public Key Cryptography - PKC 2006

zbMATH Keywords

cryptanalysisCoppersmith's methodLLL algorithmmulti-prime RSAsmall inverse problems

Mathematics Subject Classification ID

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

Cited In (4)

• On optimal bounds of small inverse problems and approximate GCD problems with higher degree
• A unified method for private exponent attacks on RSA using lattices
• Small CRT-Exponent RSA Revisited
• A tool kit for partial key exposure attacks on RSA

This page was built for publication: General bounds for small inverse problems and its applications to multi-prime RSA

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