A characterization of balanced Boolean functions with optimal algebraic immunity
From MaRDI portal
Publication:1671334
DOI10.1016/j.dam.2018.03.059zbMath1404.94156OpenAlexW2796693428MaRDI QIDQ1671334
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.059
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- 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
- Maximal values of generalized algebraic immunity
- Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large \(n\)
- Properties of a Family of Cryptographic Boolean Functions
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- A Family of Cryptographically Significant Boolean Functions Based on the Hidden Weighted Bit Function
- Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- 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
- Computing the Algebraic Immunity Efficiently
- Perfect Algebraic Immune Functions
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- 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
- On the Algebraic Immunity of Symmetric Boolean Functions
- Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Fast Software Encryption
- Coding and Cryptography
This page was built for publication: A characterization of balanced Boolean functions with optimal algebraic immunity