Paper constructs new APN functions with boomerang uniformity one
The constructions are CCZ-inequivalent to listed APN monomial and Ness-Helleseth binomial families for q greater than 7.
Stories per day · 30 days
1 RSS
Relatedcryptography3aes1apn1apn-functions1aria1boomerang-uniformity1ccz-equivalence1differential-uniformity1discrete-logarithm1galois-rings1list-decoding1permutations1polynomials1s-boxes1symmetric-cryptography1
7 stories, newest first · one card per story
Stories tagged #finite-fields
New bounds limit polynomial approximations of the discrete logarithm
The degree-at-most-D agreement set is at most (1+o(1)) times the square root of Dp, and linear polynomials fall to O(p to the 2/5).
Paper bounds leftover linear self-symmetries of inverse-based S-boxes
The leading decay depends on the smallest prime divisor of the extension degree, and the full AES S-box has none.
Explicit reduced APN permutations: ramification and optimal Galois-ring lifts
Paper constructs explicit reduced APN permutations and describes their optimal Galois-ring lifts.
Explicit Nonlinear Functions beyond the Fourier bound
Cryptographers construct explicit highly nonlinear maps over finite fields that beat the classical Fourier agreement bound.
The planted tensor problem over finite fields: algorithms and cryptography
A planted totally-isotropic tensor problem over finite fields yields crypto protocols with smaller public data.
On APN Functions with Boomerang Uniformity One over $\mathbb F_{3^n}$: Differential and Boomerang Spectra and CCZ-Inequivalence
Cryptographic construction yields infinite APN function families with boomerang uniformity one over odd-characteristic fields, proving CCZ-inequivalence to power functions.