Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
From MaRDI portal
Publication:1730316
DOI10.1007/s11424-019-8346-2zbMath1448.94313OpenAlexW2912470796WikidataQ128378329 ScholiaQ128378329MaRDI QIDQ1730316
Publication date: 6 March 2019
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-019-8346-2
multiplicative decompositionadditive decompositionBoolean functionalgebraic immunityTu-Deng conjecture
Related Items
A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost, Foreword to the special issue
Cites Work
- Boolean functions optimizing most of the cryptographic criteria
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- The Tu-Deng conjecture holds almost surely
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- A note on the Tu-Deng conjecture
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$
- Properties of a Family of Cryptographic Boolean Functions
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- On a Combinatorial Conjecture
- 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
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity
- Construction of Resilient and Nonlinear Boolean Functions with Almost Perfect Immunity to Algebraic and Fast Algebraic Attacks
- Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition
- Advances in Cryptology - CRYPTO 2003
