论文信息 - Cryptanalysis of a Cellular Automata Cryptosystem

Cryptanalysis of a Cellular Automata Cryptosystem

In this paper we show that the new Cellular Automata Cryptosystem (CAC) is insecure and can be broken by chosen-plaintexts attack with little computation. We also restore the omitted parts clearly by deriving the rotating number δ of plaintext bytes and the procedure of Major CA. The clock circle Δ of Major CA and the key SN are also attacked.

Xinmei Wang | Xiangguo Cheng | Jingmei Liu

[1] Howard Gutowitz,et al. Cryptography with Dynamical Systems , 1993 .

[2] Feng Bao,et al. Cryptanalysis of a New Cellular Automata Cryptosystem , 2003, ACISP.

[3] Parimal Pal Chaudhuri,et al. Theory and Applications of Cellular Automata in Cryptography , 1994, IEEE Trans. Computers.

[4] Stephen Wolfram. Cryptography with Cellular Automata , 1985, CRYPTO.

[5] Palash Sarkar,et al. A brief history of cellular automata , 2000, CSUR.

[6] Information Security and Privacy , 1996, Lecture Notes in Computer Science.

[7] Iwao Sasase,et al. A Secret Key Cryptosystem by Iterating a Chaotic Map , 1991, EUROCRYPT.

[8] Marco Tomassini,et al. On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata , 2000, IEEE Trans. Computers.

[9] Parimal Pal Chaudhuri,et al. Cellular Automata Based Cryptosystem (CAC) , 2002, ICICS.

[10] Puhua Guan,et al. Cellular Automaton Public-Key Cryptosystem , 1987, Complex Syst..

[11] Xin Yao,et al. Parallel Problem Solving from Nature PPSN VI , 2000, Lecture Notes in Computer Science.

[12] Marco Tomassini,et al. Stream Cyphers with One- and Two-Dimensional Cellular Automata , 2000, PPSN.