Advertisement

An Improvement of Correlation Analysis for Vectorial Boolean Functions

  • Youssef HarmouchEmail author
  • Rachid El Kouch
  • Hussain Ben-Azza
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11627)

Abstract

This paper investigates the correlation of n-bit to m-bit vectorial Boolean functions denoted by F. At Crypto 2000, Zhang and Chan showed that the maximum of linear approximations for F with Boolean functions g have a higher bias than those based on the usual correlation attack. The correlation for this linear approximation has been named the maximum correlation and has been shown to be a useful tool for correlation attack resistance. In this work, we deal with two issues. Firstly, we show that combining F with any g does not always increase the bias as stated by several works. To justify such results, we demonstrate the exact correlation link between F, g and the combination of F by g. Secondly, we provide the exact condition in which the correlation coefficients for this approximation are maximum.

Keywords

Correlation attack Vectorial boolean function Bias Maximum correlator Stream cipher 

References

  1. 1.
    Braeken, A.: Cryptographic properties of boolean functions and S-boxes. Ph.D. thesis, phd thesis-2006 (2006)Google Scholar
  2. 2.
    Canteaut, A., Naya-Plasencia, M.: Correlation attacks on combination generators. Crypt. Commun. 4(3–4), 147–171 (2012)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Carlet, C.: Boolean methods and models, ch. boolean functions for cryptography and error correcting codes (2009)Google Scholar
  4. 4.
    Carlet, Claude, Khoo, Khoongming, Lim, Chu-Wee, Loe, Chuan-Wen: Generalized correlation analysis of vectorial boolean functions. In: Biryukov, Alex (ed.) FSE 2007. LNCS, vol. 4593, pp. 382–398. Springer, Heidelberg (2007).  https://doi.org/10.1007/978-3-540-74619-5_24CrossRefGoogle Scholar
  5. 5.
    Carlet, C., Khoo, K., Lim, C.W., Loe, C.W.: On an improved correlation analysis of stream ciphers using multi-output boolean functions and the related generalized notion of nonlinearity. Adv. Math. Commun. 2(2), 201 (2008)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Carlet, Claude, Prouff, Emmanuel: On a new notion of nonlinearity relevant to multi-output pseudo-random generators. In: Matsui, Mitsuru, Zuccherato, Robert J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 291–305. Springer, Heidelberg (2004).  https://doi.org/10.1007/978-3-540-24654-1_21CrossRefGoogle Scholar
  7. 7.
    Daemen, Joan, Govaerts, René, Vandewalle, Joos: Correlation matrices. In: Preneel, Bart (ed.) FSE 1994. LNCS, vol. 1008, pp. 275–285. Springer, Heidelberg (1995).  https://doi.org/10.1007/3-540-60590-8_21CrossRefGoogle Scholar
  8. 8.
    Fuller, J., Millan, W., Dawson, E.: Multi-objective optimisation of bijective s-boxes. New Gener. Comput. 23(3), 201–218 (2005)CrossRefGoogle Scholar
  9. 9.
    Ivanov, G., Nikolov, N., Nikova, S.: Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties. Crypt. Commun. 8(2), 247–276 (2016)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kazymyrov, O., Kazymyrova, V., Oliynykov, R.: A method for generation of high-nonlinear s-boxes based on gradient descent. IACR Cryptology ePrint Arch. 2013, 578 (2013)Google Scholar
  11. 11.
    Khoo, K., Lim, C.W., Gong, G.: Highly nonlinear balanced s-boxes with improved bound on unrestricted and generalized nonlinearity. Appl. Algebra Eng., Commun. Comput. 19(4), 323–338 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Nyberg, Kaisa: S-boxes and round functions with controllable linearity and differential uniformity. In: Preneel, Bart (ed.) FSE 1994. LNCS, vol. 1008, pp. 111–130. Springer, Heidelberg (1995).  https://doi.org/10.1007/3-540-60590-8_9CrossRefGoogle Scholar
  13. 13.
    Picek, S., Carlet, C., Jakobovic, D., Miller, J.F., Batina, L.: Correlation immunity of boolean functions: an evolutionary algorithms perspective. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation. pp. 1095–1102. ACM (2015)Google Scholar
  14. 14.
    Rose, Gregory G., Hawkes, Philip: Turing: a fast stream cipher. In: Johansson, Thomas (ed.) FSE 2003. LNCS, vol. 2887, pp. 290–306. Springer, Heidelberg (2003).  https://doi.org/10.1007/978-3-540-39887-5_22CrossRefzbMATHGoogle Scholar
  15. 15.
    Rueppel, R.A.: Stream ciphers, in\(\backslash \)contemporary cryptology: the science of information integrity. Simmons, G.J. (ed.) (1991)Google Scholar
  16. 16.
    Tarannikov, Yuriy, Korolev, Peter, Botev, Anton: Autocorrelation coefficients and correlation immunity of boolean functions. In: Boyd, Colin (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 460–479. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45682-1_27CrossRefGoogle Scholar
  17. 17.
    Zhang, Muxiang, Chan, Agnes: Maximum correlation analysis of nonlinear s-boxes in stream ciphers. In: Bellare, Mihir (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 501–514. Springer, Heidelberg (2000).  https://doi.org/10.1007/3-540-44598-6_31CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Youssef Harmouch
    • 1
    Email author
  • Rachid El Kouch
    • 1
  • Hussain Ben-Azza
    • 2
  1. 1.Department of Mathematics, Computing and NetworksNational Institute of Posts and TelecommunicationsRabatMorocco
  2. 2.Moulay Ismail University, ENSAM-MeknèsMeknesMorocco

Personalised recommendations