Upper Bounds on Algebraic Immunity of Boolean Power Functions
From MaRDI portal
Recommendations
- Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
- On computing the immunity of Boolean power functions against fast algebraic attacks
- Fast algebraic immunity of Boolean functions
- On the Algebraic Immunity of Symmetric Boolean Functions
- Fast Software Encryption
Cited in
(14)- Upper bound for algebraic immunity on a subclass of Maiorana McFarland class of bent functions
- A simple stream cipher with proven properties
- On extended algebraic immunity
- Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n
- Fast algebraic immunity of Boolean functions
- On algebraic immunity of trace inverse functions on finite fields of characteristic two
- On the lower block triangular nature of the incidence matrices to compute the algebraic immunity of Boolean functions
- On computing the immunity of Boolean power functions against fast algebraic attacks
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity
- Sequences, DFT and Resistance against Fast Algebraic Attacks
- Algebraic immunity of bent functions of the Dillon class
- Efficient Computation of Algebraic Immunity of Symmetric Boolean Functions
- Some lower bounds on the algebraic immunity of functions given by their trace forms
This page was built for publication: Upper Bounds on Algebraic Immunity of Boolean Power Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3618665)
