New constructions of even-variable rotation symmetric Boolean functions with maximum algebraic immunity
From MaRDI portal
Publication:1931003
DOI10.1016/j.mcm.2011.09.008zbMath1255.94072MaRDI QIDQ1931003
Deshuai Dong, Shaojing Fu, Chao Li, Peng Zhang
Publication date: 24 January 2013
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2011.09.008
Related Items
On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator, Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI, Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
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
- Fast evaluation, weights and nonlinearity of rotation-symmetric functions
- Rotation Symmetric Boolean Functions –; Count and Cryptographic Properties
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A Method of Construction of Balanced Functions with Optimum Algebraic Immunity
- Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- 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
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- Information Security and Cryptology - ICISC 2005
