vix.ing · top · new · best · stats · spec

A Degree Bound for the c-Boomerang Uniformity

2025/10/21 by Steiner, Matthias Johann
#11T06 #14G50 #14H50 #94A60 #Algebraic Geometry (math.AG) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2510.18506

Abstract

Let \mathbbFq be a finite field, and let F ∈ \mathbbFq [X] be a polynomial with d = deg ( F ) such that gcd ( d, q ) = 1. In this paper we prove that the c-Boomerang uniformity, c ≠ 0, of F is bounded by - d2 if c2 ≠ 1, - d ⋅ (d - 1) if c = -1, - d ⋅ (d - 2) if c = 1. For all cases of c, we present tight examples for F ∈ \mathbbFq [X]. Additionally, for the proof of c = 1 we establish that the bivariate polynomial F (x) - F (y) + a ∈ k [x, y], where k is a field of characteristic p and a ∈ k ∖ \ 0 \, is absolutely irreducible if p \nmid deg ( F ).

Citations

Related