2000 character limit reached
Functions which are PN on infiitely many extensions of Fp, p odd
Published 14 Jun 2010 in math.NT, cs.IT, and math.IT | (1006.2610v2)
Abstract: Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $xm$ is perfectly nonlinear over $\mathbb{F}_{pn}$ for infinitely many $n$ if and only if $m$ is of the form $pl+1$, $l\in\mathbb{N}$. First, we study singularities of $f(x,y)=\frac{(x+1)m-xm-(y+1)m+ym}{x-y}$ and we use Bezout theorem to show that for $m\neq 1+pl$, $f(x,y)$ has an absolutely irreducible factor. Then by Weil theorem, f(x,y) has rationnal points such that $x\neq y$ which means that $xm$ is not PN.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.