Constructing new APN functions through relative trace functions
Lijing Zheng, Haibin Kan, Yanjun Li, Jie Peng, Deng Tang

TL;DR
This paper introduces a new class of APN functions over finite fields constructed using relative trace functions and quadratic functions, expanding the known families of functions with optimal cryptographic properties.
Contribution
The paper characterizes conditions for APN-ness of functions formed by trace-based combinations of quadratic functions and constructs an infinite family of such APN functions.
Findings
Established a characterization criterion for APN functions of the form involving trace and quadratic functions.
Constructed an infinite family of APN functions over fields with odd m.
Extended the understanding of APN functions beyond previously known polynomial forms.
Abstract
In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, 2020] considered an infinite family of quadrinomials over of the form , where with odd. They proved that such kind of quadrinomials can provide new almost perfect nonlinear (APN) functions when , , and or in which . By taking and , we observe that such kind of quadrinomials can be rewritten as , where and for . Inspired by the quadrinomials and our observation, in this paper we study a class of functions with the form $f(x)=a{\rm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Quantum-Dot Cellular Automata · Algebraic structures and combinatorial models
