Explore the fundamentals of Elliptic Curve Cryptography (ECC) in this 25-minute conference talk from BSidesSF 2016. Gain insights into the basics of ECC without delving into complex mathematics, focusing on how "point addition on curves" enables secure secret code exchange over public connections. Learn about the infamous backdoor in Dual_EC_DRGB random number generator and the Juniper incident. Discover the importance of ECC expertise in cybersecurity while covering topics such as elliptic curves, discrete logarithm problems, random number generators, and NSA curves. By the end of this presentation, improve your understanding of ECC-related articles and recognize the significance of cultivating more ECC experts in the field.
Elliptic Curve Cryptography for Those Who Are Afraid of Math
Security BSides San Francisco via YouTube
Overview
Syllabus
Introduction
Elliptic Curve
Discrete logarithm problem
Random number generators
Who knows D
NSA Curves
Conclusion
Taught by
Security BSides San Francisco
Related Courses
-
Elliptic Curve Cryptography for Those Who Are Afraid of Maths
-
Elliptic Curve Cryptography for Those Who Are Afraid of Mathematics
-
Getting Ahead of the Elliptic Curve
-
Cover and Decomposition Index Calculus on Elliptic Curve
-
Elliptic Curve Cryptography - What It Is and Who Needs It
-
The Factoring Dead - Preparing for the Cryptopocalypse
