A. Adamatzky, Mathematical basis of cellular automata, introduction to, Encyclopedia of Complexity and Systems Science, pp.5438-5440, 2009.
DOI : 10.1007/978-1-4614-1800-9_117

H. E. Aguirre, H. Okazaki, and Y. Fuwa, An evolutionary multiobjective approach to design highly non-linear Boolean functions, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.749-756, 2007.
DOI : 10.1145/1276958.1277112

URL : http://www.cs.bham.ac.uk/~wbl/biblio/gecco2007/docs/p749.pdf

S. Amoroso and Y. N. Patt, Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures, Journal of Computer and System Sciences, vol.6, issue.5, pp.448-464, 1972.
DOI : 10.1016/S0022-0000(72)80013-8

URL : https://doi.org/10.1016/s0022-0000(72)80013-8

D. Ashlock, Finding Designs with Genetic Algorithms, Computational and Constructive Design Theory, pp.49-65, 1996.
DOI : 10.1007/978-1-4757-2497-4_4

G. V. Assche, Quantum cryptography and secret-key distillation, 2006.

H. Balzter, P. W. Braun, and W. Köhler, Cellular automata models for vegetation dynamics, Ecological Modelling, vol.107, issue.2-3, pp.113-125, 1998.
DOI : 10.1016/S0304-3800(97)00202-0

URL : https://lra.le.ac.uk/bitstream/2381/4681/1/ECOL_MOD2print.pdf

S. Bandini, F. Rubagotti, G. Vizzari, and K. Shimura, A Cellular Automata Based Model for Pedestrian and Group Dynamics: Motivations and First Experiments, Parallel Computing Technologies -11th International Conference, pp.125-139, 2011.
DOI : 10.1007/BF01217347

D. Belazzougui, T. Gagie, V. Mäkinen, and M. Previtali, Fully Dynamic de Bruijn Graphs, String Processing and Information Retrieval -23rd International Symposium, SPIRE 2016, pp.145-152, 2016.
DOI : 10.1101/gr.074492.107

URL : http://arxiv.org/pdf/1607.04909

D. Belazzougui, T. Gagie, V. Mäkinen, M. Previtali, and S. J. ,

. Puglisi, Bidirectional variable-order de Bruijn graphs, LATIN 2016: Theoretical Informatics -12th Latin American Symposium, pp.164-178, 2016.

A. T. Benjamin and C. D. Bennett, The Probability of Relatively Prime Polynomials, Mathematics Magazine, vol.90, issue.2, pp.196-202, 2007.
DOI : 10.1006/jcta.1999.3028

, Bibliography

A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, MAA, vol.27, 2003.
DOI : 10.5948/9781614442080

E. R. Berlekamp, Factoring Polynomials Over Finite Fields, Bell System Technical Journal, vol.46, issue.8, pp.1853-1859, 1967.
DOI : 10.1002/j.1538-7305.1967.tb03174.x

E. R. Berlekamp and L. R. Welch, Weight distributions of the cosets of the (32,6) Reed-Muller code, IEEE Transactions on Information Theory, vol.18, issue.1, pp.203-207, 1972.
DOI : 10.1109/TIT.1972.1054732

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, Radiogatún , a belt-and-mill hash function, IACR Cryptology ePrint Archive, vol.2006, p.369, 2006.

G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, The Keccak reference, pp.127-151, 2011.

E. Biham and A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, vol.36, issue.4, pp.3-72, 1991.
DOI : 10.1007/BF00630563

G. R. Blakley, Safeguarding cryptographic keys, Proceedings of the national computer conference, pp.313-317, 1979.

C. Böhm and G. Jacopini, Flow diagrams, turing machines and languages with only two formation rules, Communications of the ACM, vol.9, issue.5, pp.366-371, 1966.
DOI : 10.1145/355592.365646

R. C. Bose and S. S. Shrikhande, On the construction of sets of mutually orthogonal Latin squares and the falsity of a conjecture of Euler, Transactions of the American Mathematical Society, vol.95, issue.2, pp.191-209, 1960.
DOI : 10.1090/S0002-9947-1960-0111695-3

M. Boyle and B. Kitchens, Periodic points for onto cellular automata, Indagationes Mathematicae, vol.10, issue.4, pp.483-493, 1999.
DOI : 10.1016/S0019-3577(00)87901-X

URL : https://doi.org/10.1016/s0019-3577(00)87901-x

M. Boyle and B. Lee, Jointly Periodic Points in Cellular Automata: Computer Explorations and Conjectures, Experimental Mathematics, vol.16, issue.3, pp.293-302, 2007.
DOI : 10.1080/10586458.2007.10129005

URL : http://arxiv.org/pdf/math/0607178

D. Bozilov, B. Bilgin, and H. A. Sahin, A note on 5-bit quadratic permutations' classification, IACR Trans. Symmetric Cryptol, vol.2017, issue.1, pp.398-404

K. Browning, J. Dillon, M. Mcquistan, and A. Wolfe, An APN permutation in dimension six Finite Fields: theory and applications, pp.33-42, 2010.

N. G. De-bruijn, Acknowledgement of priority to C. Flye Sainte- Marie on the counting of circular arrangements of 2n zeros and ones that show each n-letter word exactly once, 1975.

L. Budaghyan, C. Carlet, T. Helleseth, N. Li, and B. Sun, On Upper Bounds for Algebraic Degrees of APN Functions, IEEE Transactions on Information Theory, vol.64, issue.6, 2017.
DOI : 10.1109/TIT.2017.2757938

L. Burnett, G. Carter, E. Dawson, and W. Millan, Efficient Methods for Generating MARS-Like S-Boxes, Fast Software Encryption, 7th International Workshop, pp.300-314, 2000.
DOI : 10.1007/3-540-44706-7_21

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-44706-7_21.pdf

L. Burnett, W. Millan, E. Dawson, and A. J. Clark, Simpler methods for generating better boolean functions with good cryptographic properties, Australasian J. Combinatorics, vol.29, pp.231-248, 2004.

C. Burwick, D. Coppersmith, E. D-'avignon, R. Gennaro, S. Halevi et al., MARS-a candidate cipher for AES, NIST AES Proposal, vol.268, 1998.

P. J. Cameron, Notes on Counting: An Introduction to Enumerative Combinatorics, 2017.
DOI : 10.1017/9781108277457

URL : http://www.maths.qmw.ac.uk/~pjc/MTH710U/counting.pdf

C. Carlet, Boolean functions for cryptography and error correcting codes Boolean models and methods in mathematics, computer science, and engineering, pp.257-397, 2010.
DOI : 10.1017/cbo9780511780448.011

URL : http://www-rocq.inria.fr/codes/Claude.Carlet/chap-fcts-Bool.pdf

, Vectorial boolean functions for cryptography Boolean models and methods in mathematics, computer science, and engineering, pp.398-469, 2010.

C. Carlet, P. Charpin, and V. A. Zinoviev, Codes, bent functions and permutations suitable for des-like cryptosystems, Designs, Codes and Cryptography, vol.15, issue.2, pp.125-156, 1998.
DOI : 10.1023/A:1008344232130

G. Cattaneo, A. Dennunzio, and L. Margara, Solution of some conjectures about topological properties of linear cellular automata, Theoretical Computer Science, vol.325, issue.2, pp.249-271, 2004.
DOI : 10.1016/j.tcs.2004.06.008

J. Cervelle, A. Dennunzio, and E. Formenti, Chaotic behavior of cellular automata, Encyclopedia of Complexity and Systems Science, pp.978-989, 2009.
DOI : 10.1007/978-0-387-30440-3_65

URL : https://hal.archives-ouvertes.fr/hal-00620822

F. Chabaud and S. Vaudenay, Links between differential and linear cryptanalysis, Advances in Cryptology -EUROCRYPT '94, Workshop on the Theory and Application of Cryptographic Techniques, pp.356-365, 1994.
DOI : 10.1007/BFb0053450

URL : https://link.springer.com/content/pdf/10.1007%2FBFb0053450.pdf

, Bibliography

P. Charpin and E. Pasalic, On Propagation Characteristics of Resilient Functions, Selected Areas in Cryptography, 9th Annual International Workshop, pp.175-195, 2002.
DOI : 10.1007/3-540-36492-7_13

URL : https://hal.archives-ouvertes.fr/inria-00072051

G. Chassé, Some remarks on a LFSR ???disturbed??? by other sequences, EUROCODE '90, International Symposium on Coding Theory and Applications, pp.215-221, 1990.
DOI : 10.1007/3-540-54303-1_133

D. Chaum, C. Crépeau, and I. Damgård, Multiparty unconditionally secure protocols (extended abstract), Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.11-19, 1988.
DOI : 10.1007/3-540-48184-2_43

URL : https://link.springer.com/content/pdf/10.1007%2F3-540-48184-2_43.pdf

V. V. Chepyzhov and B. J. Smeets, On A Fast Correlation Attack on Certain Stream Ciphers, Advances in Cryptology -EU- ROCRYPT '91, Workshop on the Theory and Application of Cryptographic Techniques, pp.176-185, 1991.
DOI : 10.1007/3-540-46416-6_16

B. Chopard, Cellular automata modeling of physical systems, Encyclopedia of Complexity and Systems Science, pp.865-892, 2009.
DOI : 10.1017/cbo9780511549755

B. Chor, O. Goldreich, J. Håstad, J. Friedman, S. Rudich et al., The bit extraction problem of t-resilient functions (preliminary version), 26th Annual Symposium on Foundations of Computer Science, pp.21-23, 1985.
DOI : 10.1109/sfcs.1985.55

URL : http://www.wisdom.weizmann.ac.il/~oded/PS/six.ps

J. A. Clark, J. L. Jacob, S. Maitra, and P. Stanica, Almost Boolean Functions: The Design of Boolean Functions by Spectral Inversion, Computational Intelligence, vol.2012, issue.5, pp.450-462, 0201.
DOI : 10.1109/18.6037

URL : http://www.cs.york.ac.uk/%7Ejac/PublishedPapers/ABFsSpectralInversionCompInt2004.pdf

J. A. Clark, J. L. Jacob, S. Stepney, S. Maitra, and W. Millan, Evolving Boolean Functions Satisfying Multiple Criteria, Progress in Cryptology -INDOCRYPT 2002, Third International Conference on Cryptology in India, pp.246-259, 2002.
DOI : 10.1007/3-540-36231-2_20

URL : http://www.cs.york.ac.uk/~jac/PublishedPapers/EvolvingBFsMultipleCriteriaINDOCRYPT2002.pdf

J. A. Clark and J. Jacob, Two-Stage Optimisation in the Design of Boolean Functions, Information Security and Privacy, 5th Australasian Conference, pp.242-254, 2000.
DOI : 10.1007/10718964_20

URL : http://www-users.cs.york.ac.uk/~jac/papers/OzBoolFs.pdf

A. Clarridge and K. Salomaa, A Cryptosystem Based on the Composition of Reversible Cellular Automata, Language and Automata Theory and Applications, Third International Conference, p.215
DOI : 10.1017/S0143385700005538

URL : http://ftp.qucis.queensu.ca/TechReports/Reports/2008-549.pdf

C. J. Colbourn and J. H. Dinitz, Combinatorial Designs, Handbook of Discrete and Combinatorial Mathematics, pp.26-28, 1999.
DOI : 10.1201/9781439832905.ch12

Y. Crama and P. L. Hammer, Boolean models and methods in mathematics, computer science, and engineering, 2010.

T. W. Cusick and P. Stanica, Cryptographic Boolean functions and applications, p.2017

E. Czeizler and J. Kari, A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, pp.410-420, 2005.
DOI : 10.1007/11523468_34

J. Daemen and C. S. Clapp, Fast Hashing and Stream Encryption with Panama, Fast Software Encryption, 5th International Workshop, FSE '98, pp.60-74, 1998.
DOI : 10.1007/3-540-69710-1_5

URL : http://standard.pictel.com/ftp/research/security/panama.pdf

J. Daemen, R. Govaerts, and J. Vandewalle, An efficient nonlinear shift-invariant transformation, Proceedings of the 15th Symposium on Information Theory in the Benelux, B. Macq Werkgemeenschap voor Informatie -En Communicatietheorie, pp.108-115, 1994.

J. Daemen, R. Govaerts, and J. Vandewalle, Invertible shift-invariant transformations on binary arrays, Applied Mathematics and Computation, vol.62, issue.2-3, pp.259-277, 1994.
DOI : 10.1016/0096-3003(94)90087-6

J. Daemen and V. Rijmen, The Design of Rijndael, 2002.
DOI : 10.1007/978-3-662-04722-4

J. Deißler, A resultant for Hensel's lemma, " arXiv preprint arXiv:1301, 2013.

A. Dennunzio, P. D. Lena, E. Formenti, and L. Margara, Periodic orbits and dynamical complexity in cellular automata, Fundam. Inform, vol.126, issue.2-3, pp.183-199
URL : https://hal.archives-ouvertes.fr/hal-01312658

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

URL : http://www.cs.rutgers.edu/~tdnguyen/classes/cs671/presentations/Arvind-NEWDIRS.pdf

B. Durand, Global Properties of Cellular Automata, Cellular Automata and Complex Systems, pp.1-22, 1999.
DOI : 10.1007/978-94-015-9223-9_1

, Bibliography

M. Ebner, On the search space of genetic programming and its relation to nature's search space, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), pp.1357-1361, 1999.
DOI : 10.1109/CEC.1999.782609

K. Eloranta, Partially permutive cellular automata, Nonlinearity, vol.6, issue.6, pp.1009-1023, 1993.
DOI : 10.1088/0951-7715/6/6/010

Z. Eslami, S. H. Razzaghi, and J. Zarepour-ahmadabadi, Secret image sharing based on cellular automata and steganography, Pattern Recognition, vol.43, issue.1, pp.397-404, 2010.
DOI : 10.1016/j.patcog.2009.06.007

Z. Eslami and J. Zarepour-ahmadabadi, A verifiable multi-secret sharing scheme based on cellular automata, Information Sciences, vol.180, issue.15, pp.2889-2894, 2010.
DOI : 10.1016/j.ins.2010.04.015

L. Euler, Recherches sur une nouvelle espece de quarres magiques, Zeeuwsch Genootschao, vol.26, issue.28, p.1782

E. Formenti, K. Imai, B. Martin, and J. Yunès, Advances on random sequence generation by uniform cellular automata, " in Computing with New Resources -Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday, pp.56-70, 2014.

E. Formenti, C. Papazian, and P. Scribot, Additive flowers, CIBB 2014, 2014.

J. Fuller, W. Millan, and E. Dawson, Multi-objective optimisation of bijective s-boxes, Proceedings of the IEEE Congress on Evolutionary Computation, pp.1525-1532, 2004.
DOI : 10.1109/cec.2004.1331077

M. Gardner, Mathematical Games, Scientific American, vol.223, issue.4, pp.120-123, 1970.
DOI : 10.1038/scientificamerican1070-120

W. Gardner, Introduction to Einstein's contribution to time-series analysis, IEEE ASSP Magazine, vol.4, issue.4, pp.4-5, 1987.
DOI : 10.1109/MASSP.1987.1165601

C. F. Gauß, , p.174

I. M. Gelfand, M. Kapranov, and A. Zelevinsky, Discriminants, resultants, and multidimensional determinants, 2008.
DOI : 10.1007/978-0-8176-4771-1

D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, 1989.

D. E. Goldberg and R. Lingle, Alleles, loci, and the traveling salesman problem, Proceedings of an international conference on genetic algorithms and their applications, pp.154-159, 1985.

O. Goldreich, The Foundations of Cryptography -Volume 1, Basic Techniques, 2001.

, The Foundations of Cryptography Basic Applications, ??, vol.2, 2004.

H. Gutowitz, Cryptography with Dynamical Systems, Cellular Automata and Cooperative Systems, pp.237-274, 1993.
DOI : 10.1007/978-94-011-1691-6_21

R. W. Hamming, Coding and information theory, p.146, 1986.

G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system, Mathematical Systems Theory, vol.18, issue.4, pp.320-375, 1969.
DOI : 10.1090/coll/036

M. Hell, T. Johansson, A. Maximov, and W. Meier, The grain family of stream ciphers, " in New Stream Cipher Designs -The eSTREAM Finalists, pp.179-190, 2008.

J. J. Hoch and A. Shamir, Fault Analysis of Stream Ciphers, Cryptographic Hardware and Embedded Systems -CHES 2004: 6th International Workshop, pp.240-253, 2004.
DOI : 10.1007/978-3-540-28632-5_18

URL : http://www.wisdom.weizmann.ac.il/~yaakovh/papers/fault_paper.pdf

J. H. Holland, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence, 1975.

X. Hou and G. L. Mullen, Number of irreducible polynomials and pairs of relatively prime polynomials in several variables over finite fields, Finite Fields and Their Applications, pp.304-331, 2009.
DOI : 10.1016/j.ffa.2008.12.004

R. Hrbacek and V. Dvorak, Bent Function Synthesis by Means of Cartesian Genetic Programming, Parallel Problem Solving from Nature -PPSN XIII -13th International Conference, pp.414-423, 2014.
DOI : 10.1007/978-3-319-10762-2_41

X. Hu, R. C. Eberhart, and Y. Shi, Swarm intelligence for permutation optimization: a case study of n-queens problem, IEEE Swarm Intelligence Symposium, pp.243-246, 2003.

A. Ilachinski, Cellular automata: a discrete universe, 2001.
DOI : 10.1142/4702

, Sequence a002450, accessed 29 september 2016, of Integer Sequences (OEIS)

?. ,

?. , , 2016.

J. Kari, Theory of cellular automata: A survey, Theoretical Computer Science, vol.334, issue.1-3, pp.3-33, 2005.
DOI : 10.1016/j.tcs.2004.11.021

, Basic concepts of cellular automata, Handbook of Natural Computing, pp.3-24, 2012.

J. Katz and Y. Lindell, Introduction to Modern Cryptography, Second Edition, p.2014

S. Kavut, Results on rotation-symmetric S-boxes, Information Sciences, vol.201, pp.93-113
DOI : 10.1016/j.ins.2012.02.030

S. Kavut, S. Maitra, and M. D. , Search for Boolean Functions With Excellent Profiles in the Rotation Symmetric Class, IEEE Transactions on Information Theory, vol.53, issue.5, pp.1743-1751, 2007.
DOI : 10.1109/TIT.2007.894696

A. D. Keedwell and J. Dénes, Latin squares and their applications, p.207, 2015.

J. Kennedy and R. Eberhart, Particle swarm optimization, Proceedings of ICNN'95, International Conference on Neural Networks, 1995.
DOI : 10.1109/ICNN.1995.488968

J. Kennedy, R. C. Systems, and C. Man, A discrete binary version of the particle swarm algorithm, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation, pp.4104-4108, 1997.
DOI : 10.1109/ICSMC.1997.637339

A. Kerckhoff, La cryptographie militaire, Journal des sciences militaires, vol.38, issue.5, 1883.

, La cryptographie militaire, Journal des sciences militaires, vol.IX, pp.161-191

S. Kirkpatrick, C. D. Jr, and M. P. Vecchi, Optimization by simulated annealing, " in Spin Glass Theory and Beyond: An Introduction to the Replica Method and Its Applications, World Scientific, pp.339-348, 1987.

L. R. Knudsen, Truncated and higher order differentials, " in Fast Software Encryption: Second International Workshop, Proceedings, pp.14-16, 1994.
DOI : 10.1007/3-540-60590-8_16

D. Knuth, The art of computer programming, 2011.

C. Koc and A. Apohan, Inversion of cellular automata iterations, IEE Proceedings-Computers and Digital Techniques, pp.279-284, 1997.
DOI : 10.1049/ip-cdt:19971518

J. R. Koza, Genetic programming as a means for programming computers by natural selection, Statistics and Computing, vol.4, issue.2, 1992.
DOI : 10.1007/BF00175355

URL : http://www.genetic-programming.com/jkpdf/scjournalshort.pdf

P. Kurka, Topological dynamics of cellular automata, Complexity and Systems Science, vol.202, pp.9246-9268, 2009.

J. C. Lagarias, The ultimate challenge: The 3x+ 1 problem, American Mathematical Soc, 2010.
DOI : 10.1090/mbk/078

G. Leander and A. Poschmann, On the Classification of 4 Bit S-Boxes, Lecture Notes in Computer Science, vol.4547, issue.140, pp.159-176, 2007.
DOI : 10.1007/978-3-540-73074-3_13

A. Leporati and L. Mariot, 1-Resiliency of bipermutive cellular automata rules, " in Cellular Automata and Discrete Complex Systems -19th International Workshop, pp.110-123, 2013.
DOI : 10.1007/978-3-642-40867-0_8

, Cryptographic properties of bipermutive cellular automata rules, J. Cellular Automata, vol.9, pp.5-6

R. Lidl and H. Niederreiter, Introduction to finite fields and their applications, pp.23-25, 1994.
DOI : 10.1017/CBO9781139172769

J. Liu, S. Mesnager, and L. Chen, On the Diffusion Property of Iterated Functions, Cryptography and Coding -15th IMA International Conference, IMACC 2015, pp.239-253, 2015.
DOI : 10.1002/j.1538-7305.1949.tb00928.x

O. A. Logachev, A. A. Sal_nikov, and V. I_a_shchenko, Boolean functions in coding theory and cryptography, American Mathematical Soc, vol.241, 2012.
DOI : 10.1090/mmono/241

L. Manzoni, Asynchronous cellular automata and dynamical properties, Natural Computing, vol.51, issue.8, pp.269-276
DOI : 10.1016/S0303-2647(99)00025-8

G. Á. Marañón, L. H. Encinas, and Á. M. Rey, A multisecret sharing scheme for color images based on cellular automata, Inf. Sci, vol.178, issue.22, pp.4382-4395, 2008.

L. Mariot and A. Leporati, Sharing Secrets by Computing Preimages of Bipermutive Cellular Automata, Cellular Automata -11th International Conference on Cellular Automata for Research and Industry, ACRI 2014, pp.417-426, 2014.
DOI : 10.1007/978-3-319-11520-7_43

, A cryptographic and coding-theoretic perspective on the global rules of cellular automata, Natural Computing, pp.1572-9796, 2017.

B. Martin, A Walsh exploration of elementary CA rules, J. Cellular Automata, vol.3, issue.2, pp.145-156, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00305489

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

M. Matsui, Linear cryptanalysis method for DES cipher Workshop on the Theory and Application of Cryptographic Techniques, Advances in Cryptology -EUROCRYPT '93, pp.386-397, 1993.

R. Mceliece, The theory of information and coding, pp.146-205, 2002.

W. Meier and O. Staffelbach, Analysis of pseudo random sequence generated by cellular automata, " in Advances in Cryptology -EUROCRYPT '91, Workshop on the Theory and Application of Cryptographic Techniques, pp.186-199, 1991.

R. Mendes, J. Kennedy, and J. Neves, The Fully Informed Particle Swarm: Simpler, Maybe Better, IEEE Transactions on Evolutionary Computation, vol.8, issue.3, pp.204-210, 2004.
DOI : 10.1109/TEVC.2004.826074

Z. Michalewicz, Genetic algorithms + data structures = evolution programs, ser. Artificial intelligence, 1992.

W. Millan, L. Burnett, G. Carter, A. J. Clark, and E. Dawson, Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes, Information and Communication Security, Second International Conference, ICICS'99, pp.263-274, 1999.
DOI : 10.1007/978-3-540-47942-0_22

W. Millan, A. J. Clark, and E. Dawson, An effective genetic algorithm for finding highly nonlinear boolean functions, Information and Communication Security, First International Conference , ICICS'97, pp.149-158, 1997.
DOI : 10.1007/BFb0028471

, Heuristic design of cryptographically strong balanced boolean functions, Advances in Cryptology -EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques Proceeding, pp.489-499, 0200.

J. F. Miller and P. Thomson, Cartesian genetic programming, Genetic Programming, European Conference, pp.121-132, 2000.

C. Moore, Predicting nonlinear cellular automata quickly by decomposing them into linear ones, Physica D: Nonlinear Phenomena, vol.111, issue.1-4, pp.27-41, 1998.
DOI : 10.1016/S0167-2789(97)80003-6

C. Moore and A. A. Drisko, Algebraic properties of the block transformation on cellular automata, Complex Systems, vol.10, issue.3, pp.185-194, 1996.

A. Moraglio, K. Krawiec, and C. G. Johnson, Geometric Semantic Genetic Programming, Parallel Problem Solving from Nature -PPSN XII -12th International Conference, pp.21-31, 2012.
DOI : 10.1007/978-3-642-32937-1_3

K. Nyberg, Perfect nonlinear S-boxes, Advances in Cryptology -EUROCRYPT '91, pp.378-386, 1991.
DOI : 10.1007/3-540-46416-6_32

, S-boxes and round functions with controllable linearity and differential uniformity, " in Fast Software Encryption: Second International Workshop, Proceedings, pp.14-16, 1994.

K. Nyberg and L. R. Knudsen, Provable Security Against Differential Cryptanalysis, Advances in Cryptology -CRYPTO '92, 12th Annual International Cryptology Conference, pp.566-574, 1992.
DOI : 10.1007/3-540-48071-4_41

E. Pasalic and T. Johansson, Further Results on the Relation Between Nonlinearity and Resiliency for Boolean Functions, Cryptography and Coding, 7th IMA International Conference, pp.35-44, 1999.
DOI : 10.1007/3-540-46665-7_3

N. J. Patterson and D. H. Wiedemann, The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276, IEEE Transactions on Information Theory, vol.29, issue.3, pp.354-355, 1983.
DOI : 10.1109/TIT.1983.1056679

]. J. Pedersen, Cellular automata as algebraic systems, Complex Systems, vol.6, issue.3, pp.237-250, 1992.

M. E. Pedersen and A. J. Chipperfield, Simplifying Particle Swarm Optimization, Applied Soft Computing, vol.10, issue.2, pp.618-628, 2010.
DOI : 10.1016/j.asoc.2009.08.029

D. Perrin and J. Pin, Infinite words: automata, semigroups, logic and games, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00112831

C. P. Pfleeger and S. L. Pfleeger, , 2012.

S. Picek, Applications of evolutionary computation to cryptology Available: \url{http : / / www . win . tue.nl/ipa/?event=applications-of-evolutionary-computationto-cryptology} (cit, p.79, 2015.
DOI : 10.1145/3067695.3067725

S. Picek, C. Carlet, D. Jakobovic, J. F. Miller, and L. Batina, Correlation Immunity of Boolean Functions, Proceedings of the 2015 on Genetic and Evolutionary Computation Conference, GECCO '15, pp.1095-1102, 2015.
DOI : 10.1007/3-540-44495-5_3

S. Picek, M. Cupic, and L. Rotim, A New Cost Function for Evolution of S-Boxes, Evolutionary Computation, vol.19, issue.1, pp.695-718
DOI : 10.1007/978-3-540-24650-3_15

URL : http://www.mitpressjournals.org/userimages/ContentEditor/1164817256746/lib_rec_form.pdf

S. Picek, S. Guilley, C. Carlet, D. Jakobovic, and J. F. Miller, Evolutionary Approach for Finding Correlation Immune Boolean Functions of Order t with Minimal Hamming Weight, Theory and Practice of Natural Computing -Fourth International Conference, pp.71-82, 2015.
DOI : 10.1109/TIT.1984.1056949

S. Picek and D. Jakobovic, Evolving Algebraic Constructions for Designing Bent Boolean Functions, Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, GECCO '16, pp.781-788, 2016.
DOI : 10.1002/9780470496916

S. Picek, D. Jakobovic, and M. Golub, Evolving cryptographically sound boolean functions, " in Genetic and Evolutionary Computation Conference, GECCO '13, Amsterdam, The Netherlands, Companion Material Proceedings, pp.191-192, 2013.
DOI : 10.1145/2464576.2464671

S. Picek, D. Jakobovic, J. F. Miller, L. Batina, and M. Cupic, Cryptographic Boolean functions: One output, many design criteria, Applied Soft Computing, vol.40, pp.635-653
DOI : 10.1016/j.asoc.2015.10.066

S. Picek, E. Marchiori, L. Batina, and D. Jakobovic, Combining Evolutionary Computation and Algebraic Constructions to Find Cryptography-Relevant Boolean Functions, Parallel Problem Solving from Nature -PPSN XIII -13th International Conference, pp.822-831, 2014.
DOI : 10.1007/978-3-319-10762-2_81

S. Picek, L. Mariot, B. Yang, D. Jakobovic, and N. Mentens, Design of S-boxes Defined with Cellular Automata Rules, Proceedings of the Computing Frontiers Conference on ZZZ , CF'17, pp.409-414, 2017.
DOI : 10.1002/j.1538-7305.1949.tb00928.x

S. Picek, J. F. Miller, D. Jakobovic, and L. Batina, Cartesian Genetic Programming Approach for Generating Substitution Boxes of Different Sizes, Proceedings of the Companion Publication of the 2015 on Genetic and Evolutionary Computation Conference, GECCO Companion '15, pp.1457-1458, 2015.
DOI : 10.1007/978-3-662-04722-4

URL : http://repository.ubn.ru.nl/bitstream/2066/143686/1/143686.pdf

R. Poli, Analysis of the Publications on the Applications of Particle Swarm Optimisation, Journal of Artificial Evolution and Applications, vol.15, issue.4, 2008.
DOI : 10.1109/TPWRS.2005.846064

R. Poli, W. B. Langdon, and N. F. Mcphee, A field guide to genetic programming Published via http, With contributions by J. R. Koza), vol.137, 0193.

G. Pólya and G. Alexanderson, Gaussian binomial coefficients, Elemente der Mathematik, vol.26, pp.102-109, 1971.

B. Preneel, W. V. Leekwijck, L. V. Linden, R. Govaerts, and J. Vandewalle, Propagation Characteristics of Boolean Functions, Advances in Cryptology -EUROCRYPT '90, Workshop on the Theory and Application of Cryptographic Techniques, pp.161-173, 1990.
DOI : 10.1007/3-540-46877-3_14

URL : https://www.cosic.esat.kuleuven.be/publications/article-42.pdf

N. J. Radcliffe, Equivalence class analysis of genetic algorithms, Complex Systems, vol.5, issue.2, 1991.

A. Reifegerste, On an Involution Concerning Pairs of Polynomials over F2, Journal of Combinatorial Theory, Series A, vol.90, issue.1, pp.216-220, 2000.
DOI : 10.1006/jcta.1999.3028

URL : https://doi.org/10.1006/jcta.1999.3028

Á. M. Del-rey, J. P. Mateus, and G. R. Sánchez, A secret sharing scheme based on cellular automata, Applied Mathematics and Computation, vol.170, issue.2, pp.1356-1364, 2005.
DOI : 10.1016/j.amc.2005.01.026

D. Richardson, Tessellations with local transformations, Journal of Computer and System Sciences, vol.6, issue.5, pp.373-388, 1972.
DOI : 10.1016/S0022-0000(72)80009-6

URL : https://doi.org/10.1016/s0022-0000(72)80009-6

]. V. Rijmen, P. S. Barreto, and D. L. Filho, Rotation symmetry in algebraically generated cryptographic substitution tables, Information Processing Letters, vol.106, issue.6, pp.246-250, 2008.
DOI : 10.1016/j.ipl.2007.09.012

V. Rijmen and J. Daemen, Advanced encryption standard, Proceedings of Federal Information Processing Standards Publications , National Institute of Standards and Technology, pp.19-22, 2001.

R. Rivest and R. Cipher, , 1987.

R. A. Rueppel and O. Staffelbach, Products of linear recurring sequences with maximum complexity, IEEE Transactions on Information Theory, vol.33, issue.1, pp.124-131, 1987.
DOI : 10.1109/TIT.1987.1057268

Z. Saber, M. F. Uddin, and A. M. Youssef, On the existence of (9,3,5,240) resilient functions, IEEE Transactions on Information Theory, vol.52, issue.5, pp.2269-2270, 2006.
DOI : 10.1109/TIT.2006.872862

R. Safadi and R. Wang, The use of genetic algorithms in the construction of mixed multilevel orthogonal arrays, DTIC Document, Tech. Rep, 1992.

J. L. Schiff, Cellular automata: a discrete view of the world, 2011.
DOI : 10.1002/9781118032381

M. Seredynski and P. Bouvry, Block Encryption Using Reversible Cellular Automata, Cellular Automata, 6th International Conference on Cellular Automata for Research and Industry, pp.785-792, 2004.
DOI : 10.1007/978-3-540-30479-1_81

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

C. E. Shannon, Communication Theory of Secrecy Systems*, Bell System Technical Journal, vol.28, issue.4, pp.656-715, 1949.
DOI : 10.1002/j.1538-7305.1949.tb00928.x

URL : http://dml.cz/bitstream/handle/10338.dmlcz/119717/CommentatMathUnivCarolRetro_49-2008-2_5.pdf

Y. Shi and R. C. Eberhart, Parameter selection in particle swarm optimization, " in Evolutionary Programming VII, 7th International Conference, EP98, pp.591-600, 1998.

V. Shoup, Fast Construction of Irreducible Polynomials over Finite Fields, Journal of Symbolic Computation, vol.17, issue.5, pp.371-391, 1994.
DOI : 10.1006/jsco.1994.1025

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

, Decrypting a class of stream ciphers using ciphertext only, IEEE Trans. Computers, vol.34, issue.1, pp.81-85, 1985.

G. J. Simmons, A cartesian product construction for unconditionally secure authentication codes that permit arbitration, Journal of Cryptology, vol.2, issue.2, pp.77-104, 1990.
DOI : 10.1007/BF00204449

G. C. Sirakoulis, I. Karafyllidis, C. Mizas, V. A. Mardiris, A. Thanailakis et al., A cellular automaton model for the study of DNA sequence evolution, Computers in Biology and Medicine, vol.33, issue.5, pp.439-453, 2003.
DOI : 10.1016/S0010-4825(03)00017-9

D. E. Standard, Data encryption standard, 1999.

D. R. Stinson, Cryptography -theory and practice, pp.46-49, 1995.

, Combinatorial designs -constructions and analysis, ??, vol.27, issue.29, pp.31-46, 2004.

K. Sutner, De Bruijn graphs and linear cellular automata, Complex Systems, vol.5, issue.1, pp.19-30, 1991.

, Cellular automata, decidability and phasespace, Fundam . Inform, vol.104, issue.12, pp.141-160, 2010.

M. Szaban and F. Seredynski, Cryptographically strong sboxes based on cellular automata, Cellular Automata, 8th International Conference on Cellular Automata for Research and Industry, pp.478-485, 2008.
DOI : 10.1007/978-3-540-79992-4_62

Y. Tarannikov, On Resilient Boolean Functions with Maximal Possible Nonlinearity, Progress in Cryptology -INDOCRYPT 2000, First International Conference in Cryptology in India, pp.19-30, 2000.
DOI : 10.1007/3-540-44495-5_3

URL : http://eprint.iacr.org/2000/005.ps.gz

M. Tarry, Le Problème des 36 officiers...: Congrès de Paris Secrétariat de l'Association française pour l'avancement des sciences, 1900.

T. Tassa, Generalized oblivious transfer by secret sharing, Designs, Codes and Cryptography, vol.18, issue.1, pp.11-21, 2011.
DOI : 10.1007/s00145-004-0102-6

URL : http://www.openu.ac.il/Personal_sites/tamirtassa/Download/Journals/got.pdf

T. Toffoli and N. H. Margolus, Invertible cellular automata: A review, Physica D: Nonlinear Phenomena, vol.45, issue.1-3, pp.229-253, 1990.
DOI : 10.1016/0167-2789(90)90185-R

URL : http://www.eleves.ens.fr:8080/home/verhoeve/html/files/ca/invertible-ca_ps.ps.gz

M. Tompa and H. Woll, How to share a secret with cheaters, Journal of Cryptology, vol.22, issue.11, pp.133-138, 1988.
DOI : 10.1007/BF02252871

I. C. Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection, Information Processing Letters, vol.85, issue.6, pp.317-325, 2003.
DOI : 10.1016/S0020-0190(02)00447-7

URL : https://hal.archives-ouvertes.fr/hal-01313364

J. Tuliani, De Bruijn sequences with efficient decoding algorithms, Discrete Mathematics, vol.226, issue.1-3, pp.313-336, 2001.
DOI : 10.1016/S0012-365X(00)00117-5

URL : https://doi.org/10.1016/s0012-365x(00)00117-5

A. M. Turing, On computable numbers, with an application to the entscheidungsproblem, Proceedings of the London mathematical society, vol.2, issue.1, pp.230-265, 1937.

S. Ulam, Random processes and transformations, Proceedings of the International Congress on Mathematics, pp.264-275, 1952.

L. Vanneschi, M. Castelli, L. Manzoni, and S. Silva, A New Implementation of Geometric Semantic GP and Its Application to Problems in Pharmacokinetics, Genetic Programming - 16th European Conference, pp.205-216, 2013.
DOI : 10.1007/978-3-642-37207-0_18

G. Vernam, Secret signaling system, US Patent 1,310, 1919.

J. and V. Neumann, Theory of self-reproducing automata, 1966.

S. Wagstaff and C. Project, , 2002.

A. F. Webster and S. E. Tavares, On the design of s-boxes, " in Advances in Cryptology -CRYPTO '85, pp.523-534, 1985.

D. Whitley and A. M. Sutton, Genetic Algorithms ??? A Survey of Models and Methods, Handbook of Natural Computing, pp.637-671, 2012.
DOI : 10.1007/978-3-540-92910-9_21

D. A. Wolf-gladrow, Lattice-gas cellular automata and lattice Boltzmann models: an introduction, 2004.
DOI : 10.1007/b72010

S. Wolfram, Statistical mechanics of cellular automata, Reviews of Modern Physics, vol.47, issue.3, p.601, 1983.
DOI : 10.1103/PhysRevLett.47.1400

, Universality and complexity in cellular automata, Physica D: Nonlinear Phenomena, vol.10, issue.12, pp.1-35, 1984.

, Cryptography with cellular automata, Advances in Cryptology -CRYPTO '85, pp.429-432, 1985.

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

X. Yao, Optimization by genetic annealing, Proceedings of the Second Australian Conference on Neural Networks, pp.94-97, 1991.

D. R. Zerbino and E. Birney, Velvet: Algorithms for de novo short read assembly using de Bruijn graphs, Genome Research, vol.18, issue.5, pp.821-829, 2008.
DOI : 10.1101/gr.074492.107

URL : http://genome.cshlp.org/content/18/5/821.full.pdf

K. Zhang and Y. Zheng, GAC ??? the Criterion for Global Avalanche Characteristics of Cryptographic Functions, J. UCS, vol.1, issue.5, pp.320-337, 1995.
DOI : 10.1007/978-3-642-80350-5_30

URL : http://www.jucs.org/jucs_1_5/gac_the_criterion_for/Zhang_X.pdf

Y. Zheng and X. Zhang, Plateaued Functions, Third International Conference on Information and Communications Security , ICICS'99, ser. LNCS, pp.284-300, 1999.
DOI : 10.1007/978-3-540-47942-0_24

I. Milano, . Nice, and ?. France,