Pages that link to "Item:Q5459084"
From MaRDI portal
The following pages link to A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants (Q5459084):
Displayed 23 items.
- Cryptanalysis of Dual RSA (Q517262) (← links)
- A new method of constructing a lattice basis and its applications to cryptanalyse short exponent RSA (Q966349) (← links)
- Cryptanalysis of RSA with two decryption exponents (Q991745) (← links)
- Cryptanalysis of RSA with more than one decryption exponent (Q991798) (← links)
- A generalized attack on some variants of the RSA cryptosystem (Q1726690) (← links)
- Partial key exposure attacks on RSA: achieving the Boneh-Durfee bound (Q1727391) (← links)
- On the optimality of lattices for the Coppersmith technique (Q1745898) (← links)
- The polynomial approximate common divisor problem and its application to the fully homomorphic encryption (Q1750401) (← links)
- Cryptanalytic results on `Dual CRT' and `Common Prime' RSA (Q1934238) (← links)
- Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents (Q2794514) (← links)
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith’s Methods (Q2817871) (← links)
- On the Security of Supersingular Isogeny Cryptosystems (Q2958115) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- A Tool Kit for Partial Key Exposure Attacks on RSA (Q2975796) (← links)
- An Improved Analysis on Three Variants of the RSA Cryptosystem (Q2980851) (← links)
- Improved Results on Cryptanalysis of Prime Power RSA (Q2988352) (← links)
- Partial Key Exposure: Generalized Framework to Attack RSA (Q3104725) (← links)
- Recovering zeros of polynomials modulo a prime (Q3189458) (← links)
- Attacking RSA with a Composed Decryption Exponent Using Unravelled Linearization (Q3454586) (← links)
- On the security of multi-prime RSA (Q3537519) (← links)
- Combined Attack on CRT-RSA (Q4916010) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Small CRT-Exponent RSA Revisited (Q5738972) (← links)