Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
From MaRDI portal
Publication:3562887
DOI10.1007/978-3-642-13013-7_4zbMath1270.94055OpenAlexW2117948393MaRDI QIDQ3562887
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
Related Items (24)
A Unified Framework for Small Secret Exponent Attack on RSA ⋮ Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\) ⋮ Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization ⋮ 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 ⋮ Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents ⋮ An Improved Analysis on Three Variants of the RSA Cryptosystem ⋮ Improved Results on Cryptanalysis of Prime Power RSA ⋮ Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound ⋮ Implicit Related-Key Factorization Problem on the RSA Cryptosystem ⋮ Cryptanalysis of the RSA variant based on cubic Pell equation ⋮ A Wiener-type attack on an RSA-like cryptosystem constructed from cubic Pell equations ⋮ Cryptanalysis of Dual RSA ⋮ Coppersmith's lattices and ``focus groups: an attack on small-exponent RSA ⋮ Small CRT-Exponent RSA Revisited ⋮ Small CRT-exponent RSA revisited ⋮ Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem ⋮ Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents ⋮ Generalized cryptanalysis of small CRT-exponent RSA ⋮ A small secret exponent attack on cryptosystems using Dickson polynomials ⋮ A Unified Method for Private Exponent Attacks on RSA Using Lattices ⋮ Forty years of attacks on the RSA cryptosystem: A brief survey
This page was built for publication: Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
