On sum-free functions
From MaRDI portal
Cites work
- A generalization of APN functions for odd characteristic
- A new approach to permutation polynomials over finite fields
- A two-fold generalization of Fermat's theorem.
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- APN functions in odd characteristic
- Bit-Pattern Based Integral Attack
- Boolean functions for cryptography and coding theory
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- scientific article; zbMATH DE number 2089131 (Why is no real title available?)
- scientific article; zbMATH DE number 708833 (Why is no real title available?)
- scientific article; zbMATH DE number 739282 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Improved explicit estimates on the number of solutions of equations over a finite field
- Lectures on finite fields
- New families of almost perfect nonlinear power mappings
- On certain functions connected with polynomials in a Galois field.
- On the vector subspaces of \(\mathbb{F}_{2^n}\) over which the multiplicative inverse function sums to zero
- Perfect nonlinear functions and cryptography
- Perfect nonlinear S-boxes
- Two generalizations of almost perfect nonlinearity
Cited in
(2)
This page was built for publication: On sum-free functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887509)