ConceptTheory & Algos
Elliptic curve discrete logarithm problem hardness
The assumption that solving the elliptic curve discrete logarithm problem is computationally infeasible for properly chosen curves, providing security for protocols.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.