Asynchrony Immune Cellular Automata

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9863)

Abstract

We introduce the notion of asynchrony immunity for cellular automata (CA), which can be considered as a generalization of correlation immunity in the case of boolean functions. The property could have applications in cryptography, namely as a countermeasure for side-channel attacks in CA-based cryptographic primitives. We give some preliminary results about asynchrony immunity, and we perform an exhaustive search of (3, 10)–asynchrony immune CA rules of neighborhood size 3 and 4. We finally observe that all discovered asynchrony-immune rules are center-permutive, and we conjecture that this holds for any size of the neighborhood.

Keywords

Cellular automata Cryptography Asynchrony immunity Correlation immunity Nonlinearity Side-channel attacks Permutivity 

References

  1. 1.
    Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comput. Syst. Sci. 6(5), 448–464 (1972)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference (2011). http://keccak.noekeon.org/
  3. 3.
    Carlet, C.: Boolean functions for cryptography and error-correcting codes. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, New York (2010)Google Scholar
  4. 4.
    Carlet, C.: Vectorial boolean functions for cryptography. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Cambridge University Press, New York (2010)Google Scholar
  5. 5.
    Chor, B., Goldreich, O., Håstad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions. In: 26th Annual Symposium on Foundations of Computer Science, pp. 396–407. IEEE Press, New York (1985)Google Scholar
  6. 6.
    Formenti, E., Imai, K., Martin, B., Yunés, J.-B.: Advances on random sequence generation by uniform cellular automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Gruska Festschrift. LNCS, vol. 8808, pp. 56–70. Springer, Heidelberg (2014)Google Scholar
  7. 7.
    Leporati, A., Mariot, L.: Cryptographic properties of bipermutive cellular automata rules. J. Cell. Aut. 9(5–6), 437–475 (2014)MathSciNetMATHGoogle Scholar
  8. 8.
    Martin, B.: A walsh exploration of elementary CA rules. J. Cell. Aut. 3(2), 145–156 (2008)MathSciNetMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Dipartimento di Informatica, Sistemistica e ComunicazioneUniversità degli Studi Milano-BicoccaMilanoItaly
  2. 2.Laboratoire I3SUniversité Nice-Sophia AntipolisSophia AntipolisFrance

Personalised recommendations