Discretization of Coupled Map Lattices for a Stream Cipher

Coupled map lattices (CML) have been recently used to construct ciphers. However, the complicated operations on real numbers make these CML-based ciphers difficult to analyze. This paper presents a new stream cipher with the discretized CML which operates on binary numbers. When discretizing the CML, the effective network structure is explicitly preserved to improve the confusion and diffusion. The proposed cipher can be easily analyzed using proper cryptographic techniques and has good security. The cipher has a strict lower bound on the period length of 264 and its key setup scheme achieves enough diffusion. The keystreams pass all of the NIST statistical randomness tests and have good randomness properties. In addition the cipher is resistant to the guess-and-determine attack.

...In this paper, linear cryptanalysis is applied to a chaosbased stream cipher, which was designed by strictly using the basic design criterion of cryptosystem – confusion and diffusion and passed main security evaluation criterion [7]...
...The cipher that will be analyzed in this paper is based on coupled map lattice (CML) consisting of skew tent maps [7]...
...o [0] 0,n ⊕ o [0] 2,n ⊕ o [0] 3,n = S [0] 3,n ⊕ S [0] 7,n = x [8,7,6] 7,n ⊕ x [8,7,6] 3,n ⊕ 1 = s [8,7,6] 3,n ⊕ 1. (27)...
...o [0] 0,n ⊕ o [0] 2,n ⊕ o [0] 3,n = S [0] 3,n ⊕ S [0] 7,n = x [8,7,6] 7,n ⊕ x [8,7,6] 3,n ⊕ 1 = s [8,7,6] 3,n ⊕ 1. (27)...
...o [0] 0,n ⊕ o [0] 2,n ⊕ o [0] 3,n = S [0] 3,n ⊕ S [0] 7,n = x [8,7,6] 7,n ⊕ x [8,7,6] 3,n ⊕ 1 = s [8,7,6] 3,n ⊕ 1. (27)...
...s [0] 0,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 3,n ⊕ S [0] 7,n ⊕ c [0] [4,0,6,2,7,3],n (28) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 2,n+1 = S [0] 1,n ⊕ S [0] 5,n ⊕ c [0] [4,0,5,1,6,2],n (29) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 3,n+1 = S [0] 0,n ⊕ S [0] 4,n ⊕ c [0] [4,0,5,1,7,3],n (30) s [0] 1,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 2,n ⊕ S [0] 6,n ⊕ C [0] [5,1,6,2,7,3],n (31)...
...s [0] 0,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 3,n ⊕ S [0] 7,n ⊕ c [0] [4,0,6,2,7,3],n (28) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 2,n+1 = S [0] 1,n ⊕ S [0] 5,n ⊕ c [0] [4,0,5,1,6,2],n (29) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 3,n+1 = S [0] 0,n ⊕ S [0] 4,n ⊕ c [0] [4,0,5,1,7,3],n (30) s [0] 1,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 2,n ⊕ S [0] 6,n ⊕ C [0] [5,1,6,2,7,3],n (31)...
...s [0] 0,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 3,n ⊕ S [0] 7,n ⊕ c [0] [4,0,6,2,7,3],n (28) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 2,n+1 = S [0] 1,n ⊕ S [0] 5,n ⊕ c [0] [4,0,5,1,6,2],n (29) s [0] 0,n+1 ⊕ s [0] 1,n+1 ⊕ s [0] 3,n+1 = S [0] 0,n ⊕ S [0] 4,n ⊕ c [0] [4,0,5,1,7,3],n (30) s [0] 1,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = S [0] 2,n ⊕ S [0] 6,n ⊕ C [0] [5,1,6,2,7,3],n (31)...
...s [0] 0,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = s [8,7,6] 3,n ⊕ c [0] [4,0,6,2,7,3],n ⊕ 1. (32)...
...s [0] 0,n+1 ⊕ s [0] 2,n+1 ⊕ s [0] 3,n+1 = s [8,7,6] 3,n ⊕ c [0] [4,0,6,2,7,3],n ⊕ 1. (32)...
...[0] [4,0,6,2,7,3],n. (33) The probability that this equation holds is about 0.5004575, i.e., the probability bias of this equation is about εmax = 0.0004575...
...<{[SECTION]}>[4,0,6,2,7,3],n is guessed to be...

Keywords (6)

Discretization of Coupled Map Lattices for a Stream Cipher,10.1016/S1007-0214(11)70035-9,Tsinghua Science & Technology,Ruming Yin,Jian Yuan,Qiuhua Yan

Citation Context (1)

Ruming Yin, et al. Linear cryptanalysis for a chaos-based stream cipher

Citations (1)

Linear cryptanalysis for a chaos-based stream cipher (Citations: 3)


	The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.


	BibTex \| RIS \| RefWorks Download