1 of 13

Lec 5: Lattice Method in RSA Cryptanalysis

2 of 13

Recap

  •  

3 of 13

Algorithm

  •  

4 of 13

Coppersmith’s theorem

  •  

5 of 13

Related plaintext attack 3

  •  

6 of 13

  •  

7 of 13

 

  •  

8 of 13

Step 1

  •  

9 of 13

  •  

10 of 13

  •  

11 of 13

  •  

12 of 13

Step 2

  •  

13 of 13

References

  • [Coppersmith97] Don Coppersmith. Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities. In Journal of Cryptology 10(4).
  • [CM07] Jean-Sebastien Coron and Alexander May. Deterministic Polynomial-Time Equivalence of Computing the RSA Secret Key and Factoring. In Journal of Cryptology 20(1).