English

Functions which are PN on infiitely many extensions of Fp, p odd

Number Theory 2012-05-04 v2 Information Theory math.IT

Abstract

Let pp be an odd prime number. We prove that for m1modpm\equiv1\mod p, xmx^m is perfectly nonlinear over Fpn\mathbb{F}_{p^n} for infinitely many nn if and only if mm is of the form pl+1p^l+1, lNl\in\mathbb{N}. First, we study singularities of f(x,y)=(x+1)mxm(y+1)m+ymxyf(x,y)=\frac{(x+1)^m-x^m-(y+1)^m+y^m}{x-y} and we use Bezout theorem to show that for m1+plm\neq 1+p^l, f(x,y)f(x,y) has an absolutely irreducible factor. Then by Weil theorem, f(x,y) has rationnal points such that xyx\neq y which means that xmx^m is not PN.

Keywords

Cite

@article{arxiv.1006.2610,
  title  = {Functions which are PN on infiitely many extensions of Fp, p odd},
  author = {Elodie Leducq},
  journal= {arXiv preprint arXiv:1006.2610},
  year   = {2012}
}