A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity

From MaRDI portal
Publication:540468


DOI10.1007/s10623-010-9413-9zbMath1226.94013WikidataQ122955093 ScholiaQ122955093MaRDI QIDQ540468

Ziran Tu, Yingpu Deng

Publication date: 3 June 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-010-9413-9


94A60: Cryptography

05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)


Related Items

Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition, A construction of Boolean functions with good cryptographic properties, Algebraic immunity of bent functions of the Dillon class, Approaching Cusick's conjecture on the sum-of-digits function, Cryptographic properties of the hidden weighted bit function, Boolean functions optimizing most of the cryptographic criteria, On the construction of multi-output Boolean functions with optimal algebraic immunity, Another class of perfect nonlinear polynomial functions, Concatenations of the hidden weighted bit function and their cryptographic properties, Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks, The Tu-Deng conjecture holds almost surely, Hybrid classes of balanced Boolean functions with good cryptographic properties, On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\), New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions, Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks, A note on the Tu-Deng conjecture, A combinatorial condition and Boolean functions with optimal algebraic immunity, A construction of 1-resilient Boolean functions with good cryptographic properties, Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction, A characterization of balanced Boolean functions with optimal algebraic immunity, Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields, A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions, A new lower bound on the second-order nonlinearity of a class of monomial bent functions, A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost, Transparency order for Boolean functions: analysis and construction, A note on two classes of Boolean functions with optimal algebraic immunity, Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks, On algebraic immunity of trace inverse functions on finite fields of characteristic two, Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity, A new method to construct Boolean functions with good cryptographic properties, A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers, On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$, Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation, CONSTRUCTING ODD VARIABLE BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY, NEW CONSTRUCTIONS OF VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES, CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$, A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS, Properties of a Family of Cryptographic Boolean Functions



Cites Work