It is known that CA rules which are both leftmost and rightmost permutive (bipermutive rules) are expansively and mixing chaotic. In this paper, we prove that bipermutive rules also satisfy the condition of 1-resiliency (that is, balancedness and first order correlation-immunity), which is an important property used in the design of pseudorandom number generators for cryptographic purposes. We thus derive an enumerative encoding for bipermutive rules based on a graph representation, and we use it to generate all the 256 bipermutive rules of radius 2. Among these rules we select the ones which satisfy additional cryp- tographic properties: high nonlinearity and 2-resiliency. Finally, we assess the quality of the pseudorandom sequences generated by these remaining rules with the ENT and NIST statistical test suites, taking the elementary rule 30 as a benchmark.

Leporati, A., & Mariot, L. (2013). 1-Resiliency of Bipermutive Cellular Automata Rules. In Cellular Automata and Discrete Complex Systems - 19th International Workshop (pp.110-123). Springer-Verlag Berlin [10.1007/978-3-642-40867-0_8].

1-Resiliency of Bipermutive Cellular Automata Rules

LEPORATI, ALBERTO OTTAVIO
Primo
;
MARIOT, LUCA
Ultimo
2013

Abstract

It is known that CA rules which are both leftmost and rightmost permutive (bipermutive rules) are expansively and mixing chaotic. In this paper, we prove that bipermutive rules also satisfy the condition of 1-resiliency (that is, balancedness and first order correlation-immunity), which is an important property used in the design of pseudorandom number generators for cryptographic purposes. We thus derive an enumerative encoding for bipermutive rules based on a graph representation, and we use it to generate all the 256 bipermutive rules of radius 2. Among these rules we select the ones which satisfy additional cryp- tographic properties: high nonlinearity and 2-resiliency. Finally, we assess the quality of the pseudorandom sequences generated by these remaining rules with the ENT and NIST statistical test suites, taking the elementary rule 30 as a benchmark.
No
paper
Scientifica
Cellular automata, boolean functions, pseudorandom number generators, stream ciphers, deterministic chaos, permutivity, resiliency, nonlinearity, Walsh transform, ENT test suite, NIST test suite.
English
Automata 2013
978-3-642-40866-3
Leporati, A., & Mariot, L. (2013). 1-Resiliency of Bipermutive Cellular Automata Rules. In Cellular Automata and Discrete Complex Systems - 19th International Workshop (pp.110-123). Springer-Verlag Berlin [10.1007/978-3-642-40867-0_8].
Leporati, A; Mariot, L
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/10281/74635
Citazioni
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 6
Social impact