Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
From MaRDI portal
Publication:2282303
DOI10.1016/j.ins.2016.10.001zbMath1428.94100OpenAlexW2528819694MaRDI QIDQ2282303
Publication date: 7 January 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2016.10.001
Related Items (8)
Constructions of balanced Boolean functions on even number of variables with maximum absolute value in autocorrelation spectra \(< 2^{\frac{n}{2}}\) ⋮ Constructions of 2-resilient rotation symmetric Boolean functions with odd number of 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 ⋮ Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\) ⋮ Several classes of even-variable 1-resilient rotation symmetric Boolean functions with high algebraic degree and nonlinearity ⋮ Construction of resilient Boolean functions in odd variables with strictly almost optimal nonlinearity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Boolean functions optimizing most of the cryptographic criteria
- Secondary constructions of highly nonlinear Boolean functions and disjoint spectra plateaued functions
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- On the lower bounds of the second order nonlinearities of some Boolean functions
- A Maiorana--McFarland type construction for resilient Boolean functions on \(n\) variables (\(n\) even) with nonlinearity \(>2^{n-1}-2^{n/2}+2^{n/2-2}\)
- A family of difference sets in non-cyclic groups
- Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
- Constructions of Resilient S-Boxes With Strictly Almost Optimal Nonlinearity Through Disjoint Linear Codes
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Generalized inversion attack on nonlinear filter generators
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- A spectral characterization of correlation-immune combining functions
- On the security of nonlinear filter generators
- Further constructions of resilient Boolean functions with very high nonlinearity
- Probabilistic Versus Deterministic Algebraic Cryptanalysis—A Performance Comparison
- Constructions of Almost Optimal Resilient Boolean Functions on Large Even Number of Variables
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Shift-register synthesis and BCH decoding
- Cryptography and Coding
This page was built for publication: Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
