Comparison of the discrete logarithm and multiplication of an elliptic curve point by an integer.

Discrete Logarithm (DL) — The problem of function inversion in a finite multiplicative group.

Elliptic Curves (EC) — The encryption algorithm uses the operation of multiplying a point by an integer in a finite field.

The basic idea is that the operations of raising to a power or multiplying a point by a scalar are irreversible.

DL	EC
G		Shared number (point)
A_sk		Alice's secret key
A_pk = G^A_sk	A_pk = A_sk × G	Alice's public key
B_sk		Bob's secret key
B_pk = G^B_sk	B_pk = B_sk × G	Bob's public key
K_s = B_pk^A_sk	K_s = A_sk × B_pk	The shared key is calculated by Alice
K_s = A_pk^B_sk	K_s = B_sk × A_pk	The shared key is calculated by Bob
K_s = A_pk^B_sk = G^{B_sk × A_sk} = B_pk^A_sk	K_s = A_sk × B_sk × G	Substitution of arguments demonstrating the equivalence of calculations К