Skip to main content
Erschienen in: Designs, Codes and Cryptography 2-3/2019

31.07.2018

Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile

verfasst von: Selçuk Kavut, Subhamoy Maitra, Deng Tang

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2-3/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In a very recent work by Tang and Maitra (IEEE Ttans Inf Theory 64(1):393–402, 2018], a theoretical construction of balanced functions f on n-variables (\(n\equiv 2 \bmod 4\)) with very good autocorrelation and Walsh spectra values (\(\varDelta _f < 2^{\frac{n}{2}}\) and \(nl(f) > 2^{n-1} - 2^{\frac{n}{2}} + 2^{\frac{n}{2}-3} - 5\cdot 2^{\frac{n-2}{4}}\)) has been presented. The theoretical bounds could be satisfied for all such \(n \ge 46\). The case for \(n \equiv 0 \bmod 4\) could not be solved in the said paper and it has also been pointed out that though theoretically not proved, such constructions may provide further interesting examples of Boolean functions. In this follow-up work, we concentrate in two directions. First we present a construction method for balanced functions f on n-variables (\(n\equiv 0 \bmod 4\) and \(n \ge 52\)) with \(\varDelta _f < 2^{\frac{n}{2}}\) and \(nl(f) > 2^{n-1} - 2^{\frac{n}{2}}\)). Secondly, we apply search methods in suitable places to obtain balanced functions on even variables in the interval \([10, \ldots , 26]\) with improved parameters that could never be achieved before. As a consequence, for the first time we could provide examples of balanced Boolean functions f having \(\varDelta _f < 2^{\frac{n}{2}}\) for \(n \equiv 0 \bmod 4\), where \(n = 12, 16, 20,\) and 24. Whatever functions we present in this paper have nonlinearity greater than \(2^{n-1} - 2^{\frac{n}{2}}\).
Literatur
1.
Zurück zum Zitat Bartholomew-Biggs, M.: The steepest descent method. In: Nonlinear Optimization with Financial Applications, pp. 51–64 (2005). Bartholomew-Biggs, M.: The steepest descent method. In: Nonlinear Optimization with Financial Applications, pp. 51–64 (2005).
2.
Zurück zum Zitat Burnett L., Millan W., Dawson E., Clark A.: Simpler methods for generating better Boolean functions with good cryptographic properties. Aust. J. Comb. 29, 231–248 (2004).MathSciNetMATH Burnett L., Millan W., Dawson E., Clark A.: Simpler methods for generating better Boolean functions with good cryptographic properties. Aust. J. Comb. 29, 231–248 (2004).MathSciNetMATH
3.
Zurück zum Zitat Carlet C.: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inf. Theory 54(3), 1262–1272 (2008).MathSciNetCrossRefMATH Carlet C.: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inf. Theory 54(3), 1262–1272 (2008).MathSciNetCrossRefMATH
4.
Zurück zum Zitat Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974). Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974).
5.
Zurück zum Zitat Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Proceedings of the Second International Workshop on Fast Software Encryption. Lecture Notes in Computer Science, vol. 1008, pp. 61–74. Springer, Berlin (1995). Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Proceedings of the Second International Workshop on Fast Software Encryption. Lecture Notes in Computer Science, vol. 1008, pp. 61–74. Springer, Berlin (1995).
6.
Zurück zum Zitat Kavut S., Maitra S., Yucel M.D.: Search for Boolean functions with excellent profiles in the rotation symmetric class. IEEE Trans. Inf. Theory 53(5), 1743–1751 (2007).MathSciNetCrossRefMATH Kavut S., Maitra S., Yucel M.D.: Search for Boolean functions with excellent profiles in the rotation symmetric class. IEEE Trans. Inf. Theory 53(5), 1743–1751 (2007).MathSciNetCrossRefMATH
8.
Zurück zum Zitat Lachaud G., Wolfmann J.: The weights of the orthogonals of the extended quadratic binary goppa codes. IEEE Trans. Inf. Theory 36(3), 686–692 (1990).MathSciNetCrossRefMATH Lachaud G., Wolfmann J.: The weights of the orthogonals of the extended quadratic binary goppa codes. IEEE Trans. Inf. Theory 36(3), 686–692 (1990).MathSciNetCrossRefMATH
9.
10.
Zurück zum Zitat Rothaus O.S.: On “bent” functions. J. Comb. Theory Ser. A 20(3), 300–305 (1976).CrossRefMATH Rothaus O.S.: On “bent” functions. J. Comb. Theory Ser. A 20(3), 300–305 (1976).CrossRefMATH
11.
Zurück zum Zitat Seberry, J., Zhang, X.M., Zheng, Y.: On constructions and nonlinearity of correlation immune functions. In: EUROCRYPT 1993. Lecture Notes in Computer Science, Vol. 765, pp. 181–199. Springer, Berlin (1994). Seberry, J., Zhang, X.M., Zheng, Y.: On constructions and nonlinearity of correlation immune functions. In: EUROCRYPT 1993. Lecture Notes in Computer Science, Vol. 765, pp. 181–199. Springer, Berlin (1994).
13.
Zurück zum Zitat Tang D., Maitra S.: Construction of \(n\)-variable (\(n\equiv 2 \text{ mod } 4\)) balanced Boolean functions with maximum absolute value in autocorrelation spectra \(< 2^{\frac{n}{2}}\). IEEE Trans. Inf. Theory 64(1), 393–402 (2018).CrossRefMATH Tang D., Maitra S.: Construction of \(n\)-variable (\(n\equiv 2 \text{ mod } 4\)) balanced Boolean functions with maximum absolute value in autocorrelation spectra \(< 2^{\frac{n}{2}}\). IEEE Trans. Inf. Theory 64(1), 393–402 (2018).CrossRefMATH
14.
Zurück zum Zitat Tang D., Carlet C., Tang X.: Differentially 4-uniform bijections by permuting the inverse function. Des. Codes Cryptogr. 77(1), 117–141 (2015).MathSciNetCrossRefMATH Tang D., Carlet C., Tang X.: Differentially 4-uniform bijections by permuting the inverse function. Des. Codes Cryptogr. 77(1), 117–141 (2015).MathSciNetCrossRefMATH
15.
Zurück zum Zitat Zhang, X.M., Zheng, Y.: GAC—the criterion for global avalanche characteristics of cryptographic functions. J. Univers. Comput. Sci., 320–337 (1996). Zhang, X.M., Zheng, Y.: GAC—the criterion for global avalanche characteristics of cryptographic functions. J. Univers. Comput. Sci., 320–337 (1996).
Metadaten
Titel
Construction and search of balanced Boolean functions on even number of variables towards excellent autocorrelation profile
verfasst von
Selçuk Kavut
Subhamoy Maitra
Deng Tang
Publikationsdatum
31.07.2018
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 2-3/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0522-1

Weitere Artikel der Ausgabe 2-3/2019

Designs, Codes and Cryptography 2-3/2019 Zur Ausgabe

Premium Partner