TY - GEN
T1 - A secret key cryptosystem by iterating a chaotic map
AU - Habutsu, Toshiki
AU - Nishio, Yoshifumi
AU - Sasase, Iwao
AU - Mori, Shinsaku
PY - 1991/1/1
Y1 - 1991/1/1
N2 - 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 cryptosystern 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.
AB - 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 cryptosystern 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.
UR - http://www.scopus.com/inward/record.url?scp=84893107930&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893107930&partnerID=8YFLogxK
U2 - 10.1007/3-540-46416-6_11
DO - 10.1007/3-540-46416-6_11
M3 - Conference contribution
AN - SCOPUS:84893107930
SN - 9783540546207
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 127
EP - 140
BT - Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
A2 - Davies, Donald W.
PB - Springer Verlag
T2 - Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991
Y2 - 8 April 1991 through 11 April 1991
ER -