Elliptic Curve Cryptography Overview

John Wagnon discusses the basics and benefits of Elliptic Curve Cryptography (ECC) in this episode of Lightboard Lessons. Check out this article on DevCentral that explains ECC encryption in more detail: https://community.f5.com/articles/real-cryptography-has-curves-making-the-case-for-ecc-20832 Corrections: 02:24 As we all know, a prime number only has itself and 1 as factors. So, if you multiply two numbers together, the resultant number will at least have the two numbers you multiplied as factors…thus not making it prime. Technically speaking, the product of the two prime numbers in RSA is called a “semiprime” number because its only factors are 1, itself, and two prime numbers. 00:12 - Public key crypto system 01:37 - Trapdoor functions 03:05 - Stronger security with smaller key sizes 04:35 - Elliptic curves are symmetric about the x-axis 05:57 - The dot function and intersecting points 07:20 - Ensuring data falls within limits 08:47 - Private key determination 10:08 - Trapdoor function revisited