On the equivalence of quadratic APN functions

From MaRDI portal
Publication:648066

DOI10.1007/S10623-010-9475-8zbMATH Open1250.11101arXiv1101.1508OpenAlexW2009514860MaRDI QIDQ648066FDOQ648066


Authors: Carl Bracken, Eimear Byrne, Gary McGuire, Gabriele Nebe Edit this on Wikidata


Publication date: 22 November 2011

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Establishing the CCZ-equivalence of a pair of APN functions is generally quite difficult. In some cases, when seeking to show that a putative new infinite family of APN functions is CCZ inequivalent to an already known family, we rely on computer calculation for small values of n. In this paper we present a method to prove the inequivalence of quadratic APN functions with the Gold functions. Our main result is that a quadratic function is CCZ-equivalent to an APN Gold function if and only if it is EA-equivalent to that Gold function. As an application of this result, we prove that a trinomial family of APN functions that exist on finite fields of order 2^n where n = 2 mod 4 are CCZ inequivalent to the Gold functions. The proof relies on some knowledge of the automorphism group of a code associated with such a function.


Full work available at URL: https://arxiv.org/abs/1101.1508




Recommendations




Cites Work


Cited In (29)





This page was built for publication: On the equivalence of quadratic APN functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q648066)