The following pages link to (Q4249635):
Displaying 16 items.
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities (Q1382143) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Cryptanalysis of RSA for a special case with \(d > e\) (Q2267091) (← links)
- Cryptanalysis of large RSA exponent by using the LLL algorithm (Q2572356) (← links)
- An exhaustive search method to find all small solutions of a multivariate modular linear equation (Q2843210) (← links)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Solving Simultaneous Modular Equations of Low Degree (Q3783957) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- The hidden number problem with small unknown multipliers: cryptanalyzing MEGA in six queries and other applications (Q6091132) (← links)
- Deterministic factoring with oracles (Q6115442) (← links)
- Instantiability of classical random-oracle-model encryption transforms (Q6175981) (← links)
- The multi-variable modular polynomial and its applications to cryptography (Q6487458) (← links)
- Solving modular cubic equations with Coppersmith's method (Q6543269) (← links)
- On the possibility of a backdoor in the Micali-Schnorr generator (Q6635756) (← links)
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves (Q6652968) (← links)
