Главная
Study mode:
on
1
Intro
2
What are elliptic curves
3
History
4
Venn Diagram
5
Examples
6
Finite Subgroup
7
SIDHI
8
CRS
9
Algorithm
10
Quantum Fourier Transform
11
Random Case
12
Control Not
13
Lattice Approach
Description:
Explore the foundations of elliptic curve isogenies in public key cryptography with David Jao from the University of Waterloo in this 43-minute lecture. Delve into the history and core concepts of elliptic curves, finite subgroups, and their applications in cryptographic systems. Examine the Supersingular Isogeny Diffie-Hellman (SIDH) and Isogeny-based Cryptographic Random Self-reducible Assumption (ICRSA) protocols. Investigate quantum cryptanalysis techniques, including the Quantum Fourier Transform and lattice approaches, as they relate to post-quantum cryptography. Gain insights into the random case scenario and control mechanisms within this advanced cryptographic framework.

Overview of Elliptic Curve Isogenies Based Public Key Cryptography Assumptions

Simons Institute
Add to list