scientific article; zbMATH DE number 1302812
From MaRDI portal
Publication:4249286
zbMATH Open0956.94007MaRDI QIDQ4249286FDOQ4249286
Authors: Dan Boneh, Glenn Durfee, Yair Frankel 
Publication date: 17 June 1999
Title of this publication is not available (Why is that?)
Recommendations
Cited In (46)
- Finding small roots for bivariate polynomials over the ring of integers
- Forty years of attacks on the RSA cryptosystem: A brief survey
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Revisiting prime power RSA
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
- A Tool Kit for Partial Key Exposure Attacks on RSA
- On the number of sparse RSA exponents
- Distinguishing Multiplications from Squaring Operations
- Large decryption exponents in RSA
- Further cryptanalysis of a type of RSA variants
- Reconstructing RSA Private Keys from Random Key Bits
- Divisors in residue classes, constructively
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- RSA Vulnerabilities with Small Prime Difference
- Improved reconstruction of RSA private-keys from their fraction
- Implicit Related-Key Factorization Problem on the RSA Cryptosystem
- Continued fractions applied to a family of RSA-like cryptosystems
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
- Partial Key Exposure Attacks on RSA with Multiple Exponent Pairs
- Recovering RSA Secret Keys from Noisy Key Bits with Erasures and Errors
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Finding small solutions of the equation \(Bx-Ay=z\) and its applications to cryptanalysis of the RSA cryptosystem
- Generalizing statistical ineffective fault attacks in the spirit of side-channel attacks
- Partial Key Exposure Attack on CRT-RSA
- Perturbating RSA Public Keys: An Improved Attack
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization
- Factoring RSA moduli with primes sharing bits in the middle
- A New Partial Key Exposure Attack on Multi-power RSA
- Classical attacks on a variant of the RSA cryptosystem
- Cryptanalysis of RSA for a special case with \(d > e\)
- On the security of RSA with primes sharing least-significant bits
- Using LLL-reduction for solving RSA and factorization problems
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- A security analysis of two classes of RSA-like cryptosystems
- Partial Key Exposure: Generalized Framework to Attack RSA
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Partial key exposure attacks on BIKE, Rainbow and NTRU
- On the Improvement of the BDF Attack on LSBS-RSA
- Breaking Goppa-based McEliece with hints
- Implicit-key attack on the RSA cryptosystem
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- 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
- Decoding McEliece with a hint -- secret Goppa key parts reveal everything
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249286)
