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

summary

The gist

The gist: The authors provide an explicit family of reduced APN permutations, denoted as Pm,r, and determine their ramification properties over Galois rings and coefficient lifts.

In short

The authors construct an explicit family of reduced APN permutations, $P_{m,r}$, for specific parameters $m imes r$. They analyze their ramification properties over Galois rings and determine how they lift to coefficient rings. This work provides detailed structural insights into these permutations, proving why certain inner maps are not simple monomials.

Key concepts

APN Permutation: An APN permutation is a special type of permutation polynomial where the difference between any two distinct elements in the image set can only take on a limited number of values. These polynomials are important in cryptography and have been studied for their structure over finite fields.
Galois Ring $\mathrm{GR}(2^k,m)$: A Galois ring is an algebraic structure used to study polynomial behavior over rings that are not fields. In this context, $\mathrm{GR}(2^k,m)$ represents a specific ring related to the field size $q=2^m$, allowing the authors to analyze polynomial lifts beyond standard finite fields.
Ramification: Ramification describes how a map behaves when viewed as a cover of the projective line. The paper shows that for $P_{m,r}$, there are specific finite points where the map is highly branched (wild ramification), providing detailed geometric information about the polynomial's structure.
Li-Wang Criterion: This criterion is used to prove structural properties of certain functions, specifically those involving Gold functions and linearised polynomials. The paper uses a self-contained proof of this criterion to explain why the inner map of $P_{m,r}$ cannot be a simple monomial.

Terminology used across episodes

Reinforcement Learning (RL) — explained in 25 episodes
Sample Complexity — explained in 20 episodes
Retrieval-Augmented Generation (RAG) — explained in 19 episodes
Federated Learning — explained in 17 episodes
Flow Matching — explained in 17 episodes
Quantum Fisher Information (QFI) — explained in 16 episodes

This episode discusses

The paper

Explicit reduced APN permutations: ramification and optimal Galois-ring lifts · Read on arXiv

Hiroki Fukui

Research Institute of Criminal Psychiatry / Sex Offender Medical Center · Department of Neuropsychiatry, Kyoto University

Transcript

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: Today's paper: "Explicit reduced APN permutations".

Elias: The gist: The authors provide an explicit family of reduced APN permutations, denoted as Pm,r, and determine their ramification properties over Galois rings and coefficient lifts.

Nadia: First, who's behind it and why it matters.

Paper summary: Nadia: So, wrapping up this discussion on "Explicit reduced APN permutations: ramification and optimal Galois-ring lifts". The authors provided an explicit construction for P m,r based on odd m five and odd r with (r, m) = one <ref:2610.21178#pg1>.

Elias: They gave us the formula using T r, which is a sum of powers of X. It has coefficients in F two and exactly 3r - two terms <ref:2610.21178#pg1,and exactly $3r - 2$ terms>. This construction yields an APN permutation of F q.

Priya: The paper focused heavily on the explicit details: they mapped out the ramification points, noting there are two m-r finite ramification points all wild, with index and different exponent two r-two all over a single finite branch value of one <ref:2610.21178#pg1,there are $2^{m-r}$ finite ramification points all wild, with index>.

Nadia: And they didn't stop there; they connected this construction to the zero/one lift identity in ZX that works over every Galois ring GR(two k, m) for any k two with m-one squarings and r+five additions or subtractions <ref:2610.21178#pg1,and $r+5$ additions or subtractions>.

Elias: It’s also key that they analyzed the differential uniformity for quadratic optimal APN permutations, determining differential rows in specific directions related to the kernel of the linear part of p'.

Priya: The implication is that by providing this explicit family P m,r, we can get precise information about both its ramification and its lifting properties over these rings.

Nadia: For someone just listening, this means we have a concrete tool to study complex polynomial functions in a very specific algebraic setting. It moves the discussion from existence theorems to actual explicit construction and data on how things behave under lifts.

Conclusion: Nadia: So we've seen the technical details on these P m,r polynomials, and now we're wrapping up 'Explicit reduced APN permutations: ramification and optimal Galois-ring lifts'.

Elias: Yeah, it’s about taking these specific APN maps—the quadratic ones—and showing you exactly how they behave when you lift them to these Galois rings.

Priya: So what does that actually mean for the data we're looking at? Is this just another way to count stuff?

Nadia: It means we have a concrete way to predict where the "bad" behavior, like zeros or non-uniformity, is going to show up in these larger algebraic structures.

Elias: Exactly. The authors gave us the explicit ramification data for every single case of m and r. They showed exactly how many points are ramified and what their behavior is like at those points.

Priya: And that maps it to these lifts in GR(two k, m), which sounds a bit abstract. Does this give us any real security insight?

Nadia: It gives us the tools to analyze the structure of the zero/one lift itself. It tells us how many things we need to check—like those r+five additions or subtractions mentioned in the identity they found.

Elias: The authors also proved something important about why these maps aren't just simple monomial functions, which is a structural thing that matters for cryptography and coding theory.

Priya: So, what's the big picture here? What does this specific family of polynomials tell us about the limits of these permutation types?

Nadia: It shows that even with these complex structures, we can get down to the explicit arithmetic rules governing them in a way that works for any size k.

Elias: It confirms that the analysis they did on quadratic optimal maps holds up when you look at coefficient lifts. We still have to figure out how this applies to larger dimensions, though.

More episodes

← Home