Perfect-Secrecy Claims With Short Keys Contradict Shannon’s 1949 Proof
Shannon proved in 1949 that perfect secrecy for arbitrary data needs a random key at least as long as the data, used once. A product sold as perfectly secret with a shorter or reused key fails that test.


