Almost perfect nonlinear families which are not equivalent to permutations
From MaRDI portal
Publication:1994921
DOI10.1016/j.ffa.2020.101707zbMath1459.94112OpenAlexW3042156905MaRDI QIDQ1994921
Faruk Göloğlu, Philippe Langevin
Publication date: 18 February 2021
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2020.101707
Permutations, words, matrices (05A05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)
Related Items (2)
On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations ⋮ Kim-type APN functions are affine equivalent to Gold functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New cyclic difference sets with Singer parameters
- Almost perfect and planar functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Equivalences of quadratic APN functions
- On subsets of GF\((q^2)\) with \(d\)th power differences
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Plateaudness of Kasami APN functions
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Perfect nonlinear S-boxes
- Explicit evaluation of certain exponential sums.
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
This page was built for publication: Almost perfect nonlinear families which are not equivalent to permutations