Boolean functions optimizing most of the cryptographic criteria
From MaRDI portal
(Redirected from Publication:412332)
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
Cites work
- scientific article; zbMATH DE number 176542 (Why is no real title available?)
- scientific article; zbMATH DE number 3539225 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1303143 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- scientific article; zbMATH DE number 1759329 (Why is no real title available?)
- scientific article; zbMATH DE number 1759799 (Why is no real title available?)
- scientific article; zbMATH DE number 1424156 (Why is no real title available?)
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- A spectral characterization of correlation-immune combining functions
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Fast Software Encryption
- Further constructions of resilient Boolean functions with very high nonlinearity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
- On ``bent functions
- On a Conjecture about Binary Strings Distribution
- On a combinatorial conjecture
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
Cited in
(24)- scientific article; zbMATH DE number 1942443 (Why is no real title available?)
- Cryptographic Boolean functions and applications
- Parameterization of Boolean functions by vectorial functions and associated constructions
- scientific article; zbMATH DE number 2104732 (Why is no real title available?)
- New constructions of resilient functions with strictly almost optimal nonlinearity via non-overlap spectra functions
- Generalized lexicographic multiobjective combinatorial optimization. Application to cryptography
- scientific article; zbMATH DE number 2085194 (Why is no real title available?)
- Approaching Cusick's conjecture on the sum-of-digits function
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- Improved cryptographic properties of Boolean functions obtained from the neighbourhood of Patterson-Wiedemann functions
- A combinatorial condition and Boolean functions with optimal algebraic immunity
- The Tu-Deng conjecture holds almost surely
- Construction of Boolean functions with excellent cryptographic criteria using bivariate polynomial representation
- On Boolean functions with generalized cryptographic properties
- Properties of a family of cryptographic Boolean functions
- scientific article; zbMATH DE number 1866861 (Why is no real title available?)
- Improving the lower bound on the maximum nonlinearity of 1-resilient Boolean functions and designing functions satisfying all cryptographic criteria
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Mathematical methods in solutions of the problems presented at the third international students' olympiad in cryptography
- Recent results on constructing Boolean functions with (potentially) optimal algebraic immunity based on decompositions of finite fields
- The binary digits of n+t
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- A lower bound for Cusick’s conjecture on the digits of n + t
- Almost Security of Cryptographic Boolean Functions
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)
