Advances on Random Sequence Generation by Uniform Cellular Automata

Abstract : 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.
Type de document :
Chapitre d'ouvrage
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>. <http://link.springer.com/book/10.1007/978-3-319-13350-8>
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01218459
Contributeur : Bruno Martin <>
Soumis le : mercredi 21 octobre 2015 - 11:24:28
Dernière modification le : mardi 11 octobre 2016 - 13:56:04

Identifiants

Collections

UNICE | I3S | USPC

Citation

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>. <http://link.springer.com/book/10.1007/978-3-319-13350-8>. <hal-01218459>

Partager

Métriques

Consultations de la notice

55