期刊论文

Peng, Jie(jpeng@shnu.edu.cn)

英文

Cryptography and Communications

1936-2447

2023

15

2

351-363

10.1007/s12095-022-00606-2

This work was supported in part by the National Natural Science Foundation of China under Grant 61972258 and by the Scientific Research Fund of Hunan Provincial Education Department under Grant 19B485.

本校为其他机构

Finding new (up to CCZ-equivalence) constructions of APN functions is one of the important but difficult topics in the study of cryptographic functions. Up to now, only 6 infinite families of power APN functions and 14 infinite families of APN polynomials are known. Although the CCZ-equivalence between power APN functions has been completely characterized, a similar theoretical analysis between polynomial APN functions and power APN functions is still missing. In this paper we prove that, in dimension not multiple of 3, a recently introduced fa...