Cryptanalysis of a cryptosystem using multiple one-dimensional chaotic maps
โ Scribed by Jun Wei; Xiaofeng Liao; Kwok-wo Wong; Tsing Zhou
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 139 KB
- Volume
- 12
- Category
- Article
- ISSN
- 1007-5704
No coin nor oath required. For personal study only.
โฆ Synopsis
Recently, a new chaotic cryptosystem using external 128-bit key and multiple chaotic maps has been proposed. In this paper, a fundamental flaw of this cryptosystem is pointed out and a known plaintext attack is presented. Furthermore, a remedial modification is suggested, which avoids the flaw while keeping all the merits of the original cryptosystem.
๐ SIMILAR VOLUMES
## Phys. Lett. A 309 (2003) 75] have developed a symmetric key block cipher algorithm using a one-dimensional chaotic map. In this paper, we propose a symmetric key block cipher algorithm in which multiple one-dimensional chaotic maps are used instead of a one-dimensional chaotic map. However, we
We use a recently found parametrization of the solutions of the inverse Frobenius-Perron problem within the class of complete unimodal maps to develop a Monte Carlo approach for the construction of one-dimensional chaotic dynamical laws with given statistical properties, i.e. invariant density and a
This paper derives a renormalization formula defined on the parameter space where mapping behavior is preserved, together with the equivalent potential function. In contrast to the universal function given by Feigenbaum, the behavior near the critical point is governed by the potential function. The