Recovering or Testing Extended-Affine Equivalence
Anne Canteaut, Alain Couvreur, L\'eo Perrin

TL;DR
This paper introduces a new efficient algorithm for recovering extended-affine equivalence for quadratic functions, significantly improving over previous methods, and proposes a novel invariant for classifying quadratic APN functions.
Contribution
The paper presents a novel algorithm for EA-recovery of quadratic functions using Jacobian matrices and introduces the ortho-derivative invariant for EA-partitioning of quadratic APN functions.
Findings
The new algorithm outperforms all previous methods in efficiency.
The ortho-derivative invariant effectively distinguishes quadratic APN functions.
The approach is practical for large datasets of quadratic APN functions.
Abstract
Extended Affine (EA) equivalence is the equivalence relation between two vectorial Boolean functions and such that there exist two affine permutations , , and an affine function satisfying . While the problem has a simple formulation, it is very difficult in practice to test whether two functions are EA-equivalent. This problem has two variants: {\em EA-partitioning} deals with partitioning a set of functions into disjoint EA-equivalence classes, and \emph{EA-recovery} is about recovering the tuple if it exists. In this paper, we present a new algorithm that efficiently solves the EA-recovery problem for quadratic functions. Although its worst-case complexity occurs when dealing with APN functions, it supersedes, in terms of performance, all previously known algorithms for solving this problem for all quadratic functions and in…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Cryptographic Implementations and Security · Quantum-Dot Cellular Automata
