pith. sign in

arxiv: nlin/0608020 · v1 · submitted 2006-08-10 · 🌊 nlin.CD · cs.CR

Cryptanalysis of a chaotic block cipher with external key and its improved version

classification 🌊 nlin.CD cs.CR
keywords cipherchaoticblockimprovedknownproposedsecuritysome
0
0 comments X
read the original 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 exists; 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.