A Note on Fast Algebraic Attacks and Higher Order Nonlinearities
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1982616
- Fast Software Encryption
- Results on highly nonlinear Boolean functions with provably good immunity to fast algebraic attacks
- Progress in Cryptology – Mycrypt 2005
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Revised Algorithms for Computing Algebraic Immunity against Algebraic and Fast Algebraic Attacks
- Algebraic attacks on Rasta and Dasta using low-degree equations
Cited in
(15)- On the nonlinearity of Boolean functions with restricted input
- On the higher-order nonlinearity of a Boolean bent function class (constructed via Niho power functions)
- A new lower bound on the second-order nonlinearity of a class of monomial bent functions
- On generalized hyper-bent functions
- Metrical properties of self-dual bent functions
- Improving lower bounds on the second-order nonlinearity of three classes of Boolean functions
- On third-order nonlinearity of biquadratic monomial Boolean functions
- Properties of a family of cryptographic Boolean functions
- Progress in Cryptology – Mycrypt 2005
- Security in Communication Networks
- A lower bound on the third-order nonlinearity of the simplest \(\mathcal{PS}_{a p}\) bent functions
- Revisiting some results on APN and algebraic immune functions
- Boolean function classes with high nonlinearity
- On the higher-order nonlinearity of a new class of biquadratic Maiorana-McFarland type bent functions
- On second-order nonlinearity and maximum algebraic immunity of some bent functions in \(\mathcal{PS}^{+}\)
This page was built for publication: A Note on Fast Algebraic Attacks and Higher Order Nonlinearities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3019943)
