scientific article; zbMATH DE number 1303120
From MaRDI portal
Publication:4249635
Recommendations
- scientific article; zbMATH DE number 1182510
- An exhaustive search method to find all small solutions of a multivariate modular linear equation
- Advances in Cryptology - EUROCRYPT 2004
- Small solutions to systems of polynomial equations with integer coefficients
- scientific article; zbMATH DE number 1852134
- Small solutions of polynomial congruences
- Finding a small root of a univariate modular equation
- Small solutions to a given quadratic form with a variable modulus
- An algorithm for finding small roots of multivariate polynomials over the integers
- An approach to solving systems of polynomials via modular arithmetics with applications
Cited in
(22)- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
- Cryptanalysis of RSA for a special case with \(d > e\)
- Cryptanalysis of large RSA exponent by using the LLL algorithm
- Solving linear equations modulo unknown divisors: revisited
- An exhaustive search method to find all small solutions of a multivariate modular linear equation
- Finding a small root of a univariate modular equation
- Cryptographic applications of capacity theory: on the optimality of Coppersmith's method for univariate polynomials
- Solving Simultaneous Modular Equations of Low Degree
- scientific article; zbMATH DE number 1182510 (Why is no real title available?)
- Using LLL-reduction for solving RSA and factorization problems
- Better lattice constructions for solving multivariate linear equations modulo unknown divisors
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- A Strategy for Finding Roots of Multivariate Polynomials with New Applications in Attacking RSA Variants
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications
- Deterministic factoring with oracles
- Instantiability of classical random-oracle-model encryption transforms
- The multi-variable modular polynomial and its applications to cryptography
- Solving modular cubic equations with Coppersmith's method
- On the possibility of a backdoor in the Micali-Schnorr generator
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Distribution of powers modulo p and security of RSA
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249635)
