P. Chaudhuri, D. R. Chowdhury, S. Nandi, and S. Chattopadhyay, Additive cellular automata theory and its application i, ieee computer society press, california, 2000.

J. Cheeger, A lower bound for the smallest eigenvalue of the laplacian. in problems in analysis(papers dedicated to solomon bochner, pp.195-199, 1969.

S. J. Cho, U. S. Choi, H. D. Kim, and Y. H. Hwang, Analysis of complemented CA derived from linear hybrid group CA, Computers & Mathematics with Applications, vol.53, issue.1, pp.54-63, 2007.
DOI : 10.1016/j.camwa.2006.04.027

S. J. Cho, U. S. Choi, H. D. Kim, Y. H. Hwang, J. G. Kim et al., New synthesis of onedimensional 90/150 linear hybrid group cellular automata, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.26, pp.1720-1724, 2007.

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

D. Peleg and E. Upfal, Constructing disjoint paths on expander graphs, Combinatorica, pp.289-313, 1989.

O. Goldreich, Candidate One-Way Functions Based on Expander Graphs, pp.1-9, 2000.
DOI : 10.1007/BF02126799

S. Hoory, N. Lindal, and A. Wigderson, Expander graphs and their applications, Bulletin of the American Mathematical Society, vol.43, issue.04, 2006.
DOI : 10.1090/S0273-0979-06-01126-8

D. Mukhopadhyay and D. R. Chowdhury, Generation of Expander Graphs Using Cellular Automata and Its Applications to Cryptography, LNCS, vol.4173, pp.636-645, 2006.
DOI : 10.1007/11861201_74

M. S. Pinsker, On the complexity of a concentrator, 7th International Telegraffic Conference, pp.1-4, 1973.

M. Sipser and D. Spielman, Expander codes, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1710-1722, 1996.
DOI : 10.1109/18.556667

S. Wolfram, Statistical mechanics of cellular automata, Reviews of Modern Physics, vol.55, issue.3, pp.601-644, 1983.
DOI : 10.1103/RevModPhys.55.601