The Mathematics of Public-Key Cryptography, Lecture 15

November 7, 2000

Summary of material covered in lecture 15

• generic algorithms for the DLP (continued)
  • nonadaptive generic algorithms for the DLP
  • success probability of a nonadaptive generic algorithm
  • complexity bound for nonadaptive generic algorithms
  • generalization to adaptive algorithms
• elliptic curve groups (introduction)
  • motivation fo elliptic curve cryptography
  • definition of an elliptic curve over the reals
  • the group operation for an elliptic curve