True / False
Claim: The one-time pad (ciphertext c = m XOR k with a uniformly random key k used only once and as long as the message) provides information-theoretic perfect secrecy, meaning no amount of computation, classical or quantum, can break a properly used one-time pad.