Why is the discrete logarithm problem assumed to be hard?
Someone else asked the same question but the answers only explain that exponentiation is in $O(\log(n))$ while the fastest known algorithms to compute discrete logarithms is in $O(n)$. (I'm glossing over details like the runtime of index calculus here.)
Somewhere else I read: "We assume discrete logarithms to be hard because for over 40 years very smart people failed to find a fast algorithm."
Now, I wonder if there are any better arguments. Can you actually explain why discrete logarithms are hard?