Boolean functions optimizing most of the cryptographic criteria
From MaRDI portal
Publication:412332
DOI10.1016/J.DAM.2011.08.006zbMATH Open1271.94026OpenAlexW2061056250MaRDI QIDQ412332FDOQ412332
Authors: Ziran Tu, Yingpu Deng
Publication date: 4 May 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.006
Recommendations
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- A recursive construction of balanced Boolean functions with optimal algebraic immunity
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
balancednessBoolean functionnonlinearityalgebraic degreealgebraic immunityresiliencycorrelation immunity
Cites Work
- Title not available (Why is that?)
- On ``bent functions
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- A spectral characterization of correlation-immune combining functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
- Fast Software Encryption
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Title not available (Why is that?)
- On a Conjecture about Binary Strings Distribution
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
- On a combinatorial conjecture
- Title not available (Why is that?)
- Further constructions of resilient Boolean functions with very high nonlinearity
- Title not available (Why is that?)
Cited In (20)
- Title not available (Why is that?)
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- Improved cryptographic properties of Boolean functions obtained from the neighbourhood of Patterson-Wiedemann functions
- Approaching Cusick's conjecture on the sum-of-digits function
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- On Boolean functions with generalized cryptographic properties
- 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
- Title not available (Why is that?)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
- Cryptographic Boolean functions and applications
- Title not available (Why is that?)
- The binary digits of n+t
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- Almost Security of Cryptographic Boolean Functions
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- The Tu-Deng conjecture holds almost surely
- Title not available (Why is that?)
This page was built for publication: Boolean functions optimizing most of the cryptographic criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412332)