Name
Abstract | ||
|---|---|---|
Recently, Pareek et al. proposed a symmetric key block cipher using multiple one-dimensional chaotic maps. This paper reports some new findings on the security problems of this kind of chaotic cipher: (1) a number of weak keys exist; (2) some important intermediate data of the cipher are not sufficiently random; (3) the whole secret key can be broken by a known-plaintext attack with only 120 consecutive known plain-bytes in one known plaintext. In addition, it is pointed out that an improved version of the chaotic cipher proposed by Wei et al. still suffers from all the same security defects. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.chaos.2006.08.025 | Chaos, Solitons & Fractals |
Keywords | Field | DocType |
cryptanalysis,chaos,encryption,known-plaintext attack,divide-and-conquer dac pacs: 05.45.ac/vx/pq,known plaintext attack,divide and conquer,block cipher | Transposition cipher,Weak key,Rail fence cipher,Running key cipher,Theoretical computer science,Stream cipher,Substitution cipher,Two-square cipher,Polyalphabetic cipher,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 1 | 0960-0779 |
Citations | PageRank | References |
13 | 1.39 | 3 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chengqing Li | 1 | 928 | 64.94 |
| Shujun Li | 2 | 1131 | 116.82 |
| Gonzalo Álvarez | 3 | 13 | 1.39 |
| Guanrong Chen | 4 | 12378 | 1130.81 |
| Kwok-Tung Lo | 5 | 662 | 66.15 |