Conceptio › Archive › arXiv (All)
arXiv (All) open access

Explicit reduced APN permutations: ramification and optimal Galois-ring lifts

Fukui, Hiroki
arXiv (All) · Papers
Open Source ↗Direct PDF ↓
94a60cryptography-and-securityinformation-theorynumber-theory
Let $m\ge5$ be odd and $q=2^m$. For every odd $r$ with $3\le r<m$ and $\gcd(r,m)=1$ we give the reduced polynomial $P_{m,r}=\mathrm{red}((T_r^3)^{2^{m-2}})$, $T_r=\sum_{i<r}X^{2^i}$, explicitly: it has coefficients in $\mathbb{F}_2$ and exactly $3r-2$ terms, it is an APN permutation of $\mathbb{F}_q
Conceptio Open Archive

Analyze & explore related research in Conceptio

Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.

This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗

Related documents

Record · ID 1356514
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive