Elliptic curves: discrete logarithm problem
Written by Dominik Joe Pantůček on 2018-05-10
Algebraic groups built on top of points of elliptic curves together with the scalar multiplication specified as repeated addition can be used as basic building blocks for asymmetric cryptography systems. The strength of these systems if derived from the toughness of the reversing the scalar multiplication operation. It is very expensive to reverse this operation and to answer a question like "how many times we have to multiply point G to get given point P". This problem is called Elliptic Curve Discrete Logarithm Problem - or ECDLP for short. In this article we show the toughness of this problem.
