Better lattice constructions for solving multivariate linear equations modulo unknown divisors
From MaRDI portal
Recommendations
- Solving linear equations modulo unknown divisors: revisited
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Probability method for cryptanalysis of general multivariate modular linear equation
- scientific article; zbMATH DE number 1303120
- Minkowski sum based lattice construction for multivariate simultaneous Coppersmith's technique and applications to RSA
Cited in
(15)- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Solving linear equations modulo unknown divisors: revisited
- Partial key exposure attacks on RSA with multiple exponent pairs
- Partial key exposure attack on CRT-RSA
- A tool kit for partial key exposure attacks on RSA
- Improved results on cryptanalysis of prime power RSA
- A method for obtaining digital signatures and public-key cryptosystems
- Cryptanalysis of Prime Power RSA with two private exponents
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Small CRT-Exponent RSA Revisited
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
- A more complete cryptanalysis of the RSA-polynomial problem
- A novel partial key exposure attack on common prime RSA
- New results on elliptic curve hidden number problem for ECDH key exchange
This page was built for publication: Better lattice constructions for solving multivariate linear equations modulo unknown divisors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300940)