Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
From MaRDI portal
Publication:4974116
DOI10.1109/TIT.2009.2032736zbMath1367.94478arXiv0905.0794OpenAlexW3098014432MaRDI QIDQ4974116
No author found.
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
Related Items (24)
Boolean functions: degree and support ⋮ A construction of 1-resilient Boolean functions with good cryptographic properties ⋮ Construction of balanced Boolean functions with high nonlinearity, good local and global avalanche characteristics ⋮ A recursive construction of highly nonlinear resilient vectorial functions ⋮ On cross-correlation indicators of an S-box ⋮ ONE SUFFICIENT AND NECESSARY CONDITION ON BALANCED BOOLEAN FUNCTIONS WITH σf = 22n + 2n+3(n ≥ 3) ⋮ On negabent functions and nega-Hadamard transform ⋮ Construction of almost optimal resilient Boolean functions via concatenating Maiorana-McFarland functions ⋮ 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 ⋮ Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes ⋮ Another class of perfect nonlinear polynomial functions ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ 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 ⋮ Three classes of balanced vectorial semi-bent functions ⋮ Constructions of balanced Boolean functions with high nonlinearity and high algebraic degree ⋮ 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\) ⋮ Constructing totally disjoint spectra plateaued functions and searching five-value spectrum functions in odd variables ⋮ New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions ⋮ Construction of Highly Nonlinear Plateaued Resilient Functions with Disjoint Spectra
This page was built for publication: Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
