A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code
From MaRDI portal
Publication:2249793
DOI10.1007/s10623-013-9801-zzbMath1321.94091OpenAlexW2017858430MaRDI QIDQ2249793
Xiaohu Tang, Xiangyong Zeng, Sihong Su
Publication date: 3 July 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9801-z
Related Items (2)
Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ Construction of balanced even-variable Boolean functions with optimal algebraic immunity
Cites Work
- Unnamed Item
- 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
- Fast correlation attacks on certain stream ciphers
- The stability theory of stream ciphers
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- A New Construction of Boolean Functions with Maximum Algebraic Immunity
- Reducing the Number of Homogeneous Linear Equations in Finding Annihilators
- 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
- A Method of Construction of Balanced Functions with Optimum Algebraic Immunity
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- On Symmetric Boolean Functions With High Algebraic Immunity on 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 2004
- Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity
- Advances in Cryptology - CRYPTO 2003
- Fast Software Encryption
- Fast Software Encryption
- Coding and Cryptography
This page was built for publication: A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code