CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$
From MaRDI portal
Publication:2929633
DOI10.1142/S0129054114500208zbMath1370.94549arXiv1304.2946MaRDI QIDQ2929633
Jia Zheng, Baofeng Wu, Yu-Fu Chen, Zhuo-Jun Liu
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.2946
Cryptography (94A60) Boolean functions (06E30) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05)
Related Items (2)
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
- 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 new class of bent and hyper-bent Boolean functions in polynomial forms
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- Monomial bent functions
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
This page was built for publication: CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$
