Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables

DOI10.1109/TIT.2009.2032736MaRDI QIDQ4974116zbMATH OpenOpenAlexFDO

Authors

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.0794

Mathematics Subject Classification ID

Boolean functions (06E30)

Abstract: In this paper, a technique on constructing nonlinear resilient Boolean functions is described. By using several sets of disjoint spectra functions on a small number of variables, an almost optimal resilient function on a large even number of variables can be constructed. It is shown that given any $m$, one can construct infinitely many $n$-variable ($n$ even), $m$-resilient functions with nonlinearity $>2^{n-1}-2^{n/2}$. A large class of highly nonlinear resilient functions which were not known are obtained. Then one method to optimize the degree of the constructed functions is proposed. Last, an improved version of the main construction is given.

Cited in

(24)

• Boolean functions: degree and support
• A construction of 1-resilient Boolean functions with good cryptographic properties
• On negabent functions and nega-Hadamard transform
• Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables
• Construction and count of 1-resilient rotation symmetric Boolean functions
• A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
• Improving high-meets-low technique to generate odd-variable resilient Boolean functions with currently best nonlinearity
• Three classes of balanced vectorial semi-bent functions
• Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
• Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n
• A recursive construction of highly nonlinear resilient vectorial functions
• Construction of balanced Boolean functions with high nonlinearity, good local and global avalanche characteristics
• One sufficient and necessary condition on balanced Boolean functions with \(\sigma_{f} = 2^{2n} + 2^{n+3}\) \((n \geq 3)\)
• Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
• On cross-correlation indicators of an S-box
• Construction of almost optimal resilient Boolean functions via concatenating Maiorana-McFarland functions
• Another class of perfect nonlinear polynomial functions
• The global avalanche characteristics of two Boolean functions and algebraic immunity
• New constructions of balanced Boolean functions with high nonlinearity and optimal algebraic degree
• Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions
• Constructions of balanced Boolean functions with high nonlinearity and high algebraic degree
• Construction of highly nonlinear plateaued resilient functions with disjoint spectra
• A quantum algorithm for testing and learning resiliency of a Boolean function
• New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions

This page was built for publication: Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974116)