An attack on RSA given a small fraction of the private key bits
From MaRDI portal
Recommendations
Cited in
(54)- Large decryption exponents in RSA
- Factoring RSA moduli with primes sharing bits in the middle
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- On the security of RSA with primes sharing least-significant bits
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
- 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
- Classical attacks on a variant of the RSA cryptosystem
- Approximate divisor multiples -- factoring with only a third of the secret CRT-exponents
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Cryptanalysis of RSA for a special case with \(d > e\)
- Improved reconstruction of RSA private-keys from their fraction
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Revisiting prime power RSA
- Partial key exposure attacks on CRT-RSA: better cryptanalysis to full size encryption exponents
- Partial key exposure attacks on RSA with multiple exponent pairs
- RSA Vulnerabilities with Small Prime Difference
- Partial key exposure attack on CRT-RSA
- A new partial key exposure attack on multi-power RSA
- A tool kit for partial key exposure attacks on RSA
- Partial key exposure: generalized framework to attack RSA
- Reconstructing RSA Private Keys from Random Key Bits
- Implicit related-key factorization problem on the RSA cryptosystem
- Attacking RSA with a composed decryption exponent using unravelled linearization
- On the Improvement of the BDF Attack on LSBS-RSA
- Improved Partial Key Exposure Attacks on RSA by Guessing a Few Bits of One of the Prime Factors
- Distinguishing Multiplications from Squaring Operations
- Cryptanalysis of RSA with private key d less than N/sup 0.292/
- Recovering RSA secret keys from noisy key bits with erasures and errors
- Forty years of attacks on the RSA cryptosystem: a brief survey
- Using LLL-reduction for solving RSA and factorization problems
- Divisors in residue classes, constructively
- Cryptanalysis of Short Exponent RSA with Primes Sharing Least Significant Bits
- Perturbating RSA Public Keys: An Improved Attack
- 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
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- Implicit-key attack on the RSA cryptosystem
- Finding small roots for bivariate polynomials over the ring of integers
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- A security analysis of two classes of RSA-like cryptosystems
- A novel partial key exposure attack on common prime RSA
- A new public key encryption scheme based on the cubic Pell curve using encoding functions
- A new public key cryptosystem based on the cubic Pell curve
- On the number of sparse RSA exponents
- SAT and lattice reduction for integer factorization
- Survey: recovering cryptographic keys from partial information, by example
- Small public exponent brings more: improved partial key exposure attacks against RSA
- On the dangers of RSA exponent transforms
- A novel leakage model in OpenSSL's Miller-Rabin primality test
- On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA
This page was built for publication: An attack on RSA given a small fraction of the private key bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249286)
