Publication:4249286
From MaRDI portal
zbMath0956.94007MaRDI QIDQ4249286
Yair Frankel, Dan Boneh, Glenn Durfee
Publication date: 17 June 1999
Related Items
On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA, Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization, Generalizing statistical ineffective fault attacks in the spirit of side-channel attacks, Classical attacks on a variant of the RSA cryptosystem, Factoring RSA moduli with primes sharing bits in the middle, Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents, Partial Key Exposure Attack on CRT-RSA, A New Partial Key Exposure Attack on Multi-power RSA, Cryptanalytic results on `Dual CRT' and `Common Prime' RSA, Partial key exposure attacks on BIKE, Rainbow and NTRU, Continued fractions applied to a family of RSA-like cryptosystems, Further cryptanalysis of a type of RSA variants, Breaking Goppa-based McEliece with hints, Decoding McEliece with a hint -- secret Goppa key parts reveal everything, On the Improvement of the BDF Attack on LSBS-RSA, A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding, Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents, A Tool Kit for Partial Key Exposure Attacks on RSA, Large decryption exponents in RSA, Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound, Implicit Related-Key Factorization Problem on the RSA Cryptosystem, Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors, On the security of RSA with primes sharing least-significant bits, On the number of sparse RSA exponents, Divisors in residue classes, constructively, Cryptanalysis of RSA for a special case with \(d > e\), Using LLL-Reduction for Solving RSA and Factorization Problems, 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, Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors, Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding, Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs, Distinguishing Multiplications from Squaring Operations, Partial Key Exposure: Generalized Framework to Attack RSA, Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits, Improved reconstruction of RSA private-keys from their fraction, Revisiting prime power RSA, Forty years of attacks on the RSA cryptosystem: A brief survey
