On the equivalence of quadratic APN functions
DOI10.1007/S10623-010-9475-8zbMath1250.11101arXiv1101.1508OpenAlexW2009514860MaRDI QIDQ648066
Gary McGuire, Carl Bracken, Eimear Byrne, Gabriele Nebe
Publication date: 22 November 2011
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1101.1508
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New families of quadratic almost perfect nonlinear trinomials and multinomials
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- On the automorphism groups of affine-invariant codes
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
This page was built for publication: On the equivalence of quadratic APN functions