On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles...
Transcript of On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles...
![Page 1: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/1.jpg)
On the Cycles Structure ofPermutations Induced by the
Perfect Nonlinear Functions overFinite Fields
Hassan Aly and Rasha Shaheen
Department of Mathematics,
Faculty of Science,
Cairo University,
Giza 12613, Egypt
– p. 1/31
![Page 2: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/2.jpg)
DefinitionsThroughout this talkFq is the finite field of orderq = pm wherep is an odd prime andm is a positiveinteger.
Definition 1 A functionf : Fq → Fq is said to beperfect nonlinear function, or shortly PNF, if
δ(x, a) = f(x + a) − f(x) − f(a)
is a permutation overFq for everya ∈ F∗q.
Sometimes we callδ(x, a) as the difference functionof f .
– p. 2/31
![Page 3: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/3.jpg)
Definitions
Perfect Nonlinear Functions are used in differentapplications in
1. Cryptography
2. Coding
3. Finite Geometry, and
4. Combinatorial design
– p. 3/31
![Page 4: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/4.jpg)
Some perfect nonlinear func-tions
1. f1(x) = x2 overFpm,
– p. 4/31
![Page 5: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/5.jpg)
Some perfect nonlinear func-tions
1. f1(x) = x2 overFpm,
2. f2(x) = xpk+1 overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
– p. 4/31
![Page 6: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/6.jpg)
Some perfect nonlinear func-tions
1. f1(x) = x2 overFpm,
2. f2(x) = xpk+1 overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
3. f3(x) = x10 − x6 − x2 overF3m where
m ≥ 5 is odd,
– p. 4/31
![Page 7: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/7.jpg)
Some perfect nonlinear func-tions
1. f1(x) = x2 overFpm,
2. f2(x) = xpk+1 overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
3. f3(x) = x10 − x6 − x2 overF3m where
m ≥ 5 is odd,
4. f4(x) = x10 + x6 − x2 overF3m where
m ≥ 5 is odd.
– p. 4/31
![Page 8: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/8.jpg)
The diference functions1. δ1(x, a) = 2ax overFpm,
– p. 5/31
![Page 9: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/9.jpg)
The diference functions1. δ1(x, a) = 2ax overFpm,
2. δ2(x, a) = axpk+ apk
x overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
– p. 5/31
![Page 10: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/10.jpg)
The diference functions1. δ1(x, a) = 2ax overFpm,
2. δ2(x, a) = axpk+ apk
x overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
3. δ3(x, a) = ax9 + a3x3 + (a9 + a)x over
F3m wherem ≥ 5 is odd,
– p. 5/31
![Page 11: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/11.jpg)
The diference functions1. δ1(x, a) = 2ax overFpm,
2. δ2(x, a) = axpk+ apk
x overFpm where
m/gcd(m, k) is odd andk ≤ m/2,
3. δ3(x, a) = ax9 + a3x3 + (a9 + a)x over
F3m wherem ≥ 5 is odd,
4. δ4(x, a) = ax9 − a3x3 + (a9 + a)x over
F3m wherem ≥ 5 is odd.
– p. 5/31
![Page 12: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/12.jpg)
ObjectivesThis talk is about some properties of the differencepermutationsδ1, δ2, δ3, andδ4. We will
1. count the number of fixed points of thesepermutations.
– p. 6/31
![Page 13: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/13.jpg)
ObjectivesThis talk is about some properties of the differencepermutationsδ1, δ2, δ3, andδ4. We will
1. count the number of fixed points of thesepermutations.
2. count the number of cycles of each permutationand their lengthes for values ofa in the primefinite field.
– p. 6/31
![Page 14: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/14.jpg)
ObjectivesThis talk is about some properties of the differencepermutationsδ1, δ2, δ3, andδ4. We will
1. count the number of fixed points of thesepermutations.
2. count the number of cycles of each permutationand their lengthes for values ofa in the primefinite field.
3. discuss cases have the same number of cycles ofthe same lengthes.
– p. 6/31
![Page 15: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/15.jpg)
ObjectivesThis talk is about some properties of the differencepermutationsδ1, δ2, δ3, andδ4. We will
1. count the number of fixed points of thesepermutations.
2. count the number of cycles of each permutationand their lengthes for values ofa in the primefinite field.
3. discuss cases have the same number of cycles ofthe same lengthes.
4. introduce some notes on other PNF and furtherwork in this direction.
– p. 6/31
![Page 16: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/16.jpg)
Fixed PointsA fixed point of a permutationπ(x) overFq is a pointc in Fq such thatπ(c) = c. It is easy to see that thepermutationδ1(x, a) = 2ax has
Fix(δ1(x, a)) =
{
q : if a = 12
1 : otherwise
– p. 7/31
![Page 17: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/17.jpg)
Fixed PointsTheorem 2 The number of fixed points of thepermutationsδ2(x, a) = axpk
+ apk
x for a ∈ F∗q is
given by
Fix(δ2(x, a)) =
{
pd : if (pk − 1)|j
1 : otherwise
whered = gcd(k, m), andj is the unique integer suchthat0 ≤ j ≤ q − 2 andr = ωj with ω a primitive
element ofFq andr = 1−apk
a .
– p. 8/31
![Page 18: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/18.jpg)
ProofThe assertion is obvious fora = 1. Fora 6= 1, wehave
axpk
+ (apk
− 1)x = 0.
It is obvious thatx = 0 is a solution of the aboveequation. Forx 6= 0 the above equation becomes
xpk−1 = r, wherer = 1−apk
a 6= 0. If ω is a primitiveelement ofFq andr = wj for somej, 0 ≤ j ≤ q − 2,
then we havewi(pk−1) = wj which implies thati(pk − 1) ≡ j mod (q − 1), which has exactlygcd(pk − 1, pm − 1) = pgcd(k,m) − 1 solutions if andonly if pk − 1 dividesj.
– p. 9/31
![Page 19: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/19.jpg)
Fixed PointsThe number of fixed points of the permutationsδ3(x, a) = ax9 + a3x3 + (a9 + a)x for a ∈ F
∗q is given
by
Fix(δ2(x, a)) =
1 :
3 :
9 :
depending on the number of solutions of the equationax9 + a3x3 + (a9 + a − 1)x = 0.
– p. 10/31
![Page 20: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/20.jpg)
Fixed PointsThe number of fixed points of the permutationsδ3(x, a) = ax9 − a3x3 + (a9 + a)x for a ∈ F
∗q is given
by
Fix(δ2(x, a)) =
1 :
3 :
9 :
depending on the number of solutions of the equationax9 − a3x3 + (a9 + a − 1)x = 0.
– p. 11/31
![Page 21: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/21.jpg)
RemarkIf f5(x) = xn, wheren = 3k+1
2 the Coulter-Mattewsperfect nonlinear function, wherek is odd,gcd(k, m) = 1. andp = 3. Computations show thatthe difference permutation function
δ5(x, 1) = (x + 1)n − xn
has exactly 1 or 3 fixed points for many values ofk.But we have no proof of it up till now.
– p. 12/31
![Page 22: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/22.jpg)
On the cycles structure of the permutation
polynomialsδ1, δ2, δ3, andδ4.
– p. 13/31
![Page 23: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/23.jpg)
Cycles ofδ1
– p. 14/31
![Page 24: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/24.jpg)
Cycles ofδ1
• If a = 12, all cycles of length one and the total
number of cycles ispn .
• If a 6= 12, one cycle of length 1 and all other
cycles of lengthord(2a) and the total number of
cycles is pn−1
ord(2a) + 1 .
– p. 14/31
![Page 25: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/25.jpg)
Cycles ofδ1
• If a = 12, all cycles of length one and the total
number of cycles ispn .
• If a 6= 12, one cycle of length 1 and all other
cycles of lengthord(2a) and the total number of
cycles is pn−1
ord(2a) + 1 .
– p. 14/31
![Page 26: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/26.jpg)
Examples
a Cycle Length # Cycles
11
3
1
274514
4 1 823543
51
6
1
137257
Table 1: The cycle structure of2ax overF77
– p. 15/31
![Page 27: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/27.jpg)
Cycles ofδ2, δ3, δ4
Let L(x) ∈ Fq[x] be a linearized polynomial on theform
L(x) =m−1∑
i=0
aixpi
(1)
where eachai ∈ Fp andm > 1. Consider the operatorT : x → xp defined onFpm. Let h(x) =
∑m−1i=0 aix
i
with ai ∈ Fp. ThenL(x) given in (1) can be written inthe formL(x) = h(T )(x), where
h(T )(x) =(
∑n−1i=0 aiT
i)
(x) =∑n−1
i=0 aiTi(x) and
T i(x) is the composition ofT i(x) with itself i times.
– p. 16/31
![Page 28: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/28.jpg)
Cycles ofδ2, δ3, δ4
It is known that a subspaceW of Fpm is said to beT-invarient subspace ifT (W ) ⊆ W . W is T-invarientsubspace ofFpm if and only if W = ker g(T ) thekernal ofg(T ), whereg(x) ∈ Fp[x], g(x)|xm − 1, anddim W= degreeg(x).
– p. 17/31
![Page 29: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/29.jpg)
Cycles ofδ2, δ3, δ4
Consider the canonical factorization ofxm − 1 as
xm − 1 = (xm1 − 1)pt
=l
∏
i=1
gi(x)pt
,
wherem = ptm1 with (m1, p) = 1 andgi(x) is anirreducible polynomial overFp of degreeki. SetWi =
ker(gi(T )) andW(j)i = ker(gi(T )j), then we have
Fpm =l
⊕
i=1
W(pt)i(2)
– p. 18/31
![Page 30: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/30.jpg)
Cycles ofδ2, δ3, δ4
Require: The linearized permutation polynomialL(x) =
∑n−1i=0 aix
pi
, ai ∈ Fp.
– p. 19/31
![Page 31: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/31.jpg)
Cycles ofδ2, δ3, δ4
Require: The linearized permutation polynomialL(x) =
∑n−1i=0 aix
pi
, ai ∈ Fp.
Ensure: The lengths and the numbers of the cyclesfor eachWi, the T-invarient subspace ofFpm withgcd(p, m) = 1.
– p. 19/31
![Page 32: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/32.jpg)
Cycles ofδ2, δ3, δ4
1: Defineh(x) =∑m−1
i=0 aixi.
2: Factorize(xm − 1) as(xm − 1) =∏l
i=0 gi(x),where eachgi(x) is an irreducible polynomialoverFp with degreeki.
3: for i = 1 to l do4: Find a rootω of gi(x) in Fpki .5: Calculateh(ω) in Fpki .6: Find ji the multiplicative order ofh(ω) in Fpki
which is the cycle length.
7: Calculateci = pki−1ji
which is the number of thecycles of lengthji.
8: end for9: return all ji’s andci’s.
– p. 20/31
![Page 33: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/33.jpg)
Magma program/* cycles structure Algorithm 1 */
algorithm1:=procedure(p,n)
g<w>:=GF(p,n);
L<x>:=PolynomialRing(GF(p));
h<x>:=PolynomialRing(GF(p));
printf"Enter the coefficient of h(x) a0.....a%o\n",n-1;
s:=[];
for i:= 0 to n-1 do
printf "a%o=",i;
readi a;
Append(~s,a);
end for;
h:=h!s;
h;
g:={@f[1]:f in Factorization(x^n-1 )@};
j:=AssociativeArray();
c:=AssociativeArray();
for i:=1 to #g do
k:=Degree(g[i]);
w:={@r[1] : r in Roots(g[i],GF(p,k))@};
hw:=Evaluate(h,w[1]);
j[i]:=Order(hw);
c[i]:=(p^k-1)/j[i];
printf "j%o=%o c%o=%o \n", i,j[i],i,c[i];
end for;
end procedure;– p. 21/31
![Page 34: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/34.jpg)
Examples for δ2
Fnp a k Cycle Length # Cycles
F310 1 2
1
2
40
1
4
1476
F75 5 3
1
6
240
1
1
70
F113 10 2
1
3
5
15
1
40
2
80
Table 2: The cycles structure ofaxpk
+ apk
x.
– p. 22/31
![Page 35: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/35.jpg)
Examples for δ3 and δ4
Dif. Function a Cycle Length # Cycles
δ4 = ax9 − a3x3 + a(a8 + 1)x 1
1
2
6
18
1
1
4
1092
−1
1
3
9
3
8
2184
δ3 = ax9 + a3x3 + a(a8 + 1)x 1
1
3
9
9
240
2106
−1
1
2
6
18
1
4
120
1053
Table 3: The cycles structure ofax9 ∓ a3x3 + a(a8 + 1)x.– p. 23/31
![Page 36: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/36.jpg)
Cycles ofδ2, δ3, δ4
Now any elementα ∈ Fq can be uniquely representedas
α = α1 + α2 + . . . + αl,
whereαi ∈ Wi and the length of the cycle thatcontainsα can be determined as
|C(α)| = lcm(j1, j2, . . . , jl).(3)
Notice that ifαi = 0 for some elementα ∈ Fq, thenji = 1 in this case.
– p. 24/31
![Page 37: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/37.jpg)
cases have the same number ofcycles of the same lengthDefinition 3 L1 andL2 are said to beequivalentif aspermutations they have the same number of cycles ofthe same length overFpm, we writeL1 ∼ L2.
Definition 4 L1 andL2 are said to bestronglyequivalentif for every T-invarient subspaceW of F
mp ,
the restrictionsL1|W andL2|W induce the samenumber of cycles of the same length inW . This isdenoted byL1 ≈ L2.
– p. 25/31
![Page 38: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/38.jpg)
cases have the same number ofcycles of the same lengthIn this caseδ1(x, a) have the same number of cyclesof the same length for different values ofa have thesameord(2a).
– p. 26/31
![Page 39: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/39.jpg)
cases have the same number ofcycles of the same length
Theorem 5 LetL1(x) = xps1 + x andL2(x) = xps2 + x. If s1 ≡ pss2 (mod n), for some0 ≤ s ≤ m − 1 thenL1(x) is strongly equivalent toL2(x) overFpm.
– p. 27/31
![Page 40: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/40.jpg)
Example
OverF57
– p. 28/31
![Page 41: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/41.jpg)
Example
OverF57
the permutationsx25 + x andx125 + x
– p. 28/31
![Page 42: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/42.jpg)
Example
OverF57
the permutationsx25 + x andx125 + x
splits up the finite field into
– p. 28/31
![Page 43: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/43.jpg)
Example
OverF57
the permutationsx25 + x andx125 + x
splits up the finite field into
1 cycle of length11 cycle of length472 cycles of length21772 cycles of length868
– p. 28/31
![Page 44: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/44.jpg)
Example
OverF57
the permutationsx25 + x andx125 + x
splits up the finite field into
1 cycle of length11 cycle of length472 cycles of length21772 cycles of length868
– p. 28/31
![Page 45: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/45.jpg)
cases have the same number ofcycles of the same lengthes
Theorem 6 LetL(x) = ax9 ∓ a3x3 + a(a8 + 1)x,wherea ∈ {1,−1}.If m = 3k then the cycles lengthes are2i.3j where
i =
{
0 L(1) = 1,
1 L(1) = −1.
andj = 0, 1, . . . , k.
– p. 29/31
![Page 46: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/46.jpg)
Further work
Study the same for the CM function:
f(x) = x(3k+1)/2 overF3m wheregcd(n, k) = 1 andk ≥ 3 is odd,
– p. 30/31
![Page 47: On the Cycles Structure of Permutations Induced by the ...gmg/Fq9Talks/Aly.pdf · On the Cycles Structure of Permutations Induced by the Perfect Nonlinear Functions over Finite Fields](https://reader034.fdocuments.in/reader034/viewer/2022042218/5ec47ce274a0500faa09e826/html5/thumbnails/47.jpg)
Further workLet f(x) = xn be a perfect nonlinear function overFq.Let δ(x, a) = (x + a)n − xn be its permutation.1. How many fixed points are there forδ?2. What about the cycles structure ofδ?
– p. 31/31