Abstract
This paper studies the relationship between deterministic chaos and cryptographic systems. The theoretical background upon which this relationship is based, includes discussions on chaos, ergodicity, complexity, randomness, unpredictability, incompressibility. Exactly solvable and one-step unpredictable chaotic systems have a fundamental application in cryptography. Two approaches to the finite-state implementation of chaotic systems are considered: (i) floating-point approximation of continuous-state chaos; (ii) binary pseudo-chaos. Pseudo-Chaotic Number Generators (PCNG) are studied using a finite-state chaotic system to produce a sequence of bits. The essence of a PCNG is a nonlinear iterated function. PCNG are an important component of a cryptographic system and play the same role as Pseudo-Random Number Generators (PRNG) in conventional cryptographic systems. An overview is given of existing chaos-based encryption algorithms along with their strengths and weaknesses.
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have