9 citations · 15 across the 5 of their papers we have counts for
5 papers
One-Time Pad, Arithmetic Coding and Logic Gates: An unifying theme using Dynamical Systems
Nithin Nagaraj, Prabhakar G. Vaidya
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 p…
Cryptanalysis of a Chaotic Image Encryption Algorithm
Nikhil Balaji, Nithin Nagaraj
Line map, an invertible, two-dimensional chaotic encryption algorithm was introduced recently. In this paper, we propose several weaknesses of the method based on standard cryptana…
A Non-linear Dynamical Systems' Proof of Kraft-McMillan Inequality and its Converse
Nithin Nagaraj
In this short paper, we shall provide a dynamical systems' proof of the famous Kraft-McMillan inequality and its converse. Kraft-McMillan inequality is a basic result in informatio…
A non-linear dynamical systems approach to source compression for constrained sources
Nithin Nagaraj, Prabhakar G. Vaidya, Rajesh Sundaresan
We have recently established a strong connection between the Tent map (also known as Generalized Luroth Series or GLS which is a chaotic, ergodic and lebesgue measure preserving no…
Re-visiting the One-Time Pad
Nithin Nagaraj, Vivek Vaidya, Prabhakar G Vaidya
In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system,also popularly known as the One-Time Pad (OTP). Since then, it has been believed that the perfectly r…