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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference (2011). http://keccak.noekeon.org/
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)
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)
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)
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)
Leporati, A., Mariot, L.: Cryptographic properties of bipermutive cellular automata rules. J. Cell. Aut. 9(5–6), 437–475 (2014)
Martin, B.: A walsh exploration of elementary CA rules. J. Cell. Aut. 3(2), 145–156 (2008)
Acknowledgements
The author wishes to thank the anonymous referees for their suggestions on how to improve the paper and extend the results for future research.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Mariot, L. (2016). Asynchrony Immune Cellular Automata. In: El Yacoubi, S., Wąs, J., Bandini, S. (eds) Cellular Automata. ACRI 2016. Lecture Notes in Computer Science(), vol 9863. Springer, Cham. https://doi.org/10.1007/978-3-319-44365-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-44365-2_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44364-5
Online ISBN: 978-3-319-44365-2
eBook Packages: Computer ScienceComputer Science (R0)