Secondary constructions of Boolean functions with maximum algebraic immunity
From MaRDI portal
Publication:2392688
DOI10.1007/s12095-013-0081-2zbMath1335.94066OpenAlexW1993059127MaRDI QIDQ2392688
Nicholas Kolokotronis, Konstantinos Limniotis, Nicholas Kalouptsidis
Publication date: 2 August 2013
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-013-0081-2
Related Items (2)
Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- On extended algebraic immunity
- Finding More Boolean Functions with Maximum Algebraic Immunity Based on Univariate Polynomial Representation
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A Note on Symmetric Boolean Functions With Maximum Algebraic Immunity in Odd Number of Variables
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- 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
- 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
- On the Algebraic Immunity of Symmetric Boolean Functions
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
This page was built for publication: Secondary constructions of Boolean functions with maximum algebraic immunity
