Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
From MaRDI portal
Publication:780984
DOI10.1016/j.ins.2017.08.097zbMath1436.94081OpenAlexW2751505872MaRDI QIDQ780984
Publication date: 16 July 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2017.08.097
Related Items
On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
Cites Work
- Unnamed Item
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- Maximal values of generalized algebraic immunity
- Properties of a Family of Cryptographic Boolean Functions
- Generalized Maiorana–McFarland Construction of Resilient Boolean Functions With High Nonlinearity and Good Algebraic Properties
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- On the Construction of Cryptographically Significant Boolean Functions Using Objects in Projective Geometry Spaces
- Algebraic Immunity of S-Boxes and Augmented Functions
- On the Nonlinearity of Discrete Logarithm in $\mathbb F_{2^n}$
- 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
- Perfect Algebraic Immune Functions
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Fast Software Encryption
- Information Security and Cryptology - ICISC 2005
