Abstract
Substitution boxes (S-boxes) are the main elements of block ciphers, wide used in modern cryptography. In this paper we propose a new method to create S-boxes, which is based on application of Cellular Automata (CA). We present results of testing CA-based S-boxes, which confirm that CA are able to realize efficiently Boolean functions corresponding to classical S-boxes. Proposed CA-based S-boxes offer cryptographic properties comparable or better than classical S-box tables.
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.
References
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, pp. 1–22. Verlag Johannes Heyn, Klagenfurt (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
Fuller, J., Millan, W., Dawson, E.: Multi-objective Optimisation of Bijective S-boxes. In: Proceedings of CEC 2004, Portland, OR (2004)
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. Springer, Heidelberg (1999)
Millan, W.: New Cryptographic Applications of Boolean Function Equivalence Classes. In: Boyd, C., González Nieto, J.M. (eds.) ACISP 2005. LNCS, vol. 3574, pp. 572–583. Springer, Heidelberg (2005)
Nedjah, N., de Macedo Mourelle, L.: Designing Substitution Boxes for Secure Ciphers. International Journal Innovative Computing and Application 1(1), 86–91 (2007)
Schneier, B.: Applied Cryptography. Wiley, New York (1996)
Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular Automata Computations and Secret Key Cryptography. Parallel Computing 30, 753–766 (2004)
Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)
Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szaban, M., Seredynski, F. (2008). Cryptographically Strong S-Boxes Based on Cellular Automata. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds) Cellular Automata. ACRI 2008. Lecture Notes in Computer Science, vol 5191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79992-4_62
Download citation
DOI: https://doi.org/10.1007/978-3-540-79992-4_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79991-7
Online ISBN: 978-3-540-79992-4
eBook Packages: Computer ScienceComputer Science (R0)