On non-monomial APcN permutations over finite fields of even characteristic (2205.11418v3)
Abstract: Recently, a new concept called the $c$-differential uniformity was proposed by Ellingsen et al. (2020), which allows to simplify some types of differential cryptanalysis. Since then, finding functions having low $c$-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 $c$-differential uniformity. In this paper, we propose new classes of almost perfect $c$-nonlinear non-monomial permutations over a binary field.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.