2008/03/01 by Nithin Nagaraj, Nagaraj, Nithin, Prabhakar G. Vaidya +1
Biochemistry, Genetics and Molecular Biology · Computer Science · Physics and Astronomy · #Cellular Automata and Applications #Chaos-based Image/Signal Encryption #Chaotic Dynamics (nlin.CD) #Cryptography and Security (cs.CR) #DNA and Biological Computing #FOS: Computer and information sciences #FOS: Physical sciences #cs.CR #nlin.CD
paper · pdf · doi:10.48550/arxiv.0803.0046
9 pages, 7 figures, 1 table
arxiv created 2008/03/01 · openalex publication_date 2008/03/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This turns out to be a special case of Grangetto's randomized arithmetic coding performed on the Binary Map. Furthermore, we derive the set of possible perfect secrecy systems using such an approach. Since OTP encryption is an XOR operation, we thus have a dynamical systems implementation of the XOR gate. We show similar implementations for other gates such as NOR, NAND, OR, XNOR, AND and NOT. The dynamical systems framework unifies the three areas to which Shannon made foundational contributions: lossless compression (Source Coding), perfect encryption (Cryptography), and design of logic gates (Computation)