Will being able to find the discrete logarithm put an end to elliptic cryptography?

Question

Mathematics

There is an opinion that finding DLOG on an elliptic curve (1) is more difficult than finding DLOG in a finite field (2). At the same time, the wiki says that problem (1) reduces to (2) (with some extension of the field on which the elliptic curve was given).
Is it true that if a way to quickly find DLOG in a finite field is found, then this will automatically solve the problem of finding DLOG on an elliptic curve (and make all elliptic cryptography irrelevant)?