A class of 1-resilient Boolean functions with optimal algebraic immunity and good behavior against fast algebraic attacks
From MaRDI portal
Publication:2941091
Recommendations
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks
- Construction of 1-resilient Boolean functions with optimal algebraic immunity and good non\-linearity
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- Two constructions of balanced Boolean functions with optimal algebraic immunity, high nonlinearity and good behavior against fast algebraic attacks
Cites work
- A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- On the Resistance of Boolean Functions Against Algebraic Attacks Using Univariate Polynomial Representation
Cited in
(10)- 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
- A construction of 1-resilient Boolean functions with good cryptographic properties
- Maiorana–McFarland Class: Degree Optimization and Algebraic Properties
- Comments on ``A design of Boolean functions resistant to (fast) algebraic cryptanalysis with efficient implementation
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- The Fourier spectral characterization for the correlation-immune functions over \(\mathbb{F}_p \)
- 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
- Construction of resilient and nonlinear Boolean functions with almost perfect immunity to algebraic and fast algebraic attacks
This page was built for publication: A class of 1-resilient Boolean functions with optimal algebraic immunity 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 Q2941091)