I'm not replying with a chat bot answer, I just happen to know this stuff. Didn't mean to geek out on you like that!
What I'm trying to say is that there is a way to mathematically prove the computational complexity of a mathematical problem, so we don't have to assume that discrete logs with EC is difficult because we can prove that it is so computationally intensive that it takes way too long to crack in a reasonable time frame.
That's only proving that it's hard for the most efficient classical algorithm we currently know of. It hasn't been proved *for any/all* algorithms.
I can agree on that! Especially later down the line, when quantum computing ever becomes a thing, all of these algorithms will have time complexities that are child's play for a quantum machine. Satoshi even warned about having to upgrade one day when SHA-256 is rendered useless.
Allow me to add Giacomo Zucco talking about just this. https://youtu.be/U3Y5Cab1nlA
#[6]
