Boiled down to the core as I understand it:
A cryptographic algorithm has provable security if it's unbreakable, even if an adversary has unlimited computational power / time.
If my understanding is correct then cryptographic algorithms like RSA / Diffie-Hellman are not considered to be provable secure since they would be broken to an adversary with unlimited computational power / time.
The only classical algorithm I know of that behaves in this manner is the OTP. I'm specifically asking about classical algorithms because I know that there exist quantum cryptographic algorithms that are provable secure, i.e. QKD.
My questions are:
Is my understanding of provable security correct?
And if so, are there any other classical algorithms that are provable secure?