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-9zbMATH Open1226.94013OpenAlexW2095563835WikidataQ122955093 ScholiaQ122955093MaRDI QIDQ540468FDOQ540468
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On ``bent functions
- Advances in Cryptology - CRYPTO 2003
- Progress in Cryptology - INDOCRYPT 2004
- Fast Software Encryption
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Advances in Cryptology - EUROCRYPT 2004
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Exact relation between nonlinearity and algebraic immunity
- 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 and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- On the Higher Order Nonlinearities of Algebraic Immune Functions
- Boolean functions with algebraic immunity one
Cited In (45)
- On the Varshamov-Tenengolts construction on binary strings
- A new method to construct Boolean functions with good cryptographic properties
- Transparency order for Boolean functions: analysis and construction
- Boolean functions optimizing most of the cryptographic criteria
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- A construction of Boolean functions with good cryptographic properties
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
- A construction of 1-resilient Boolean functions with good cryptographic properties
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
- Hybrid classes of balanced Boolean functions with good cryptographic properties
- Approaching Cusick's conjecture on the sum-of-digits function
- On the construction of multi-output Boolean functions with optimal algebraic immunity
- A characterization of balanced Boolean functions with optimal algebraic immunity
- Constructing odd-variable RSBFs with optimal algebraic immunity, good nonlinearity and good behavior against fast algebraic attacks
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
- Constructing \(2m\)-variable Boolean functions with optimal algebraic immunity based on polar decomposition of \(\mathbb{F}^*_{2^{2m}}\)
- Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI
- On a conjecture of Cusick concerning the sum of digits of \(n\) and \(n+t\)
- Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- A note on the Tu-Deng conjecture
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
- A lower bound for Cusickβs conjecture on the digits of n + t
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- Constructing odd variable Boolean functions with optimal algebraic immunity
- A CLASS OF 1-RESILIENT BOOLEAN FUNCTIONS WITH OPTIMAL ALGEBRAIC IMMUNITY AND GOOD BEHAVIOR AGAINST FAST ALGEBRAIC ATTACKS
- Cryptographic properties of the hidden weighted bit function
- A note on two classes of Boolean functions with optimal algebraic immunity
- Concatenations of the hidden weighted bit function and their cryptographic properties
- Another class of perfect nonlinear polynomial functions
- New constructions of vectorial Boolean functions with good cryptographic properties
- 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
- Algebraic immunity of bent functions of the Dillon class
- Revisiting some results on APN and algebraic immune functions
- Properties of a Family of Cryptographic Boolean Functions
- The binary digits of n+t
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Constructing vectorial Boolean functions with high algebraic immunity based on group decomposition
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
- On algebraic immunity of trace inverse functions on finite fields of characteristic two
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- The Tu-Deng conjecture holds almost surely
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions
Recommendations
- Title not available (Why is that?) π π
- Further properties of several classes of Boolean functions with optimum algebraic immunity π π
- On the construction of multi-output Boolean functions with optimal algebraic immunity π π
- 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 π π
- Construction and enumeration of Boolean functions with maximum algebraic immunity π π
- A note on two classes of Boolean functions with optimal algebraic immunity π π
- A New Construction of Boolean Functions with Maximum Algebraic Immunity π π
- A combinatorial condition and Boolean functions with optimal algebraic immunity π π
This page was built for publication: A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540468)