Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
From MaRDI portal
(Redirected from Publication:498981)
Recommendations
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
Cites work
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 2009966 (Why is no real title available?)
- A Method of Construction of Balanced Functions with Optimum Algebraic Immunity
- A New Attack on the Filter Generator
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 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
- Coding and Cryptography
- Comments on "Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Constructing Symmetric Boolean Functions With Maximum Algebraic Immunity
- Construction and Analysis of Boolean Functions of 2t+1 Variables with Maximum Algebraic Immunity
- Constructions of Cryptographically Significant Boolean Functions Using Primitive Polynomials
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Fast Software Encryption
- Fast Software Encryption
- Fast correlation attacks on certain stream ciphers
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- Highly Nonlinear Boolean Functions With Optimal Algebraic Immunity and Good Behavior Against Fast Algebraic Attacks
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- On the Algebraic Immunity of Symmetric Boolean Functions
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- Perfect algebraic immune functions
- The stability theory of stream ciphers
Cited in
(24)- Perfect algebraic immune functions
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Construction of Highly Nonlinear 1-Resilient Boolean Functions with Optimal Algebraic Immunity and Provably High Fast Algebraic Immunity
- On the security of the Feng-Liao-Yang Boolean functions with optimal algebraic immunity against fast algebraic attacks
- New constructions of balanced Boolean functions with high nonlinearity and optimal algebraic degree
- A construction of 1-resilient Boolean functions with good cryptographic properties
- A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks
- 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
- Constructing even-variable RSBFs with higher nonlinearity, optimal AI and almost optimal FAI
- Constructing \(2m\)-variable Boolean functions with optimal algebraic immunity based on polar decomposition of \(\mathbb{F}^*_{2^{2m}}\)
- Boolean functions with maximum algebraic immunity: further extensions of the Carlet-Feng construction
- A survey on nonlinear Boolean functions with optimal algebraic immunity suitable for stream ciphers
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- Constructing odd variable Boolean functions with optimal algebraic immunity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- 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
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- The estimates of trigonometric sums and new bounds on a mean value, a sequence and a cryptographic function
- A construction of highly nonlinear Boolean functions with optimal algebraic immunity and low hardware implementation cost
- Balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
- Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks
This page was built for publication: Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498981)
