Better lattice constructions for solving multivariate linear equations modulo unknown divisors
From MaRDI portal
Publication:5300940
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
(12)- Cryptanalysis of Prime Power RSA with two private exponents
- Improved results on cryptanalysis of prime power RSA
- Partial key exposure attack on CRT-RSA
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Small CRT-Exponent RSA Revisited
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Partial key exposure attacks on RSA with multiple exponent pairs
- Improving bounds on elliptic curve hidden number problem for ECDH key exchange
- A method for obtaining digital signatures and public-key cryptosystems
- A tool kit for partial key exposure attacks on RSA
- Solving linear equations modulo unknown divisors: revisited
- Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
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)