A Further Study of Quadratic APN Permutations in Dimension Nine
Christof Beierle, Claude Carlet, Gregor Leander, L\'eo Perrin

TL;DR
This paper studies quadratic APN permutations in dimension nine, providing a unified representation, analyzing their cryptographic properties, and exploring their equivalence classes, revealing new insights into their structure and limitations.
Contribution
It introduces a unified trivariate representation of known APN permutations, analyzes their differential uniformity and nonlinearity, and investigates their equivalence classes and structural similarities.
Findings
Differential uniformity of C_u is bounded above by 8 for certain parameters.
Linearity of C_u is bounded above by 8^{1+⌊m/2⌋} under specified conditions.
Conjecture that C_u is not APN for m > 3 based on numerical experiments.
Abstract
Recently, Beierle and Leander found two new sporadic quadratic APN permutations in dimension 9. Up to EA-equivalence, we present a single trivariate representation of those two permutations as , where and such that the two permutations correspond to different choices of . We then analyze the differential uniformity and the nonlinearity of in a more general case. In particular, for being a multiple of 3 and not being a 7-th power, we show that the differential uniformity of is bounded above by 8, and that the linearity of is bounded above by . Based on numerical experiments, we conjecture that is not APN if is greater than .…
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.
