Advances on Random Sequence Generation by Uniform Cellular Automata - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2014

Advances on Random Sequence Generation by Uniform Cellular Automata

Résumé

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.
Fichier non déposé

Dates et versions

hal-01218459 , version 1 (21-10-2015)

Identifiants

Citer

Enrico Formenti, Katsunobu Imai, Bruno Martin, Jean-Baptiste Yunès. Advances on Random Sequence Generation by Uniform Cellular Automata. Computing with New Resources, 8808, Springer Verlag, pp.56-70, 2014, Lecture Notes in Computer Science, 978-3-319-13349-2. ⟨10.1007/978-3-319-13350-8_5⟩. ⟨hal-01218459⟩
374 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More