A recursive construction of balanced Boolean functions with optimal algebraic immunity
From MaRDI portal
Recommendations
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- Construction of balanced rotation symmetric Boolean functions with optimal algebraic immunity
- Further properties of several classes of Boolean functions with optimum algebraic immunity
- A characterization of balanced Boolean functions with optimal algebraic immunity
Cited in
(10)- Construction of balanced functions without extending their number of variables
- An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity
- Boolean functions optimizing most of the cryptographic criteria
- Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read
- Construction of balanced even-variable Boolean functions with optimal algebraic immunity
- A characterization of balanced Boolean functions with optimal algebraic immunity
- A family of weightwise (almost) perfectly balanced Boolean functions with optimal algebraic immunity
- On the construction of balanced Boolean functions with a good algebraic immunity
- Balanced Boolean functions with optimum algebraic degree, optimum algebraic immunity and very high nonlinearity
- On the Construction of Boolean Functions With Optimal Algebraic Immunity
This page was built for publication: A recursive construction of balanced 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 Q2858303)
