Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
From MaRDI portal
Publication:1650428
DOI10.1007/s10623-017-0418-5zbMath1402.94063OpenAlexW2762829040MaRDI QIDQ1650428
Nicholas Kolokotronis, Konstantinos Limniotis
Publication date: 3 July 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0418-5
Related Items
On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator, The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code
- Secondary constructions of Boolean functions with maximum algebraic immunity
- Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity
- Boolean Functions with Maximum Algebraic Immunity Based on Properties of Punctured Reed–Muller Codes
- Properties of a Family of Cryptographic Boolean Functions
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity
- Perfect Algebraic Immune Functions
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Bent and Hyper-Bent Functions in Polynomial Form and Their Link With Some Exponential Sums and Dickson Polynomials
- Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity
- Advances in Cryptology - CRYPTO 2003
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
