The study of cellular automata rules suitable for cryptographic applications is under consideration. On one hand, cellular automata can be used to generate pseudo-random sequences as well as for the design of S-boxes in symmetric cryptography. On the other hand, Boolean functions with good properties like resiliency and non-linearity are usually obtained either by exhaustive search or by the use of genetic algorithms. We propose here to use some recent research in the classification of Boolean functions and to link it with the study of cellular automata rules. As a consequence of our technique, this also provides a mean to get Boolean functions with good cryptographic properties.
CITATION STYLE
Formenti, E., Imai, K., Martin, B., & Yunès, J. B. (2014). Advances on random sequence generation by uniform cellular automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8808, 56–70. https://doi.org/10.1007/978-3-319-13350-8_5
Mendeley helps you to discover research relevant for your work.