Trace Monomial Boolean Functions with Large High-Order Nonlinearities

TL;DR

This paper establishes new lower bounds on the high-order nonlinearities of specific trace monomial Boolean functions, advancing understanding of their cryptographic strength and explicit constructions.

Contribution

It provides the first tight lower bounds for high-order nonlinearities of certain trace monomials, improving previous results and offering explicit functions with strong cryptographic properties.

Findings

Lower bounds on second-order nonlinearities match best known results.

Established the best third-order nonlinearity lower bound.

Derived near-optimal bounds for r-th order nonlinearity of specific trace functions.

Abstract

Exhibiting an explicit Boolean function with a large high-order nonlinearity is an important problem in cryptography, coding theory, and computational complexity. We prove lower bounds on the second-order, third-order, and higher-order nonlinearities of some trace monomial Boolean functions. We prove lower bounds on the second-order nonlinearities of functions $\mathrm{tr}_n(x^7)$ and $\mathrm{tr}_n(x^{2^r+3})$ where $n=2r$. Among all trace monomials, our bounds match the best second-order nonlinearity lower bounds by \cite{Car08} and \cite{YT20} for odd and even $n$ respectively. We prove a lower bound on the third-order nonlinearity for functions $\mathrm{tr}_n(x^{15})$, which is the best third-order nonlinearity lower bound. For any $r$, we prove that the $r$-th order nonlinearity of $\mathrm{tr}_n(x^{2^{r+1}-1})$ is at least $2^{n-1}-2^{(1-2^{-r})n+\frac{r}{2^{r-1}}-1}- O(2^{\frac{n}{2}})$. For $r \ll \log_2 n$, this is the best lower bound among all explicit functions.