Metraipolis › archive › dc_bcb3216ffa40

Optimal Reduced Representatives of Quadratic APN Permutations in Odd Dimension — arXiv:2610.21169

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21169
License (as archived)
CC0-1.0
Archived
2026-10-16T10:19:25.119Z
SHA-256 of the archived text
f1802c7dc8496bebefda397522eb9450e570870610e1ef31a3263b1073dacb56
Stable URL of this page
https://metraipolis.com/documento/dc_bcb3216ffa40

How to cite

Optimal Reduced Representatives of Quadratic APN Permutations in Odd Dimension — arXiv:2610.21169 — arXiv (en), https://arxiv.org/abs/2610.21169 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bcb3216ffa40 (Metraipolis archive dc_bcb3216ffa40, sha256 f1802c7dc8496bebefda397522eb9450e570870610e1ef31a3263b1073dacb56)
BibTeX
@misc{dcbcb3216ffa40,
  title = {Optimal Reduced Representatives of Quadratic APN Permutations in Odd Dimension — arXiv:2610.21169},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21169},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bcb3216ffa40; sha256 f1802c7dc8496bebefda397522eb9450e570870610e1ef31a3263b1073dacb56},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21169. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The formal derivative of the reduced polynomial representative of a map on a binary finite field depends on the coordinates, although its differential uniformity does not. This matters for lifting permutations to Galois rings: a polynomial over a Galois ring of characteristic a power of two greater than two permutes the ring exactly when its reduction permutes the residue field and the derivative of the reduction has no zero there. We prove that for every odd $n\ge5$, every quadratic almost perfect nonlinear permutation $Q$ of $\mathbb{F}_{2^n}$ admits invertible binary-linear maps $L$ and $A$ such that the derivative of the reduced representative of $L\circ Q\circ A$ has no zero and each of its nonempty fibres has exactly two elements. The range is exact: this fails for $n=3$, as computed earlier, and for even $n$ there are no such permutations. For $n\ge9$, a linearization and a projectively injective cofactor map reduce the problem to counting binary matrices: more than 5% of the invertible inputs $A$ succeed, more than half for $n\ge15$, without any classification. For $n=5,7$ we use two independent classifications and finite certificates. Consequently every such permutation is linearly equivalent to a counterexample to the reduced critical-point conjecture of Bartoli and Stănică that lifts to permutation polynomials of optimal differential uniformity over every Galois ring with this residue field. For odd $n\ge9$ the existence proof is checked in the Lean 4 proof assistant.

Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Number Theory (math.NT) ; Cryptography and Security (cs.CR); Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.21169 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:47:32.622Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).