A secret key cryptosystem by iterating a chaotic map

Toshiki Habutsu, Yoshifumi Nishio, Iwao Sasase, Shinsaku Mori

Research output: Chapter in Book/Report/Conference proceedingConference contribution

181 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
PublisherSpringer Verlag
Pages127-140
Number of pages14
Volume547 LNCS
ISBN (Print)9783540546207
DOIs
Publication statusPublished - 1991
EventWorkshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 - Brighton, United Kingdom
Duration: 1991 Apr 81991 Apr 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume547 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherWorkshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991
CountryUnited Kingdom
CityBrighton
Period91/4/891/4/11

Fingerprint

Chaotic Map
Cryptosystem
Cryptography
Randomness
Chaos
Chaos theory
Tent Map
Iteration
Information Rates
Cryptology
Parameter Sensitivity
One-dimensional Maps
Encryption
Statistic
Attack
Denote
Statistics

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Habutsu, T., Nishio, Y., Sasase, I., & Mori, S. (1991). A secret key cryptosystem by iterating a chaotic map. In Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings (Vol. 547 LNCS, pp. 127-140). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 547 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-46416-6_11

A secret key cryptosystem by iterating a chaotic map. / Habutsu, Toshiki; Nishio, Yoshifumi; Sasase, Iwao; Mori, Shinsaku.

Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 547 LNCS Springer Verlag, 1991. p. 127-140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 547 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Habutsu, T, Nishio, Y, Sasase, I & Mori, S 1991, A secret key cryptosystem by iterating a chaotic map. in Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. vol. 547 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 547 LNCS, Springer Verlag, pp. 127-140, Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991, Brighton, United Kingdom, 91/4/8. https://doi.org/10.1007/3-540-46416-6_11
Habutsu T, Nishio Y, Sasase I, Mori S. A secret key cryptosystem by iterating a chaotic map. In Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 547 LNCS. Springer Verlag. 1991. p. 127-140. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-46416-6_11
Habutsu, Toshiki ; Nishio, Yoshifumi ; Sasase, Iwao ; Mori, Shinsaku. / A secret key cryptosystem by iterating a chaotic map. Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings. Vol. 547 LNCS Springer Verlag, 1991. pp. 127-140 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{f38fe5e00b4d474baef0537e8020f7fa,
title = "A secret key cryptosystem by iterating a chaotic map",
abstract = "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.",
author = "Toshiki Habutsu and Yoshifumi Nishio and Iwao Sasase and Shinsaku Mori",
year = "1991",
doi = "10.1007/3-540-46416-6_11",
language = "English",
isbn = "9783540546207",
volume = "547 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "127--140",
booktitle = "Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings",
address = "Germany",

}

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

Y1 - 1991

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

SN - 9783540546207

VL - 547 LNCS

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

PB - Springer Verlag

ER -