cronokirby

(2026-08) Degree-Sum-Freedom Is Not EA Invariant; Exact Profiles in a 4-Uniform Permutation Family

2026-08-12

Abstract

Degree-sum-freedom is a local criterion for division-property propagation from affine input spaces. The published version states that this criterion is invariant under extended-affine (EA) equivalence. We show that this assertion does not hold beyond ordinary sum-freedom and quantify the resulting variation. First, the natural Gold APN pair x3x^3 and x3+xx^3+x has exact proper-flat values 3 and 2 on an infinite sequence of dimensions. We then study a known complete-mapping family of EA-equivalent, differentially 4-uniform permutations Fb,GbF_b,G_b on 2r2r bits. For every odd rr and every 1c(r3)/21\le c\le\lfloor(r-3)/2\rfloor, we determine their exact codimension-cc profiles: μc(Fb)=2c\mu_c(F_b)=2c and μc(Gb)=r+c1\mu_c(G_b)=r+c-1, equivalently τ2rc(Fb)=2r2c\tau_{2r-c}(F_b)=2r-2c and τ2rc(Gb)=rc+1\tau_{2r-c}(G_b)=r-c+1. Thus the gap is rc1(r+1)/2r-c-1\ge(r+1)/2 simultaneously over a linear-size range of proper affine codimensions. The mate upper bound follows by specializing known generalized-degree duality with the exact source profile established here. The matching uniform lower bound is family-specific: after an associated-graded reduction, odd codimensions are detected by one classical consecutive Moore determinant, whereas even codimensions require a jointly nonvanishing family of replacement minors. A cyclic carry classification proves that the selected coefficients are complete reduced coefficients. These results concern local affine-input division-property behavior; they do not yield a multiround distinguisher or an attack on a concrete cipher.