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.94013OpenAlexW2095563835WikidataQ122955093 ScholiaQ122955093MaRDI QIDQ540468
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
Cryptography (94A60) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items
A construction of 1-resilient Boolean functions with good cryptographic properties ⋮ Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI ⋮ NEW CONSTRUCTIONS OF VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES ⋮ Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction ⋮ Approaching Cusick's conjecture on the sum-of-digits function ⋮ CONSTRUCTING 2m-VARIABLE BOOLEAN FUNCTIONSWITH OPTIMAL ALGEBRAIC IMMUNITY BASED ON POLAR DECOMPOSITION OF $\mathbb{F}^\ast_{2^{2m}}$ ⋮ A characterization of balanced Boolean functions with optimal algebraic immunity ⋮ A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS ⋮ A new lower bound on the second-order nonlinearity of a class of monomial bent functions ⋮ Properties of a Family of Cryptographic Boolean Functions ⋮ 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 ⋮ Cryptographic properties of the hidden weighted bit function ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ The binary digits of n+t ⋮ Boolean functions optimizing most of the cryptographic criteria ⋮ Revisiting some results on APN and algebraic immune functions ⋮ A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost ⋮ A note on the Tu-Deng conjecture ⋮ A combinatorial condition and Boolean functions with optimal algebraic immunity ⋮ On the construction of multi-output Boolean functions with optimal algebraic immunity ⋮ 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 ⋮ Another class of perfect nonlinear polynomial functions ⋮ Concatenations of the hidden weighted bit function and their cryptographic properties ⋮ Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields ⋮ The Tu-Deng conjecture holds almost surely ⋮ Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks ⋮ A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions ⋮ Hybrid classes of balanced 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 ⋮ On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\) ⋮ Transparency order for Boolean functions: analysis and construction ⋮ 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 ⋮ CONSTRUCTING ODD VARIABLE BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY ⋮ A note on two classes of Boolean functions with optimal algebraic immunity ⋮ Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition ⋮ A construction of Boolean functions with good cryptographic properties ⋮ A lower bound for Cusick’s conjecture on the digits of n + t ⋮ Algebraic immunity of bent functions of the Dillon class
Cites Work
- 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 ``bent functions
- 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
- Advances in Cryptology - EUROCRYPT 2004
- Exact relation between nonlinearity and algebraic immunity
- Advances in Cryptology - CRYPTO 2003
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- On the Higher Order Nonlinearities of Algebraic Immune Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
