Abstract
The most important elements of many block ciphers are nonlinear functions known as substitution boxes (S-boxes). Classical S-boxes are usually represented by numerical tables, which are used today in current cryptographic standards, such as Data Encryption Standard (DES) or Advanced Encryption Standard (AES), but in the result of developing methods of cryptanalysis they do not ensure enough safety of ciphers. Therefore, the open research issue now is to design new more sophisticated classes of S-boxes, in particular dynamic ones. In this paper we propose a methodology to design dynamic cellular automata (CA)-based S-boxes, which can be considered as a generator of CA-based S-boxes. We provide an exhaustive experimental analysis of the proposed CA-based S-boxes in terms of non-linearity, autocorrelation, balance and strict avalanche criterion. We show that the proposed S-boxes have high quality cryptographic properties (high non-linearity and balance, also low autocorrelation and distance to fulfill strict avalanche criterion). The interesting feature of the proposed S-boxes is a dynamic flexible structure, fully functionally realized by CA, while the classical S-boxes are represented by predefined unchangeable table structures.
Keywords
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert, J., Culik II, K.: A simple universal cellular automaton and its one-way and totalising version. Complex Systems 1, 1–16 (1987)
Clark, J.A., Jacob, J.L., Stepney, S.: The Design of S-Boxes by Simulated Annealing. New Generation Computing 23(3), 219–231 (2005)
Dowson, E., Millan, W., Simpson, L.: Designing Boolean Functions for Cryptographic Applications. Contributions to General Algebra 12, 1–22 (2000)
Federal Information Processing Standards Publication, Fips Pub 46 - 3, Reaffirmed (October 25, 1999), http://csrc.nist.gov/publications/fips/fips46-3/fips46-3.pdf
Federal Information Processing Standards Publications (FIPS PUBS) 197, AES (November 26, 2001), http://csrc.nist.gov/publications/fips/fips197/fips-197.pdf
Feistel, H.: Cryptography and Computer Privacy. Scientific American 228(5), 15–23 (1973)
Millan, W.: How to Improve the Non-linearity of Bijective S-boxes. LNCS, vol. 143, pp. 181–192. Springer, Heidelberg (1998)
Millan, W., Burnett, L., Carter, G., Clark, A., Dawson, E.: Evolutionary Heuristics for Finding Cryptographically Strong S-Boxes. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 263–274. Springer, Heidelberg (1999)
Nedjah, N., Mourelle, L.: Designing Substitution Boxes for Secure Ciphers. International Journal Innovative Computing and Application 1, 86–91 (2007)
Szaban, M., Seredynski, F.: Cryptographically Strong S-Boxes Based on Cellular Automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 478–485. Springer, Heidelberg (2008)
Szaban, M., Seredynski, F.: Cellular Automata-based S-Boxes vs. DES S-Boxes. In: Malyshkin, V. (ed.) PaCT 2009. LNCS, vol. 5698, pp. 269–283. Springer, Heidelberg (2009)
Webster, A.F., Tavares, S.E.: On the Design of S-Boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)
Wolfram, S.: Universality and complexity in cellular automata. Phisica D 10, 1–35 (1984)
Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Illinois (2002)
Youssef, A., Tavares, S.: Resistance of Balanced S-boxes to Linear and Differential Cryptanalysis. Information Processing Letters 56, 249–252 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szaban, M., Seredynski, F. (2012). Dynamic Cellular Automata-Based S-Boxes. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27549-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-27549-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27548-7
Online ISBN: 978-3-642-27549-4
eBook Packages: Computer ScienceComputer Science (R0)