A Secret Key Cryptosystem by Iterating a Chaotic Map
Chaos is introduced to cryptology. As an example of the applications, a secret key cryptosystem by iterating a one dimensional chaotic map is proposed. This system is based on the characteristics of chaos, which are sensitivity of parameters, sensitivity of initial points, and randomness of sequences obtained by iterating a chaotic map. A ciphertext is obtained by the iteration of a inverse chaotic map from an initial point, which denotes a plaintext. If the times of the iteration is large enough, the randomness of the encryption and the decryption function is so large that attackers cannot break this cryptosystem by statistic characteristics. In addition to the security of the statistical point, even if the cryptosystem is composed by a tent map, which is one of the simplest chaotic maps, setting a finite computation size avoids a ciphertext only attack. The most attractive point of the cryptosystem is that the cryptosystem is composed by only iterating a simple calculations though the information rate of the cryptosystem is about 0.5.
- S. Oishi and H. Inoue: “Pseudo-Random Number Generators and Chaos”, Trans. IECE Japan, E65,9, pp.534–541 (Sept. 1982)Google Scholar
- G. K. Bhattacharyya and R. A. Johnson: “Statistical Concepts and Methods”, John Wiley and Sons, Tronto, 1977.Google Scholar
- T. Habutsu, Y. Nishio, I. Sasase, and S. Mori: “A Secret Key Cryptosystem Using a Chaotic Map”, Trans. IEICE Japan, E73,7, pp.1041–1044 (July 1990)Google Scholar