Cellular automata, boolean functions and combinatorial designs

Abstract : The goal of this thesis is the investigation of Cellular Automata (CA) from the perspective of Boolean functions and combinatorial designs. Beside its theoretical interest, this research finds its motivation in cryptography, since Boolean functions and combinatorial designs are used to construct Pseudorandom Number Generators (PRNG) and Secret Sharing Schemes (SSS). The results presented in the thesis are developed along three research lines, organized as follows. The first line considers the use of heuristic optimization algorithms to search for Boolean functions with good cryptographic properties, to be used as local rules in CA-based PRNG. The main motivation is to improve Wolfram's generator based on rule 30, which has been shown to be vulnerable against two cryptanalytic attacks. The second line deals with vectorial Boolean functions induced by CA global rules. The first contribution considers the period of preimages of spatially periodic configurations in surjective CA, and analyze the cryptographic properties of CA global rules. The third line focuses on the combinatorial designs generated by CA, specifically considering Orthogonal Latin Squares (OLS), which are equivalent to SSS. In particular, an algebraic characterization of OLS generated by linear CA is given, and heuristic algorithms are used to build OLS based on nonlinear CA.
Document type :
Complete list of metadatas

Cited literature [179 references]  Display  Hide  Download

Contributor : Abes Star <>
Submitted on : Monday, June 11, 2018 - 10:54:06 AM
Last modification on : Monday, November 5, 2018 - 3:48:02 PM
Long-term archiving on : Wednesday, September 12, 2018 - 9:37:22 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01812051, version 1



Luca Mariot. Cellular automata, boolean functions and combinatorial designs. Automatic Control Engineering. Université Côte d'Azur, 2018. English. ⟨NNT : 2018AZUR4011⟩. ⟨tel-01812051⟩



Record views


Files downloads