D. Augot and P. Camion, On the computation of minimal polynomials, cyclic vectors, and frobenius forms, Linear Algebra and its Applications, vol.260, pp.61-94, 1997.
DOI : 10.1016/S0024-3795(97)80005-5
URL : https://hal.archives-ouvertes.fr/inria-00541318

M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of Pseudorandom Bits, SIAM Journal on Computing, vol.13, issue.4, pp.850-864, 1984.
DOI : 10.1137/0213053

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., One-dimensional 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 onedimensional 90/150 linear hybrid group CA, IEEE Transactions, vol.26, issue.9, pp.1720-1724, 2007.

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

D. E. Knuth, Seminumerical Algorithms, 1969.
DOI : 10.1145/1088322.1088323

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

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

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

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

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.1044

S. Wolfram, Cryptography with CA, CRYPTO 85, 1985.

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, Theory and applications of cellular automata, World Scientific, 1986.

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

A. C. Yao, Computational Information Theory, Complexity in information theory, pp.1-15, 1988.
DOI : 10.1007/978-1-4612-3774-7_1

Y. Zheng and X. Zhang, Plateaued Functions, IEEE Trans. Inform. Theory, IT, vol.47, pp.1215-1223, 2001.
DOI : 10.1007/978-3-540-47942-0_24