The following pages link to (Q4249635):
Displaying 8 items.
- 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)
- Cryptographic Applications of Capacity Theory: On the Optimality of Coppersmith’s Method for Univariate Polynomials (Q2958146) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← 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)