Constructing 2m-variable Boolean functions with optimal algebraic immunity based on polar decomposition of F^*_2²ᵐ

DOI10.1142/S0129054114500208MaRDI QIDQ2929633zbMATH OpenFDO

Authors Jia Zheng, Baofeng Wu, Zhuojun Liu, Yufu Chen

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

zbMATH Keywords

polar decompositionnonlinearityalgebraic immunityBoolean functionsbalanced

Mathematics Subject Classification ID

Cryptography (94A60) Fuzzy sets and logic (in connection with information, communication, or circuits theory) (94D05) Boolean functions (06E30)

Abstract: Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on decomposition of additive group of the finite field $mathbb{F}_{2^{2m}}$ seems to be a promising approach since Tu and Deng's work. In this paper, we consider the same problem in a new way. Based on polar decomposition of the multiplicative group of $mathbb{F}_{2^{2m}}$, we propose a new construction of Boolean functions with optimal algebraic immunity. By a slight modification of it, we obtain a class of balanced Boolean functions achieving optimal algebraic immunity, which also have optimal algebraic degree and high nonlinearity. Computer investigations imply that this class of functions also behave well against fast algebraic attacks.

Recommendations

• Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
• A systematic method of constructing Boolean functions with optimal algebraic immunity based on the generator matrix of the Reed-Muller code
• Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
• On the Construction of Boolean Functions With Optimal Algebraic Immunity
• Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition

Cites work

• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• A new class of bent and hyper-bent Boolean functions in polynomial forms
• Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
• Basic theory in construction of Boolean functions with maximum possible annihilator immunity
• Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
• Monomial bent functions
• On the Construction of Boolean Functions With Optimal Algebraic Immunity

Cited in

(3)

• On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
• Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
• On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator

This page was built for publication: Constructing \(2m\)-variable Boolean functions with optimal algebraic immunity based on polar decomposition of \(\mathbb{F}^*_{2^{2m}}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929633)