On non-monomial APcN permutations over finite fields of even characteristic
Information Theory
2022-06-27 v3 Cryptography and Security
math.IT
Abstract
Recently, a new concept called the -differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low -differential uniformity has attracted the attention of many researchers. However it seems that, at this moment, there are not many non-monomial permutations having low -differential uniformity. In this paper, we propose new classes of almost perfect -nonlinear non-monomial permutations over a binary field.
Keywords
Cite
@article{arxiv.2205.11418,
title = {On non-monomial APcN permutations over finite fields of even characteristic},
author = {Jaeseong Jeong and Namhun Koo and Soonhak Kwon},
journal= {arXiv preprint arXiv:2205.11418},
year = {2022}
}
Comments
We made a revised version, where Sec 4 was revised as follows: G_alp(x) is newly introduced and Theorem 4.12 is added