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
Vectorial Boolean Functions for Cryptography, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp.398-469, 2010. ,
DOI : 10.1017/CBO9780511780448.012
Making the Mols Table, Computational and Constructive Design Theory, pp.67-134, 1996. ,
DOI : 10.1007/978-1-4757-2497-4_5
Partially permutive cellular automata, Nonlinearity, vol.6, issue.6, pp.1009-1023, 1993. ,
DOI : 10.1088/0951-7715/6/6/010
URL : http://dopey.hut.fi/~kve/tiles/nont.ps.gz
Advances on Random Sequence Generation by Uniform Cellular Automata, pp.56-70, 2014. ,
DOI : 10.1109/18.6037
URL : https://hal.archives-ouvertes.fr/hal-01218459
Latin squares and their applications, 2015. ,
The art of computer programming, p.3, 2011. ,
1-Resiliency of Bipermutive Cellular Automata Rules, Proceedings. pp, pp.110-123, 2013. ,
DOI : 10.1007/978-3-642-40867-0_8
Cryptographic properties of bipermutive cellular automata rules, J. Cellular Automata, vol.956, pp.437-475, 2014. ,
Constructing orthogonal latin squares from linear cellular automata, p.139, 1610. ,
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
Algebraic properties of the block transformation on cellular automata, Complex Systems, vol.10, issue.3, pp.185-194, 1996. ,
Cellular automata as algebraic systems, Complex Systems, vol.6, issue.3, pp.237-250, 1992. ,
Combinatorial designs -constructions and analysis, 2004. ,
How to share a secret with cheaters, Journal of Cryptology, vol.22, issue.11, pp.133-138, 1988. ,
DOI : 10.1007/BF02252871