### 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 language | English |
---|---|

Title of host publication | Advances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings |

Publisher | Springer Verlag |

Pages | 127-140 |

Number of pages | 14 |

Volume | 547 LNCS |

ISBN (Print) | 9783540546207 |

DOIs | |

Publication status | Published - 1991 |

Event | Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 - Brighton, United Kingdom Duration: 1991 Apr 8 → 1991 Apr 11 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 547 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 |
---|---|

Country | United Kingdom |

City | Brighton |

Period | 91/4/8 → 91/4/11 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -