Maximizing small root bounds by linearization and applications to small secret exponent RSA

DOI10.1007/978-3-642-13013-7_4zbMATH Open1270.94055OpenAlexW2117948393MaRDI QIDQ3562887FDOQ3562887

Authors: Mathias Herrmann, Alexander May 

Publication date: 28 May 2010

Published in: Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

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

Recommendations

• A unified framework for small secret exponent attack on RSA
• Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
• Small CRT-Exponent RSA Revisited
• scientific article; zbMATH DE number 1852133
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities

zbMATH Keywords

latticesRSAlinearizationsmall rootsCRT-RSAsmall secret exponent

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (27)

• Cryptanalysis of the RSA variant based on cubic Pell equation
• Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
• Generalized cryptanalysis of small CRT-exponent RSA
• On optimal bounds of small inverse problems and approximate GCD problems with higher degree
• Attacking RSA with a composed decryption exponent using unravelled linearization
• Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
• An improved analysis on three variants of the RSA cryptosystem
• A unified framework for small secret exponent attack on RSA
• Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA
• Further cryptanalysis of a type of RSA variants
• Small CRT-exponent RSA revisited
• Improved results on cryptanalysis of prime power RSA
• Continued fractions applied to a family of RSA-like cryptosystems
• A unified method for private exponent attacks on RSA using lattices
• Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
• Partial key exposure attack on short secret exponent CRT-RSA
• A small secret exponent attack on cryptosystems using Dickson polynomials
• Forty years of attacks on the RSA cryptosystem: a brief survey
• Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
• A security analysis of two classes of RSA-like cryptosystems
• New Results of Breaking the CLS Scheme from ACM-CCS 2014
• Small CRT-Exponent RSA Revisited
• Practical attacks on small private exponent RSA: new records and new insights
• Cryptanalysis of Dual RSA
• Implicit related-key factorization problem on the RSA cryptosystem
• Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
• A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations

This page was built for publication: Maximizing small root bounds by linearization and applications to small secret exponent RSA

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