Abstract
In the paper we use recently proposed cellular automata (CA) - based methodology [9] to design 6x4 S-boxes functionally equivalent to S-boxes used in current cryptographic standard known as DES. We provide an exhaustive experimental analysis of the proposed CA-based S-box in terms of non-linearity, autocorrelation, balance and strict avalanche criterion, and compare it with DES S-boxes. We show that the proposed CA-based S-box has cryptographic properties comparable or better than classical S-box tables. The interesting feature of the proposed S-box is a dynamic flexible structure fully functionally realized by CA, while the classical DES S-box is represented by predefined unchangeable table structure.
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
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)
Mukhopadhyay, D., Chowdhury, D.R., Rebeiro, C.: Theory of Composing Non-linear Machines with Predictable Cyclic Structures. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 210–219. Springer, Heidelberg (2008)
Nedjah, N., de Macedo Mourelle, L.: Designing Substitution Boxes for Secure Ciphers. International Journal Innovative Computing and Application 1(1), 86–91 (2007)
Scheier, B.: Applied Cryptography. Wiley, New York (1996)
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)
Webster, A.F., Tavares, S.: On the Design of S-Boxes. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 523–534. Springer, Heidelberg (1986)
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)
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
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Szaban, M., Seredynski, F. (2009). Cellular Automata-Based S-Boxes vs. DES S-Boxes. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2009. Lecture Notes in Computer Science, vol 5698. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03275-2_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-03275-2_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03274-5
Online ISBN: 978-3-642-03275-2
eBook Packages: Computer ScienceComputer Science (R0)