The abstract announces an explicit construction of reduced polynomials P_{m,r} for APN permutations. The setting is the finite field of q=2^m elements with m odd and at least 5. For each odd r between 3 and m that is coprime to m, the polynomial is obtained by reducing (T_r^3)^{2^{m-2}}, where T_r is the sum X + X^2 + ... + X^{2^{r-1}}.

Because the source is a single abstract, there is no comparison with earlier constructions to summarize. The main point is that the polynomials are given explicitly, and the paper goes beyond the field-level APN property: it also treats ramification and optimal Galois-ring lifts. Those lifts matter for constructing permutations over Galois rings that reduce to the APN permutations over the binary field.