Generalized Walsh transforms of symmetric and rotation symmetric Boolean functions are linear recurrent
Exponential sums of symmetric Boolean functions are linear recurrent with integer coefficients. This was first established by Cai, Green and Thierauf in the mid nineties. Consequences of this result has been used to study the asymptotic behavior of symmetric Boolean functions. Recently, Cusick extended it to rotation symmetric Boolean functions, which are functions with good cryptographic properties. In this article, we put all these results in the general context of Walsh transforms and some of its generalizations (nega–Hadamard transform, for example). Precisely, we show that Walsh transforms, for which exponential sums are just an instance, of symmetric and rotation symmetric Boolean functions satisfy linear recurrences with integer coefficients. We also provide a closed formula for the Walsh transform and nega–Hadamard transform of any symmetric Boolean functions. Moreover, using the techniques presented in this work, we show that some families of rotation symmetric Boolean functions are not bent when the number of variables is sufficiently large and provide asymptotic evidence to a conjecture of Stănică and Maitra.
KeywordsWalsh transform Nega–Hadamard transform Symmetric Boolean functions Rotation symmetric Boolean functions Linear recurrences
The authors would like to thank the anonymous reviewers for the thorough reading and for their detailed and useful comments that improved the paper. This paper was written during a pleasant visit of P. S. to the Department of Mathematics of the University of Puerto Rico in Spring of 2017. This author thanks the institution for hospitality.
- 4.Castro, F.N., Chapman, R., Medina, L.A., Sepúlveda, L.B.: Recursions associated to trapezoid, symmetric and rotation symmetric functions over Galois fields. arXiv:1702.08038 (2017)
- 8.Ciungu, L.C.: Cryptographic Boolean functions: thus-Morse sequences, weight and nonlinearity. Ph. D. Thesis, The University at Buffalo, State University of New York (2010)Google Scholar
- 9.Conrad, K.: Roots on a circle, expository note. http://www.math.uconn.edu/~kconrad/blurbs/
- 10.Cusick, T. W.: Weight recursions for any rotation symmetric Boolean functions. arXiv:1701.06648 [math.CO]
- 15.Dalai, D.K., Maitra, S., Sarkar, S.: Results on rotation symmetric bent functions. In: Second International Workshop on Boolean Functions: Cryptography and Applications, BFCA’06, Publications of the Universities of Rouen and Havre, pp. 137–156 (2006)Google Scholar
- 16.Filiol, E., Fontaine, C.: Highly nonlinear balanced Boolean functions with a good correlation immunity, In: Eurocrypt 1998. LNCS, vol. 1403, pp. 475–488. Springer, Berlin (1998)Google Scholar
- 17.Hell, M., Maximov, A., Maitra, S.: On efficient implementation of search strategy for rotation symmetric Boolean functions. In: Ninth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT 2004. Black Sea Coast, Bulgaria (2004)Google Scholar
- 18.Maximov, A., Hell, M., Maitra, S.: Plateaued rotation symmetric Boolean functions on odd number of variables. In: First Workshop on Boolean Functions: Cryptography and Applications, BFCA’05, Publications of the Universities of Rouen and Havre, pp. 83–104 (2005)Google Scholar
- 20.Parker, M.G., Pott, A.: On Boolean functions which are bent and negabent, In: Golomb, S.W., Gong, G., Helleseth, T., Song, H.-Y. (eds.) SSC 2007. LNCS vol. 4893, pp. 9–23. Springer, Heidelberg (2007)Google Scholar
- 22.Prasolov, V.V.: Polynomials, Algorithms and Computation in Mathematics, vol. 11. Springer, Berlin (2004)Google Scholar
- 26.Stănică, P.: On the nonexistence of homogeneous rotation symmetric bent Boolean functions of degree greater than two. In: Proc. NATO Advanced Study Institute on Boolean Functions in Cryptology and Information Security, pp. 214–218. IOS Press, Amsterdam (2008)Google Scholar
- 30.Stănică, P., Maitra, S., Clark, J.: Results on rotation symmetric bent and correlation immune Boolean functions, fast software encryption, FSE 2004, LNCS, vol. 3017, pp. 161–177, Springer (2004)Google Scholar