INDOCRYPT '01 Proceedings of the Second International Conference on Cryptology in India: Progress in Cryptology
Proceedings of the 8th IMA International Conference on Cryptography and Coding
ICCOM'05 Proceedings of the 9th WSEAS International Conference on Communications
Algebraic break of image ciphers based on discretized chaotic map lattices
Information Sciences: an International Journal
Weakness analysis of a key stream generator based on cellular automata
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Image encryption using index based chaotic sequence, M sequence and gold sequence
Proceedings of the 2011 International Conference on Communication, Computing & Security
Image encryption using a new chaos based encryption algorithm
Proceedings of the 2011 International Conference on Communication, Computing & Security
Cryptanalysis of a cellular automata cryptosystem
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Weak key analysis and micro-controller implementation of CA stream ciphers
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
Chaotic keystream generator using coupled NDFs with parameter perturbing
CANS'06 Proceedings of the 5th international conference on Cryptology and Network Security
Chaotic encryption method based on life-like cellular automata
Expert Systems with Applications: An International Journal
Secure chaotic system with application to chaotic ciphers
Information Sciences: an International Journal
Chaos based key expansion function for block ciphers
Multimedia Tools and Applications
Hi-index | 0.00 |
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.