Cryptosystems with discretized chaotic maps

Naoki Masuda, Kazuyuki Aihara

Research output: Contribution to journalArticlepeer-review

210 Citations (Scopus)

Abstract

Many kinds of chaotic cryptosystems have been proposed so far. Chaotic systems dissipate information due to orbital instability with positive Lyapunov exponents and ergodicity. If these properties are appropriately utilized, chaotic cryptosystems are supposed to realize high security. However, most of the existing secure communication techniques using chaos do not have enough security. For example, secure communication protocols based on chaos synchronization require robustness which gives useful information to attackers. The cryptosystems based on direct applications of chaotic maps have been weak against linear and differential cryptoanalysis. In this paper, a new kind of chaotic cryptosystem which overcomes these difficulties to some extents is proposed. The cryptosystem is based on a discretization of the skew tent map. We also show some of the desirable properties of the proposed cryptosystem using dynamical characteristics. These properties regarding ciphertext randomness may be closely related to the cryptological security. Our new cryptosystem shall be one step to connect the theory of commonly used cryptosystems and dynamical system theory.

Original languageEnglish
Pages (from-to)28-40
Number of pages13
JournalIEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Volume49
Issue number1
DOIs
Publication statusPublished - 2002 Jan
Externally publishedYes

Keywords

  • Chaotic cryptosystem
  • Discretization
  • Exponential information decay
  • Skew tent map

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Cryptosystems with discretized chaotic maps'. Together they form a unique fingerprint.

Cite this