Abstract
The main concern of this paper is cryptosystems with a symmetric key, in particular block ciphers. The most important components of block ciphers are substitution boxes (S-boxes). Developing methods of cryptanalysis make ciphers worked on classical S-boxes not safe enough. Therefore, we propose a methodology of generation cellular automata (CA)-based S-boxes with enhanced quality. 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 proposed S-boxes have high cryptographic quality. 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 fixed table structures.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adams, C., Tavares, S.: Good S-boxes are easy to find, Advances in cryptology. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 612–615. Springer, Heidelberg (1990)
Albert, J., Culik II, K.: A simple universal cellular automaton and its one-way and totalizing version. Complex Systems 1, 1–16 (1987)
Clark, J.A., Jacob, J.L., Stepney, S., The Design, 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, DES (1999), http://csrc.nist.gov/publications/fips/fips46-3/fips46-3.pdf
Federal Information Processing Standards Publications, FIPS PUBS 197, AES (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. In: Maekawa, M., Belady, L.A. (eds.) IBM 1980. LNCS, vol. 143, pp. 181–192. Springer, Heidelberg (1982)
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., de Macedo Mourelle, L.: Designing Substitution Boxes for Secure Ciphers. International Journal Innovative Computing and Application 1(1), 86–91 (2007)
Smith III, A.R.: Simple computation-universal cellular spaces. Journal ACM 18, 339–353 (1971)
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., Champaign (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
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szaban, M., Nowacki, J.P., Drabik, A., Seredynski, F., Bouvry, P. (2010). Application of Cellular Automata in Symmetric Key Cryptography. In: Papasratorn, B., Lavangnananda, K., Chutimaskul, W., Vanijja, V. (eds) Advances in Information Technology. IAIT 2010. Communications in Computer and Information Science, vol 114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16699-0_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-16699-0_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16698-3
Online ISBN: 978-3-642-16699-0
eBook Packages: Computer ScienceComputer Science (R0)