Abstract
The most important building blocks of symmetric cryptographic primitives such as the DES or the AES, are vectorial Boolean functions, also called S-boxes. In this paper, we extend the definition of normality for Boolean functions into several new affine invariant properties for vectorial Boolean functions. We compute the probability of occurrence of these properties and present practical algorithms for each of these new properties. We find a new structural property for the AES S-box, which also holds for a large class of permutation functions when the dimension n is even. Moreover, we prove a relation with the propagation characteristics of a vectorial function and extend the scope of non-APN functions for n even.
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
Biryukov, A., De Cannière, C., Braeken, A., Preneel, B.: A Toolbox for Cryptanalysis: Linear and Affine Equivalence Algorithms. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 33–50. Springer, Heidelberg (2003)
Braeken, A., Wolf, C., Preneel, B.: A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions, 3rd International Conference on Theoretical Computer Science, pp. 51–66. Kluwer, Dordrecht (2004)
Braeken, A., Wolf, C., Preneel, B.: Classification of Highly Nonlinear Boolean Power Functions with a Randomised Algorithm for Checking Normality, Cryptology ePrint Archive, Report 2004/214, http://eprint.iacr.org/2004/214/
Canteaut, A., Daum, M., Leander, G., Dobbertin, H.: Normal and non normal bent functions. In: International Workshop on Coding and Cryptography, pp. 91–100 (March 2003)
Charpin, P., Tietäväinen, A., Zonoviev, V.: On Binary Cyclic Codes with d = 3, TUCS Technical Report No. 26 (June 1996)
Daum, M., Dobbertin, H., Leander, G.: An Algorithm for Checking Normality of Boolean Functions. In: International Workshop on Coding and Cryptography, pp. 78–90 (March 2003)
Evertse, J.H.: Linear Structures in Block Ciphers. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 249–266. Springer, Heidelberg (1988)
Hellman, M.E., Merkle, R., Schroeppel, R., Washington, L., Die, W., Pohlig, S., Schweitzer, P.: Results of an initial attempt to cryptanalyze the NBS Data Encryption Standard. Technical report, Stanford University, U.S.A. (September 1976)
Hou, X.-D.: Affinity of Permutations. In: WCC 2003, pp. 273–280 (2003)
Lai, X.: Additive and Linear Structures of Cryptographic Functions. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 75–85. Springer, Heidelberg (1995)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam (1991), ISBN 0-444-85193-3
Matsumoto, T., Imai, H.: Public Quadratic Polynomial-Tuples for Efficient Signature Verification and Message-Encryption. In: EuroCrypt. LNCS, vol. 434, pp. 419–545. Springer, Heidelberg (1988)
Nowak, K.: Checking Normality of Boolean functions. Tatra Mountins, p. 12 (2004) (to appear)
Nyberg, K.: S-boxes and Round Functions with Controllable Linearity and Differential Cryptanalysis. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 111–129. Springer, Heidelberg (1995)
Zhang, X.M., Zheng, Y.: The nonhomomorphicity of Boolean functions. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, pp. 280–295. Springer, Heidelberg (1999)
Zheng, Y., Zhang, X.-M.: The kth-Order Nonhomomorphicity of S-Boxes. Journal of Universal Computer Science 6(8), 830–848 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Braeken, A., Wolf, C., Preneel, B. (2005). Normality of Vectorial Functions. In: Smart, N.P. (eds) Cryptography and Coding. Cryptography and Coding 2005. Lecture Notes in Computer Science, vol 3796. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11586821_13
Download citation
DOI: https://doi.org/10.1007/11586821_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30276-6
Online ISBN: 978-3-540-32418-8
eBook Packages: Computer ScienceComputer Science (R0)