Abstract
We investigate the security of n-bit to m-bit vectorial Boolean functions in stream ciphers. Such stream ciphers have higher throughput than those using single-bit output Boolean functions. However, as shown by Zhang and Chan at Crypto 2000, linear approximations based on composing the vector output with any Boolean functions have higher bias than those based on the usual correlation attack. In this paper, we introduce a new approach for analyzing vector Boolean functions called generalized correlation analysis. It is based on approximate equations which are linear in the input x but of free degree in the output z = F(x). Based on experimental results, we observe that the new generalized correlation attack gives linear approximation with much higher bias than the Zhang-Chan and usual correlation attacks. Thus it can be more effective than previous methods.
First, the complexity for computing the generalized nonlinearity for this new attack is reduced from \(2^{2^m \times n+n}\) to 22n. Second, we prove a theoretical upper bound for generalized nonlinearity which is much lower than the unrestricted nonlinearity (for Zhang-Chan’s attack) or usual nonlinearity. This again proves that generalized correlation attack performs better than previous correlation attacks. Third, we introduce a generalized divide-and-conquer correlation attack and prove that the usual notion of resiliency is enough to protect against it. Finally, we deduce the generalized nonlinearity of some known secondary constructions for secure vector Boolean functions.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Canteaut, A., Charpin, P., Dobbertin, H.: Binary m-sequences with three-valued cross correlation: a proof of Welch’s conjecture. IEEE Trans. Inform. Theory 46(1), 4–8 (2000)
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)
Carlet, C.: Vectorial Boolean Functions for Cryptography. In: Crama, E.Y., Hammer, P. (eds.) Boolean Methods and Models, Cambridge University Press, Cambridge (to appear), http://www-rocq.inria.fr/codes/Claude.Carlet/chap-vectorial-fcts.pdf
Carlet, C., Prouff, E.: On a New Notion of Nonlinearity Relevant to Multi-Output Pseudo-Random Generators. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 291–305. Springer, Heidelberg (2004)
Carlet, C., Prouff, E.: Vectorial Functions and Covering Sequences. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Finite Fields and Applications. LNCS, vol. 2948, pp. 215–248. Springer, Heidelberg (2004)
Chor, B., Goldreich, O., Hastad, J., Friedman, J., Rudich, S., Smolensky, R.: The Bit Extraction Problem or t-resilient Functions. In: IEEE Symposium on Foundations of Computer Science 26, pp. 396–407. IEEE Computer Society Press, Los Alamitos (1985)
Dillon, J.F.: Multiplicative Difference Sets via Additive Characters. Designs, Codes and Cryptography 17, 225–235 (1999)
Gold, R.: Maximal Recursive Sequences with 3-valued Cross Correlation Functions. IEEE Trans. Inform. Theory 14, 154–156 (1968)
Gupta, K.C., Sarkar, P.: Improved Construction of Nonlinear Resilient S-boxes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 466–483. Springer, Heidelberg (2002)
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)
Pasalic, E., Maitra, S.: Linear Codes in Constructing Resilient Functions with High Nonlinearity. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 60–74. Springer, Heidelberg (2001)
Rueppel, R.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)
Sarkar, P.: The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 533–548. Springer, Heidelberg (2002)
Siegenthaler, T.: Decrypting a Class of Stream Ciphers using Ciphertexts only. IEEE Transactions on Computers C34(1), 81–85 (1985)
Zhang, M., Chan, A.: Maximum Correlation Analysis of Nonlinear S-boxes in Stream Ciphers. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 501–514. Springer, Heidelberg (2000)
Zhang, X.M., Zheng, Y.: On Cryptographically Resilient Functions. EUROCRYPT 1995 43(5), 1740–1747 (1997) (Also presented at Eurocrypt 1995, LNCS 921, pp. 274-288, Springer, Heidelberg (1995))
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Carlet, C., Khoo, K., Lim, CW., Loe, CW. (2007). Generalized Correlation Analysis of Vectorial Boolean Functions. In: Biryukov, A. (eds) Fast Software Encryption. FSE 2007. Lecture Notes in Computer Science, vol 4593. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74619-5_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-74619-5_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74617-1
Online ISBN: 978-3-540-74619-5
eBook Packages: Computer ScienceComputer Science (R0)