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

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

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

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

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

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

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.

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.

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