A characterization of binary bent functions
Bent functions are Boolean functions used in cryptography. They can be defined as those functions that reach the maximum Hamming distance to the set of all affine functions defined on \(V=GF(2)^n\). An alternative definition uses the property of a bent function \(f\) that the Fourier coefficients of \(F:x\mapsto (-1)^{f(x)}\) are \(\pm1\) only (or, equivalently, the Walsh coefficients are \(\pm2^{n\over 2}\) only). In 1995, the first author [IEEE Trans. Inf. Theory 41, 1482-1487 (1995; Zbl 0831.94022)] constructed bent functions by means of characteristic functions \(\chi_{E_i}\) of \({n\over 2}\)-dim subspaces \(E_i\) of \(V\) and suggested the following characterization of bent functions which is now proved to be true. If \(f\) is a Boolean function on \(V=GF(2)^n\), then \(f\) is a bent function iff there exist \({n\over 2}\)-dimensional subspaces \(E_1,\dots,E_k\) of \(V\) and integers \(m_1,\dots,m_k\) such that for all \(x\in V\) \[ f(x)=\sum m_i \chi_{E_i}(x)+2^{{n\over 2}-1} \chi_{\{0\}}(x)\quad \pmod 2^{n\over 2}. \] This characterization is a big step to better understanding of bent functions.
- scientific article; zbMATH DE number 841853
- Generalized partial spreads
- An alternate characterization of the bentness of binary functions, with uniqueness
- Some properties of bent functions
- scientific article; zbMATH DE number 953210
- Bent functions on a finite Abelian group
- scientific article; zbMATH DE number 1390153
- Bent functions. Fundamentals and results
- Results on bent functions
- On the bent Boolean functions that are symmetric
- Bent functions embedded into the recursive framework of \(\mathbb{Z}\)-bent functions
- On ``bent functions
- Results on bent functions
- An alternate characterization of the bentness of binary functions, with uniqueness
- Cubic bent functions
- Cryptographically significant Boolean functions with five valued Walsh spectra
- Highly nonlinear mappings
- A new construction of bent functions based on \({\mathbb{Z}}\)-bent functions
- New characterizations and construction methods of bent and hyper-bent Boolean functions
- A note on vectorial bent functions
- Some properties of bent functions
- A quadratic part of a bent function can be any
- Highly nonlinear balanced Boolean functions with very good autocorrelation property
- Recent results on binary bent functions
- \(\mathrm{GF}(2^n)\)-bent functions
- Decomposing bent functions
- Bent and generalized bent Boolean functions
- Boolean functions with two distinct Walsh coefficients
- scientific article; zbMATH DE number 953210 (Why is no real title available?)
- scientific article; zbMATH DE number 841853 (Why is no real title available?)
- Construction of bent functions of 2kvariables from a basis of
- On the coefficients of binary bent functions
- scientific article; zbMATH DE number 7300318 (Why is no real title available?)
- Completed \({\mathcal {GPS}}\) covers all bent functions
- Partial bent-functions
- Modifying bent functions to obtain the balanced ones with high nonlinearity
- Bent functions constructed from finite pre-quasifield spreads
- Characterizations of bent and almost bent function on \({\mathbb{Z}}_p^2\)
- A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts
- Four decades of research on bent functions
This page was built for publication: A characterization of binary bent functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563720)
