S. [. Blum and . Micali, How to generate cryptographically strong sequences of pseudo random bits, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.850-864, 1984.
DOI : 10.1109/SFCS.1982.72

]. R. Cra98 and . Crandall, Comcryption, RSA Data Security Conference, 1998.

]. I. Dam89 and . Damgård, A design principle for hash functions, Crypto'89, number 435 in Lecture Notes in Computer Science, pp.416-427, 1989.

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'91, 1991.
DOI : 10.1007/3-540-57332-1_7

K. [. Elliott and . Rao, Fast transforms, algorithms, analysis, applications. Academic press, 1982.

]. H. Gut93 and . Gutowitz, Cryptography with dynamical systems, Cellular Automata and Cooperative Phenomena, 1993.

T. Habutsu, Y. Nishio, I. Sasase, and S. Mori, A Secret Key Cryptosystem by Iterating a Chaotic Map, EUROCRYPT, pp.127-140, 1991.
DOI : 10.1007/3-540-46416-6_11

]. V. Kli05 and . Klima, Finding MD5 collisions -a toy for a notebook, 2005.

]. D. Knu69 and . Knuth, Seminumerical Algorithms, 1969.

]. A. Kol65 and . Kolmogorov, Three approaches to the quantitative definition of information, Problemy Pederachi Informatsii, vol.1, pp.3-11, 1965.

P. [. Li and . Vitányi, An introduction to Kolmogorov complexity and its applications. Texts and monographs in computer science, 1993.

]. B. Mar04 and . Martin, Codage, cryptologie et applications, Presses Polytechniques et Universitaires Romandes, 2004.

]. B. Mar06 and . Martin, A Walsh exploration of Wolfram CA rules, International Workshop on Cellular Automata, pp.25-30, 2006.

O. [. Meier and . Staffelbach, Analysis of pseudo random sequences generated by cellular automata Lecture Notes in Computer Science, EUROCRYPT '91MT99] J. Mazoyer and V. Terrier. Signals in one-dimensional cellular automata, pp.53-80, 1991.

Y. [. Mihaljevic, H. Zheng, and . Imai, A cellular automaton based fast one-way hash function suitable for hardware implementation, Public Key Cryptography, pp.217-234, 1998.
DOI : 10.1007/BFb0054027

B. [. Nandi, P. P. Kar, and . Chaudhuri, Theory and applications of cellular automata in cryptography, IEEE Transactions on Computers, vol.43, issue.12, pp.431346-1357, 1994.
DOI : 10.1109/12.338094

N. [. Porter and . Bergmann, Evolving FPGA Based Cellular Automata, Lecture Notes in Computer Science, vol.1585, pp.114-121, 1998.
DOI : 10.1007/3-540-48873-1_16

]. E. Res01 and . Rescorla, SSL and TLS: Designing and Building Secure Systems, 2001.

]. D. Sal98 and . Salomon, Data compression, the complete reference, 1998.

P. [. Seredynski, A. Y. Bouvry, and . 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. [. Sipper and . 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

]. W. Sta06 and . Stallings, Cryptography and Network Security [Tec97] National Institute Of Standards Technology. FIPS publication 140-2, Security requirements for cryptographic modules, 1997.

]. S. Wol85 and . Wolfram, Cryptography with cellular automata, CRYPTO 85, 1985.

]. S. Wol86a and . Wolfram, Random sequence generation by cellular automata, Advances in applied mathematics, vol.7, pp.123-169, 1986.

H. Wang and . Yu, Theory and applications of cellular automata How to break MD5 and other hash functions, EUROCRYPT, pp.19-35, 1986.

[. 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. Yao82 and . Yao, Computational information theory, Proceedings of the IEEE, 1982.

[. Yuen, Testing random number generators by Walsh transform, IEEE Trans. Computers, vol.26, issue.4, pp.329-333, 1977.