Elliptic curves: discrete logarithm problem

Described in https://trustica.cz/2018/05/10/elliptic-curves-discrete-logarithm-problem/ this video shows the difference of performing fast scalar multiplication of points on elliptic curve in simple Weierstrass form y²=x³-2x+15 over GF(23) using the double-and-add algorithm and the toughness of reversing this operation - called the Elliptic Curve Discrete Logarithm Problem. Please subscribe to our YouTube channel and remember to follow us on Twitter: https://twitter.com/trusticacz