Commutative Presemifields and Semifields

From Boolean

Background

For a prime p and a positive integer n let 𝔽pn be the finite field with pn elements. Let F be a map from the finite field to itself. Such function admits a unique representation as a polynomial of degree at most pnβˆ’1, i.e.

F(x)=βˆ‘j=0pnβˆ’1ajxj,ajβˆˆπ”½pn.

The function F is

  • linear if F(x)=βˆ‘j=0nβˆ’1ajxpj,
  • affine if it is the sum of a linear function and a constant,
  • DO (Dembowski-Ostrim) polynomial if F(x)=βˆ‘0≀i≀j<naijxpi+pj,
  • quadratic if it is the sum of a DO polynomial and an affine function.

For Ξ΄ a positive integer, the function F is called differentially Ξ΄-uniform if for any pairs a,bβˆˆπ”½pn, with aβ‰ 0, the equation F(x+a)βˆ’F(x)=b admits at most Ξ΄ solutions.

A function F is called planar or perfect nonlinear (PN) if Ξ΄F=1. Obviously such functions exist only for p an odd prime. In the even case the smallest possible case for Ξ΄ is two (APN function).

For planar function we have that the all the nonzero derivatives, DaF(x)=F(x+a)βˆ’F(x), are permutations.

Equivalence Relations

Two functions F and F′ from 𝔽pn to itself are called:

  • affine equivalent if F′=A1∘F∘A2, where A1,A2 are affine permutations;
  • EA-equivalent (extended-affine) if F′=F″+A, where A is affine and F″ is afffine equivalent to F;
  • CCZ-equivalent if there exists an affine permutation β„’ of 𝔽pn×𝔽pn such that β„’(GF)=GF′, where GF={(x,F(x)):xβˆˆπ”½pn}.

CCZ-equivalence is the most general known equivalence relation for functions which preserves differential uniformity. Affine and EA-equivalence are its particular cases. For the case of quadratic planar functions the isotopic equivalence is more general than CCZ-equivalence, where two maps are isotopic equivalent if the corresponding presemifields are isotopic.

On Presemifields and Semifields

A presemifield is a ring with left and right distributivity and with no zero divisor. A presemifield with a multiplicative identity is called a semifield. Any finite presemifield can be represented by π•Š=(𝔽pn,+,⋆), for p a prime, n a positive integer, π•Š=(𝔽pn,+) additive group and x⋆y multiplication linear in each variable. Every commutative presemifield can be transformed into a commutative semifield[1].

Two presemifields π•Š1=(𝔽pn,+,⋆) and π•Š2=(𝔽pn,+,∘) are called isotopic if there exist three linear permutations T,M,N of 𝔽pn such that T(x⋆y)=M(x)∘N(y), for any x,yβˆˆπ”½pn. If M=N then they are called strongly isotopic. Each commutative presemifields of odd order defines a planar DO polynomial and viceversa:

  • given π•Š=(𝔽pn,+,⋆) let Fπ•Š(x)=12(x⋆x);
  • given F let π•ŠF=(𝔽pn,+,⋆) defined by x⋆y=F(x+y)βˆ’F(x)βˆ’F(y).

Given π•Š=(𝔽pn,+,⋆) a finite semifield, the subsets

Nl(π•Š)={Ξ±βˆˆπ•Š:(α⋆x)⋆y=α⋆(x⋆y) for all x,yβˆˆπ•Š}

Nm(π•Š)={Ξ±βˆˆπ•Š:(x⋆α)⋆y=x⋆(α⋆y) for all x,yβˆˆπ•Š}

Nr(π•Š)={Ξ±βˆˆπ•Š:(x⋆y)⋆α=x⋆(y⋆α) for all x,yβˆˆπ•Š}

are called left, middle and right nucleus of π•Š.

The set N(π•Š)=Nl(π•Š)∩Nm(π•Š)∩Nr(π•Š) is called the nucleus. All these sets are finite field and, when π•Š is commutative, Nl(π•Š)=Nr(π•Š)βŠ†Nm(π•Š). The order of the different nuclei are invariant under isotopism.

Properties

Hence two quadratic planar functions F,F′ are isotopic equivalent if their corresponding presemifields are isotopic. Moreover, we have:

  • F,F′ are CCZ-equivalent if and only if the corresponding presemifileds are strongly isotopic[2];
  • for n odd, isotopic coincides with strongly isotopic;
  • if F,F′ are isotopic equivalent, then there exists a linear map L such that F′ is EA-equivalent to F(x+L(x))βˆ’F(x)βˆ’F(L(x));
  • any commutative presemifield of odd order can generate at most two CCZ-equivalence classes of planar DO polynomials;
  • if π•Š1 and π•Š2 are isotopic commutative semifields of characteristic p with order of middle nuclei and nuclei pm and pk respectively, then either one of the following is satisfied:
    • m/k is odd and the semifields are strongly isotopic,
    • m/k is even and the semifields are strongly isotopic or the only isotopisms are of the form (α⋆N,N,L) with α∈Nm(π•Š1) non-square.

Known cases of planar functions and commutative semifields

Among the known example of planar functions, the only ones that are non-quadratic are the power functions x3t+12 defined over 𝔽3n, with t is odd and gcd(t,n)=1.

In the following the list of some known infinite families of planar functions (and corresponding commutative semifields):

  • x2 over 𝔽pn (finite field 𝔽pn);
  • xpt+1 over 𝔽pn with n/gcd(t,n) odd (Albert's commutative twisted fields);
  • L(t2(x))+12x2 over 𝔽p2km with L(x)=18(xpkβˆ’x),t(x)=xpkmβˆ’x (Dickson semifields);
    • (ax)ps+1βˆ’(ax)pk(ps+1)+xpk+1
    • bxps+1+(bxps+1)pk+cxpk+1

over 𝔽p2k where a,bβˆˆπ”½22k⋆,b not square, cβˆˆπ”½22kβˆ–π”½2k,gcd(k+s,2k)=gcd(k+s,k) and for the first one also gcd(ps+1,pk+1)β‰ gcd(ps+1,(pk+1)/2). Without loss of generality it is possible to take a=1 and fix a value for c;

  • xps+1βˆ’aptβˆ’1xpt+p2t+s over 𝔽p3t,a primitive, gcd(3,t)=1,tβˆ’s≑0 mod 3,3t/gcd(s,3t) odd;
  • xps+1βˆ’aptβˆ’1xp3t+pt+s over 𝔽p4t,a primitive, ps≑pt≑1 mod 4, 2t/gcd(s,2t) odd;
  • a1βˆ’px2+x2pm+a1βˆ’pT(x)βˆ’T(x)pm, with T(x)=βˆ‘i=0k(βˆ’1)ixp2i(p2+1)+apβˆ’1βˆ‘j=0kβˆ’1(βˆ’1)k+jxp2j+1(p2+1), over 𝔽p2m for aβˆˆπ”½p2⋆,m=2k+1.

Cases defined for p=3

  • x10Β±x6βˆ’x2 over π”½pn with n odd (Coulter-Matthews and Ding-Yuan semifields);
  • L(t2(x))+D(t(x))+12x2, over π”½32k with k odd, t(x)=x3kβˆ’x,Ξ²βˆˆπ”½32kβˆ–π”½3k,Ξ±=t(Ξ²),L(x)=Ξ±βˆ’5x3+x,D(x)=βˆ’Ξ±βˆ’10x10 (Ganley semifields);
  • L(t2(x))+12x2, over π”½32k with k odd, t(x)=x3kβˆ’x,Ξ²βˆˆπ”½32kβˆ–π”½3k,Ξ±=t(Ξ²),L(x)=βˆ’x9βˆ’Ξ±x3+(1βˆ’Ξ±4)x (Cohen-Ganley semifileds);
  • L(t2(x))+12x2, over π”½310 with t(x)=x243βˆ’x,Ξ²βˆˆπ”½310βˆ–π”½35,Ξ±=t(Ξ²),L(x)=βˆ’(Ξ±βˆ’53x27+Ξ±βˆ’18x9βˆ’x) (Penttila-Williams semifileds);
  • L(t2(x))+D(t(x))+12x2, over π”½38 with t(x)=x9βˆ’x,L(x)=x243+x9,D(x)=x246+x82βˆ’x10 (Coulter-Henderson-Kosick semifield);
  • x2+x90 over π”½35.


Known cases of APN functions in odd characteristic

  • x3 over 𝔽pn, pβ‰ 3;
  • xpnβˆ’2 over 𝔽pn with pn≑2(mod3);
  • xpnβˆ’32 over 𝔽pn with pn≑3,7(mod20),pn>7,pnβ‰ 27,n odd;
  • xpn+14+pnβˆ’12 over 𝔽pn with pn≑3(mod8);
  • xpn+14 over 𝔽pn with pn≑7(mod8),n>1;
  • x2pnβˆ’13 over 𝔽pn with pn≑2(mod3);
  • xpm+2 over 𝔽pn with pm≑1(mod3),n=2m;
  • x3nβˆ’3 over 𝔽3n with n>1 odd;
  • x3n+12βˆ’12 over 𝔽3n with n≑3(mod4),n>3;
  • x3n+12βˆ’12+3nβˆ’12 over 𝔽3n with n≑1(mod4),n>1;
  • x3n+1βˆ’18 over 𝔽3n with n≑3(mod4);
  • x3n+1βˆ’18+3nβˆ’14 over 𝔽3n with n≑1(mod4);
  • x3n+1βˆ’13L+1 over 𝔽3n, where L=n+12β„“ with nβ‰‘βˆ’1(mod2β„“);
  • x5β„“+12 over 𝔽5n with gcd⁡(2n,β„“)=1;
  • x5nβˆ’14+5n+12βˆ’12 over 𝔽5n with n odd;
  • x5n+1βˆ’12(5L+1)+5nβˆ’14 over 𝔽5n, where L=n+12β„“,nβ‰‘βˆ’1(mod2β„“) and β„“β‰₯2;
  1. ↑ Coulter R. S., Henderson M. Commutative presemifields and semifields. Advances in Math. 217, pp. 282-304, 2008
  2. ↑ Budaghyan L., Helleseth T. On Isotopism of Commutative Presemifields and CCZ-Equivalence of Functions. Special Issue on Cryptography of International Journal of Foundations of Computer Science, v. 22/6), pp- 1243-1258, 2011