A. M. Apohan and C. K. Koc, Inversion of cellular automata iterations, Computer and Digital Techniques, pp.279-284, 1997.

F. Bao, Cryptanalysis of a New Cellular Automata Cryptosystem, ACISP, pp.416-427, 2003.
DOI : 10.1007/3-540-45067-X_36

S. R. Blackburn, S. Murphy, and K. G. Paterson, Comments on "Theory and applications of cellular automata in cryptography" [with reply], IEEETC: IEEE Transactions on Computers, 1997.
DOI : 10.1109/12.589245

C. Carlet, P. Charpin, and V. Zinoviev, Codes, bent functions and permutations suitable for DES-like cryptosystems. Designs Codes and Cryptography, pp.125-156, 1998.

K. Cattell and J. Muzio, Synthesis of one-dimensional linear hybrid cellular automata, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.15, issue.3, pp.325-335, 1996.
DOI : 10.1109/43.489103

K. Cattell and J. Muzio, An explicit similarity transform between CA and LFSR matrices. Finite fields and their applications, pp.239-251, 1998.

K. Cattell, . Zhang, . Sun, J. Serra, D. Muzio et al., Onedimensional LHCA: their synthesis, properties and applications in VLSI testing, 1998.

S. J. Cho, U. Choi, H. Kim, Y. Hwang, J. Kim et al., New synthesis of one-dimensional 90/150 linear hybrid group CA, IEEE Transactions on computer-aided design of integrated circuits and systems, vol.26, issue.9, pp.1720-1724, 2007.

J. Daemen, R. Govaerts, and J. Vandewalle, A framework for the design of one-way hash functions including cryptanalysis of Damg??rd's one-way function based on a cellular automaton, ASIACRYPT: Advances in Cryptology. LNCS, 1991.
DOI : 10.1007/3-540-57332-1_7

I. B. Damgard, A Design Principle for Hash Functions, Advances in cryptology CRYPTO 89, pp.416-427, 1990.
DOI : 10.1007/0-387-34805-0_39

P. Joshi, D. Mukhopadhyay, and . Roychowdhury, Design and Analysis of a Robust and Efficient Block Cipher using Cellular Automata, 20th International Conference on Advanced Information Networking and Applications, Volume 1 (AINA'06), pp.67-71, 2006.
DOI : 10.1109/AINA.2006.138

D. Kagaris, A similarity transform for linear finite state machines, Discrete Applied Mathematics, vol.154, issue.11, pp.1570-1577, 2006.
DOI : 10.1016/j.dam.2006.01.007

B. Kar, S. Nandi, and P. Palchaudhury, Theory and applications of cellular automata in cryptography, IEEE Transactions on Computer, vol.43, issue.12, pp.1346-1357, 1994.

F. J. Macwilliams and N. J. Sloane, The theory of error correcting codes, 1977.

B. Martin, A Walsh exploration of elementary CA rules, Journal of Cellular Automata, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00305489

W. Meier and O. Staffelbach, Nonlinearity Criteria for Cryptographic Functions, EUROCRYPT '89, pp.549-562, 1990.
DOI : 10.1007/3-540-46885-4_53

W. Meier and O. Staffelbach, Analysis of Pseudo Random Sequences Generated by Cellular Automata, EUROCRYPT '91, 1991.
DOI : 10.1007/3-540-46416-6_17

M. J. Mihaljevic, An improved key stream generator based on the programmable cellular automata, ICICS '97: Proceedings of the First International Conference on Information and Communication Security, pp.181-191, 1997.
DOI : 10.1007/BFb0028474

M. J. Mihaljevic, Y. Zheng, and H. Imai, A cellular automaton based fast one-way hash function suitable for hardware implementation, Lecture Notes in Computer Science, vol.1431, p.217, 1998.
DOI : 10.1007/BFb0054027

M. J. Mihaljevic, Y. Zheng, and H. Imai, A fast and secure stream cipher based on cellular automata over GF(q), IEEE GLOBECOM 1998 (Cat. NO. 98CH36250), pp.3250-3255, 1998.
DOI : 10.1109/GLOCOM.1998.775806

D. Mukhopadhyay and D. Roychowdhury, Cellular Automata: An Ideal Candidate for a Block Cipher, First International Conference on Distribued Computing and Internet Technology, 2004.
DOI : 10.1007/978-3-540-30555-2_52

P. Sarkar and S. Maitra, Nonlinearity Bounds and Constructions of Resilient Boolean Functions, CRYPTO '00, pp.515-532, 2000.
DOI : 10.1007/3-540-44598-6_32

S. Sen, C. Shaw, N. Roychowdhury, P. Ganguly, and . Palchaudhuri, Cellular Automata Based Cryptosystem (CAC), ICICS, pp.303-314, 2002.
DOI : 10.1007/3-540-36159-6_26

F. Seredynski, P. Bouvry, and A. Y. Zomaya, Cellular automata computations and secret key cryptography, Parallel Computing, vol.30, issue.5-6, pp.5-6753, 2004.
DOI : 10.1016/j.parco.2003.12.014

M. Serra, T. Slater, J. C. Muzio, and D. M. Miller, The analysis of one-dimensional linear cellular automata and their aliasing properties, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.9, issue.7, pp.767-778, 1990.
DOI : 10.1109/43.55213

T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.), IEEE Transactions on Information Theory, vol.30, issue.5, p.776, 1984.
DOI : 10.1109/TIT.1984.1056949

M. Sipper and M. Tomassini, Co-evolving parallel random number generators, Parallel Problem Solving from Nature ? PPSN IV, pp.950-959, 1996.
DOI : 10.1007/3-540-61723-X_1058

V. Yuriy and . Tarannikov, On resilient Boolean functions with maximal possible nonlinearity, pp.19-30, 1997.

S. Wolfram, Cryptography with Cellular Automata, CRYPTO 85, 1985.
DOI : 10.1007/3-540-39799-X_32

S. Wolfram, Random sequence generation by cellular automata, Advances in Applied Mathematics, vol.7, issue.2, pp.123-169, 1986.
DOI : 10.1016/0196-8858(86)90028-X

S. Wolfram, A New Kind of Science, Applied Mechanics Reviews, vol.56, issue.2, 2002.
DOI : 10.1115/1.1553433

G. Xiao and J. L. Massey, A spectral characterization of correlation-immune combining functions, IEEE Transactions on Information Theory, vol.34, issue.3, p.569, 1988.
DOI : 10.1109/18.6037