... is equivalent to proving that P != NP. (E.g. proving that ECDLP cannot be solved would mean that there exist a class of problems which can be quickly verified but cannot be quickly solved.)