Unit 6: Elliptic Curve Cryptography
This unit will cover elliptic curve cryptography. This approach to public-key cryptography is based on the algebraic structure of elliptic curves over finite fields. This unit includes examples of elliptic curves over the field of real numbers. The next unit will explain the Diffie-Hellman key exchange as the most important example of cryptographic protocol for symmetric key exchange. In the last part of this unit, we will learn about the elliptic curve discrete logarithm problem, which is the cornerstone of much of present-day elliptic curve cryptography.
Completing this unit should take you approximately 12 hours.
6.2: Elliptic Curves
Read this article to learn about elliptic curves. Make sure you understand the examples given. Depending on your mathematics background, you may need to click on the additional links explaining the terminology used.
6.2.1: Diffie-Hellman Key Exchange
Read this page to learn how to exchange the keys with Diffie-Hellman key exchange technique.
6.2.2: Elliptic Curve Discrete Logarithm Problem
Read this page, which introduces elliptic curve discrete logarithm problems. Make sure you know what the problems ask you to solve.