We present an iterative construction that can be used to construct balanced functions with high nonlinearity. Using this construction, we obtained Boolean functions in an even number n ⩾ 18 of variables which have no linear structures with nonlinearity 2n-1 - (2n/2-1 + 2n/2-3 + 2n/2-5 + 2n/2-7). Additional conditions are given under which the functions obtained using the construction will be correlation immune. We also present results concerning “bent sum decomposition problem”.
Download file
Counter downloads: 93
- Title Construction of balanced functions with high nonlinearity and other cryptographic properties
- Headline Construction of balanced functions with high nonlinearity and other cryptographic properties
- Publesher
Tomsk State University
- Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 63
- Date:
- DOI 10.17223/20710410/63/1
Keywords
balanced Boolean functions, nonlinear Boolean functions, bent functionsAuthors
References
Matsui М. Linear cryptanalysis method for DES cipher // LNCS. 1994. V. 765. P.386-397.
Rothaus O.S. On bent functions //j.Comb. Theory. Ser. A. 1976. V. 20. No. 3. P.300-305.
Adams С. M. Constructing symmetric ciphers using the CAST design procedure // Des. Codes Crvptogr. 1997. V. 12. No. 3. P.283-316.
Hell C., Johansson T., Maximov A., and Meier W. A stream cipher proposal: Grain-128 // IEEE Intern. Svmp. Inform. Theory. Seattle, WA, USA, 2006. P. 1614-1618.
Zheng Y., Pieprzyk J., and Seberry J. Haval - a one-way hashing algorithm with variable length of output (extended abstract) // LNCS. 1993. V. 718. P.83-104.
Helleseth T. and Kholosha A. Bent functions and their connections to combinatorics / S.R. Blackburn, S. Gerke, and M. Wildon (eds.). Surveys in Combinatorics. London Math. Soc. Lecture Note Ser. 2013. V. 409. Cambridge: Cambridge University Press, 2013. P. 91-126.
Tokareva N. Bent Functions: Results and Applications to Cryptography. London: Acad. Press, 2015.
Токарева H. H. О множестве производных булевой бент-функции // Прикладная дискретная математика. Приложение. 2016. №9. С. 327-350.
McFarland R. L. A family of difference sets in non-cyclic groups //j.Combin. Theory. Ser. A. 1973. V. 15. P. 1-10.
Dillon J. F. Elementary Hadamard Difference Sets. PhD. Thesis. Univ. of Maryland, 1974.
Логачев О. А., Сальников А. А., Смышляев C.B., Ященко В. В. Булевы функции в теории кодирования и криптологии. М.: МЦНМО, 2012.
Siegentaler Т. Correlation-immunity of nonlinear combining functions for cryptographic applications // IEEE Trans. Inform. Theory. 1984. V. 30. No. 5. P.776-780.
Seberry J., Zhang X-M., and Zheng Y. Nonlinearlv balanced Boolean functions and their propagation characteristics // LNCS. 1994. V.773. P.49-60.
Dobbertin H. Construction of bent functions and balanced Boolean functions with high nonlinearity // LNCS. 1994. V. 1008. P.61-74.
Dobbertin H. and Leander G. Cryptographer’s Toolkit for Construction of 8-bit Bent Functions. Cryptology ePrint Archive. Report 2005/089. 2005.
Ни X., Yang B., and Huang M. A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost // Discr. Appl. Math. 2020. V. 285. P.407-422.
Carlet C., Djurasevic M., Jakobovic D., et al. Evolving Constructions for Balanced, Highly Nonlinear Boolean Functions, https://arxiv.org/abs/2202.08743.2022.
Gini A. and Meaux P. Weightwise perfectly balanced functions and nonlinearity // LNCS. 2023. V. 13874. P.386-397.
Shaporenko A. Derivatives of bent functions in connection with the bent sum decomposition problem // Des. Codes Crvptogr. 2023. V.91. P.1607-1625.
Tokareva N.N. On the number of bent functions from iterative constructions: lower bounds and hypotheses // Adv. Math.Commun. 2011. V.5. No.4. P.609-621.
Canteaut A. and Charpin Р. Decomposing bent functions // IEEE Trans. Inform. Theory. 2003. V.49. No.8. P.2004-2019.

Construction of balanced functions with high nonlinearity and other cryptographic properties | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2024. № 63. DOI: 10.17223/20710410/63/1
Download full-text version
Counter downloads: 101