Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
From MaRDI portal
Cites work
- A generalized attack on the multi-prime power RSA
- A method for obtaining digital signatures and public-key cryptosystems
- A New Lattice Construction for Partial Key Exposure Attack for RSA
- A third is all you need: extended partial key exposure attack on CRT-RSA with additive exponent blinding
- Better lattice constructions for solving multivariate linear equations modulo unknown divisors
- Cryptanalysis of an RSA variant with moduli \(N=p^r q^l\)
- Cryptanalysis of the multi-power RSA cryptosystem variant
- Extended partial key exposure attacks on RSA: improvement up to full size decryption exponents
- Factoring integers with elliptic curves
- Factoring multi-power RSA modulus N = p^r q with partial known bits
- Finding a small root of a bivariate integer equation; factoring with high bits known
- Finding a small root of a univariate modular equation
- How to generalize RSA cryptanalyses
- scientific article; zbMATH DE number 1583953 (Why is no real title available?)
- scientific article; zbMATH DE number 2085435 (Why is no real title available?)
- scientific article; zbMATH DE number 3750287 (Why is no real title available?)
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 1302812 (Why is no real title available?)
- scientific article; zbMATH DE number 1302856 (Why is no real title available?)
- scientific article; zbMATH DE number 1303131 (Why is no real title available?)
- scientific article; zbMATH DE number 475431 (Why is no real title available?)
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- scientific article; zbMATH DE number 1418303 (Why is no real title available?)
- Partial key exposure attack on CRT-RSA
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound
- Partial key exposure: generalized framework to attack RSA
- Public Key Cryptography – PKC 2004
- Revisiting prime power RSA
- Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
- Solving linear equations modulo unknown divisors: revisited
- Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems
- Using LLL-reduction for solving RSA and factorization problems
This page was built for publication: Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633578)
