Abstract
The design of large classes of highly nonlinear resilient vectorial functions (mappings from \(\mathbb{F}^n_2\) into \(\mathbb{F}^m_2\), also called S-boxes) is needed for iterated block ciphers and for pseudo-random generators with multiple output. In this paper, we recall the diverse known constructions of such S-boxes, and we show that those which provide good candidate functions are, in fact, all in the same class. This class corresponds to a generalization of a well known construction due to Maiorana and Mac- Farland. We study in detail this construction and we specify it to obtain good S-boxes. In a second part, we generalize to S-boxes the notion of covering sequence. We show that this generalization has the same properties as for Boolean functions, and that it has nice additional properties of stability. We study how this notion can be used to design attacks, and we explain why some functions, including the elements of the new class, cannot be involved in the construction of iterated block ciphers.
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
Anderson, R.: Searching of the optimum correlation attack. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008. Springer, Heidelberg (1995)
Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. J. Cryptology 4(1), 3–72 (1991)
Camion, P., Canteaut, A.: Correlation-immune and resilient functions over a finite alphabet and their applications in cryptography. Des. Codes Cryptogr. 16(2), 121–149 (1999)
Camion, P., Carlet, C., Charpin, P., Sendrier, N.: On correlation-immune functions. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 86–100. Springer, Heidelberg (1992)
Canteaut, A., Trabbia, M.: Improved fast correlation attacks using parity-check equations of weight 4 and 5. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 573–588. Springer, Heidelberg (2000)
Canteaut, A., Videau, M.: Degree of composition of highly nonlinear functions and applications to higher order differential cryptanalysis. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 518–533. Springer, Heidelberg (2002); Issue on Cryptology “Information and Computation”, vol. 151(1/2), pp. 32–56 (1999)
Carlet, C.: On cryptographic propogation criteria for boolean functions. Special Issue on Cryptology, Information and Computation 151(1/2), 32–56 (1999)
Carlet, C.: A larger class of cryptographic boolean functions via a study of the Maiorana-McFarland construction. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 549–564. Springer, Heidelberg (2002)
Carlet, C., Prouff, E.: On a new notion of nonlinearity relevant to multi-ouput pseudo-random generators. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006. Springer, Heidelberg (2004) (to appear)
Carlet, C., Tarannikov, Y.: Covering sequences of Boolean functions and their cryptographic significance. Des. Codes Cryptogr. 25(3), 263–279 (2002)
Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)
Cheon, J.H.: Nonlinear vector resilient functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 396–407. Springer, Heidelberg (2001)
Chor, Goldreich, Hastad, Freidmann, Rudich, Smolensky: The bit extraction problem or t-resilient functions. In: FOCS: IEEE Symposium on Foundations of Computer Science, FOCS (1985)
Courtois, N.: Fast algebraic attacks on stream ciphers with linear feedback. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 176–194. Springer, Heidelberg (2003)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory, vol. 55. North-Holland/Elsevier, Amsterdam (1998)
Delsarte, P.: Bounds for unrestricted codes, by linear programming. Philips Res. Rep. 27, 272–289 (1972)
Delsarte, P.: Four fundamental parameters of a code and their combinatorial significance. Information and Control 23, 407–438 (1973)
Dillon, J.F.: Elementary Hadamard Difference sets. PhD thesis, University of Maryland (1974)
Evertse, J.-H.: Linear structures in blockciphers. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 249–266. Springer, Heidelberg (1988)
Faugère, J.-C., Ars, G.: An algebraic cryptanalysis of nonlinear filter generators using gröbner bases. Rapport de Recherche 4739, INRIA (2003)
Forré, R.: A fast correlation attack on nonlinearly feedforward filtered shift register sequences. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 586–595. Springer, Heidelberg (1990)
Gupta, K., Sarkar, P.: Improved construction of nonlinear resilient s-boxes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 466–483. Springer, Heidelberg (2002)
Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28–40. Springer, Heidelberg (1997)
Johansson, T., Pasalic, E.: A construction of resilient functions with high nonlinearity. In: Proceedings of the IEEE International Symposium on Information Theory (2000)
Khoo, K., Gong, G.: Highly nonlinear sboxes with reduced bound on maximum correlation. In: Proceedings of IEEE International Symposium on Information Theory, p. 254 (2003)
Knudsen, L.: Truncated and higher order differentials. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 196–211. Springer, Heidelberg (1995)
Kurosawa, K., Satoh, T., Yamamoto, K.: Highly nonlinear t-resilient functions. Journal of Universal Computer Science 3(6), 721–729 (1997)
Maitra, S., Pasalic, E.: Linear codes in constructing resilient functions with high nonlinearity. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, p. 60. Springer, Heidelberg (2001); To appear in IEEE Transactions on Information Theory
Matsui, M.: The first experimental cryptanalysis of the data encryption standard. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 1–11. Springer, Heidelberg (1994)
Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)
McFarland, R.L.: A family of difference sets in non-cyclic groups. J. Combinatorial Theory Ser. A 15, 1–10 (1973)
Mihaljević, M.J., Golić, J.D.: Convergence of a Bayesian iterative errorcorrection procedure on a noisy shift register sequence. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 124–137. Springer, Heidelberg (1993)
Nyberg, K.: Perfect Nonlinear S-Boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378–386. Springer, Heidelberg (1991)
Nyberg, K.: On the construction of highly nonlinear permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92–98. Springer, Heidelberg (1993)
Nyberg, K.: Differentially uniform mappings for cryptography. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 55–64. Springer, Heidelberg (1994)
Rothaus, O.S.: On bent functions. Journal of Combinatorial Theory 20a, 300–305 (1976)
Sarkar, P., Maitra, S.: Nonlinearity bounds and constructions of resilient Boolean functions. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 515–532. Springer, Heidelberg (2000)
Seberry, J., Zhang, M., Zheng, Y.: On constructions and nonlinearity of correlation immune functions. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 181–199. Springer, Heidelberg (1994)
Stinson, D.R.: Resilient functions and large sets of orthogonal arrays. Congr. Numer. 92, 105–110 (1993); Twenty-second Manitoba Conference on Numerical Mathematics and Computing, Winnipeg, MB (1992)
Stinson, D.R., Massey, J.L.: An infinite class of counterexamples to a conjecture concerning nonlinear resilient functions. J. Cryptology 8(3), 167–173 (1995)
Xiao, G.-Z., Massey, J.: A spectral characterization of correlation-immune combining functions. IEEE Transactions on Information Theory IT(34), 569–571 (1988)
Zhang, X.-M., Zheng, Y.: On nonlinear resilient functions. In: Guillou, L.C., Quisquater, J.-J. (eds.) EUROCRYPT 1995. LNCS, vol. 921, pp. 274–288. Springer, Heidelberg (1995)
Zhang, X.M., Zheng, Y.: On crypographically resilient functions. IEEE Transactions on Information Theory 43, 1740–1747 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlet, C., Prouff, E. (2004). Vectorial Functions and Covering Sequences. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds) Finite Fields and Applications. Fq 2003. Lecture Notes in Computer Science, vol 2948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24633-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-24633-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21324-6
Online ISBN: 978-3-540-24633-6
eBook Packages: Springer Book Archive