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

DOI10.1007/978-3-642-13013-7_4MaRDI QIDQ3562887zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

CRT-RSAlatticeslinearizationRSAsmall rootssmall secret exponent

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cited in

(32)

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

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)