Plateaudness of Kasami APN functions
From MaRDI portal
Recommendations
Cites work
Cited in
(7)- Componentwise APNness, Walsh uniformity of APN functions, and cyclic-additive difference sets
- Almost perfect nonlinear families which are not equivalent to permutations
- Equivalences among plateaued APN functions
- A direct proof of APN-ness of the Kasami functions
- A infinite class of Kasami functions that are not APN infinitely often
- On APN functions whose graphs are maximal Sidon sets
- On lower bounds for the distances between APN functions
This page was built for publication: Plateaudness of Kasami APN functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401954)