On equivalence between known families of quadratic APN functions

Lylia Budaghyan, Marco Calderini, and Irene Villa

Abstract

We study a question whether the currently known families of quadratic APN polynomials are pairwise different up to CCZ-equivalence. We reduce the list of these families to those CCZ-inequivalent to each other. In particular, we prove that the families of APN trinomials (constructed by Budaghyan and Carlet in 2008) and multinomials (constructed by Bracken et al. 2008) are CCZ-equivalent to the APN hexanomial family introduced by Budaghyan and Carlet in 2008. We also prove that a generalization of these trinomial and multinomial families given by Duan et al. (2014) is CCZ-equivalent to the family of hexanomials as well.

Available format(s)
Category
Secret-key cryptography
Publication info
Preprint. Minor revision.
Keywords
CCZ-equivalenceEA-equivalenceAPNBoolean functions
Contact author(s)
marco calderini @ uib no
History
2019-07-15: revised
See all versions
Short URL
https://ia.cr/2019/793

CC BY

BibTeX

@misc{cryptoeprint:2019/793,
author = {Lylia Budaghyan and Marco Calderini and Irene Villa},
title = {On equivalence between known families of quadratic APN functions},
howpublished = {Cryptology ePrint Archive, Paper 2019/793},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/793}},
url = {https://eprint.iacr.org/2019/793}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.