Home » Course Layouts » Free Course Layout Udemy
This course is a computationally focused introduction to elliptic curves, with applications to number theory and cryptography.
0
1
English
English [CC]
FREE
- Learn basic syntax that can apply to any language.
- Learn what is a programming language and the basic concepts for beginners.
- Understand what is Javascript in it's truest form.
- Know the basic syntax of Javascript.
- Know some hidden quirks in Javascript.
Description
While this is an introductory course, we will (gently) work our way up to some fairly advanced material, including an overview of the proof of Fermat’s last theorem.
Course content
-
- Introduction to Elliptic Curves (notes) Unlimited
- Introduction to Elliptic Curves (slides) Unlimited
-
- The Group Law and Weierstrass and Edwards Equations (notes) Unlimited
- Finite Field Arithmetic (notes) Unlimited
- Finite Field Arithmetic (slides) Unlimited
- Isogeny Kernels and Division Polynomials (notes) Unlimited
- Isogeny Kernels and Division Polynomials (slides) Unlimited
- Hasse’s Theorem and Point Counting (notes) Unlimited
- Hasse’s Theorem and Point Counting (slides) Unlimited
- Generic Algorithms for the Discrete Logarithm Problem (notes) Unlimited
- Elliptic Curve Primality Proving (ECPP) (notes) Unlimited
- Ordinary and Supersingular Curves (notes) Unlimited
- Elliptic Curves over C (Part II) (notes) Unlimited
- The CM Torsor (notes) Unlimited
- The Modular Equation (notes) Unlimited
- Ring Class Fields and the CM Method (notes) Unlimited
- The Weil Pairing (notes) Unlimited
- Fermat’s Last Theorem (notes) Unlimited
Instructor
Massachusetts Institute of Technology
5
5
1
1916
1520
