Nonlinearity of Boolean Functions: An Algorithmic Approach Based on Multivariate Polynomials
Open Access
- 22 January 2022
- Vol. 14 (2), 213
- https://doi.org/10.3390/sym14020213
Abstract
We review and compare three algebraic methods to compute the nonlinearity of Boolean functions. Two of them are based on Gröbner basis techniques: the first one is defined over the binary field, while the second one over the rationals. The third method improves the second one by avoiding the Gröbner basis computation. We also estimate the complexity of the algorithms, and, in particular, we show that the third method reaches an asymptotic worst-case complexity of operations over the integers, that is, sums and doublings. This way, with a different approach, the same asymptotic complexity of established algorithms, such as those based on the fast Walsh transform, is reached.
Keywords
This publication has 16 references indexed in Scilit:
- Four decades of research on bent functionsDesigns, Codes and Cryptography, 2015
- COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODESJournal of Algebra and Its Applications, 2010
- On the confusion and diffusion properties of Maiorana–McFarland's and extended Maiorana–McFarland's functionsJournal of Complexity, 2004
- Normal Boolean functionsJournal of Complexity, 2004
- Maximum nonlinearity of symmetric Boolean functions on odd number of variablesIEEE Transactions on Information Theory, 2002
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- On the Bent Boolean Functions That are SymmetricEuropean Journal of Combinatorics, 1994
- On “bent” functionsJournal of Combinatorial Theory, Series A, 1976
- Constructions in algebraTransactions of the American Mathematical Society, 1974
- Communication Theory of Secrecy Systems*Bell System Technical Journal, 1949