A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS
From MaRDI portal
Publication:2941091
DOI10.1142/S0129054114500324zbMath1316.94091OpenAlexW2081325887MaRDI QIDQ2941091
Xiaohu Tang, Claude Carlet, Deng Tang
Publication date: 21 January 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114500324
nonlinearityBoolean functionsstream cipheralgebraic immunityalgebraic degreefast algebraic attack1-resiliency
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
A construction of 1-resilient Boolean functions with good cryptographic properties ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \)
Cites Work
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
This page was built for publication: A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS
