3 ms·
Kind of. Elliptic Curve can be reduced to the Discrete Logarithm problem, which a variant of Shor’s Algorithm solves in polynomial time.
by ShaneCurran 8y ago
Kind of. Elliptic Curve can be reduced to the Discrete Logarithm problem, which a variant of Shor’s Algorithm solves in polynomial time.