2021/08/16 by Umberto Cerruti, Cerruti, Umberto
Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Chaos-based Image/Signal Encryption #Computability, Logic, AI Algorithms #Cryptography and Security (cs.CR) #FOS: Computer and information sciences
paper · pdf · doi:10.48550/arxiv.2108.06981
openalex publication_date 2021/08/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This is a survey on the One Time Pad (OTP) and its derivatives, from its origins to modern times. OTP, if used correctly, is (the only) cryptographic code that no computing power, present or future, can break. Naturally, the discussion shifts to the creation of long random sequences, starting from short ones, which can be easily shared. We could call it the Short Key Dream. Many problems inevitably arise, which affect many fields of computer science, mathematics and knowledge in general. This work presents a vast bibliography that includes fundamental classical works and current papers on randomness, pseudorandom number generators, compressibility, unpredictability and more.