Self-synchronizing chaotic stream ciphers

Cryptanalysis of a family of self-synchronizing chaotic stream ciphers

“…In the cryptosystem described in [2] the transformation of the plaintext into the ciphertext is done bitwise and driven by symbolic sequences generated either by the logistic map or by the tent map. Recall that the logistic map is defined as…”

“…Recently a stream cipher based on the symbolic dynamics of the (one-parameter) logistic map and tent map, was proposed in [2]. If the parameter of either map is selected conveniently, then its symbolic sequences pass all the statistical tests necessary for their consideration as keystreams.…”

“…In Sec. 2 the encryption scheme of [2] is explained. After that, some issues relevant to the security of the cryptosystem are highlighted (Sec.…”

Generalized chaos synchronization theorem for array differential equations with application

“…978-1-4244-4888-3/09/$25.00 ©2009 IEEE where the fun ction qli,j (X m , Y)'s guarantee the error equation Proof: '* Since H(X)m is continuously differentiable, Gli ,j(Y, X m ) can be denoted by (16) dH(X m) dY dt dt (qli,j (Y , X m ) ) . de dt to be asymptotically stable.…”

Cryptanalysis of a one round chaos-based Substitution Permutation Network

“…The connection between the basic coordinates of cryptography and chaotic systems has paved the research on chaotic cryptography [2]. A lot of different methods have been proposed in the field of chaos-based cryptography [3][4][5][6][7][8], but many of them show very serious security flaws [9][10][11][12][13][14][15]. A very important family of chaotic cryptosystems is the one inheriting the characteristics of the Substitution Permutation Networks (SPNs), as it is explained in [16].…”