Paper Info
Title
One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems
Abstract
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 opera- tion, 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).
Year
Venue
Keywords
2008
Clinical Orthopaedics and Related Research
arithmetic coding,one time pad,source code,lossless compression,logic gate,dynamic system,initial condition
Field
DocType
Volume
One-time pad,XNOR gate,Cryptography,XOR gate,Theoretical computer science,Encryption,Dynamical systems theory,Mathematics,Arithmetic coding,Context-adaptive binary arithmetic coding
Journal
abs/0803.0
Citations 
PageRank 
References 
1
0.36
1
Authors
2
Name
Order
Citations
PageRank
Nithin Nagaraj1229.28
Prabhakar G. Vaidya251.16