金庆芳ua+b

靳庆芳ua+b论文下载
论文名称：A Combinatorial Condition and Boolean Functions with Optimal Algebraic Immunity∗
1.Conjucture

2.Construction1


3. Construction1 optimal algebraic immunity n/2
4. Construction1 algebraic degree k≤deg(f)≤2(k-1)

5.tht low bound of Construction1 nonlinearity

6.the real value of nonlinearity

//此为magma代码
//计算金庆芳ua+b非线性度
k:=4;
//for k:=2 to 10 by 1 do
for u:=1 to 2^k-2 by 1 do 
for ss:=0 to 2^k-2 by 1 do 
//u:=1;
//ss:=0;
G<x>:=GF(2,k);
Z:=IntegerRing();
g:=[];
for tt:=0 to 2^k-2 by 1 do //初始化g的真值表全为0
bin1:=Eltseq(x^tt, GF(2)); toInt1 := [Z | bin1 [j] : j in {1.. k by 1}];
k1:=&+[toInt1[i]*(2^(i-1)): i in [1..k]]; g[k1]:=0;
end for;

for tt:=0+ss to 2^(k-1)+ss-1 by 1 do //根据g的支撑架生成g的真值表
bin2:=Eltseq(x^tt, GF(2)); toInt2 := [Z | bin2 [j] : j in {1.. k by 1}];
k2:=&+[toInt2[i]*(2^(i-1)): i in [1..k]]; g[k2]:=1;
end for;
//g:=[0] cat g;

n:=2*k;
F<w>:=GF(2,n);
f:=[];
for tt:=0 to 2^n-2 by 1 do //初始化f的真值表全为0
bin3:=Eltseq(w^tt, GF(2)); toInt3 := [Z | bin3 [j] : j in {1.. n by 1}];
k3:=&+[toInt3[i]*(2^(i-1)): i in [1..n]]; f[k3]:=0;
end for;
for tt:=0 to 2^k-2 by 1 do //由f(x,y)=g(xy)生成f的真值表
    for dd:=0 to 2^k-2 by 1 do 
    bin4:=Eltseq(x^tt, GF(2)); toInt4 := [Z | bin4 [j] : j in {1.. k by 1}];
    bin5:=Eltseq(x^dd, GF(2)); toInt5 := [Z | bin5 [j] : j in {1.. k by 1}];
    bin6:=Eltseq(x^(tt+dd*(2^k-1-u)), GF(2)); toInt6 := [Z | bin6 [j] : j in {1.. k by 1}];
    toIntw:=toInt4 cat toInt5;
    k4:=&+[toIntw[i]*(2^(i-1)): i in [1..n]]; 
    k5:=&+[toInt6[i]*(2^(i-1)): i in [1..k]];
    value:=g[k5];
    f[k4]:=value;
    end for;
end for;
for dd:=0 to 2^k-2 by 1 do //当x=0
    bin7:=Eltseq(x^dd, GF(2)); toInt7 := [Z | bin7 [j] : j in {1.. k by 1}];
    k7:=&+[toInt7[i]*(2^(i-1)): i in [1..k]]; f[k7]:=0;
end for;
for tt:=0 to 2^k-2 by 1 do //当y=0
    bin8:=Eltseq(x^tt, GF(2)); toInt8 := [Z | bin8 [j] : j in {1.. k by 1}];
    k8:=&+[toInt8[i]*(2^(i+k-1)): i in [1..k]]; f[k8]:=0;
end for;
f:=[0] cat f;
a:= [1-2*f[i]:i in [1..2^n]];
for tt:=1 to n by 1 do // butterfly algorithm
    t:=2^n div 2^tt;
for j:=0 to 2^tt-1 by 2 do
for l:=1 to t by 1 do
        a[t*j+l]:=a[t*j+l]+a[t*(j+1)+l];
        a[t*(j+1)+l]:=a[t*j+l]-2*a[t*(j+1)+l];
end for;
    end for;
end for;
b:=[Abs (a[i]):i in [1..2^n]];
nl:=2^(n-1)-Max(b) div 2;
nl;
end for; 
printf(".............................\n");
end for;
//end for;

7.Construction2

8.Construction2 optimal algebraic immunity n/2
9.Constuction2 algebraic degree n-1
10.The Construction2 nonlinearity

//此为magma代码
//计算金庆芳ua+b 构造2非线性度
k:=4;
//for k:=2 to 10 by 1 do
for u:=1 to 2^k-2 by 1 do 
for ss:=0 to 2^k-2 by 1 do 
//u:=1;
//ss:=0;
G<x>:=GF(2,k);
Z:=IntegerRing();
g:=[];
for tt:=0 to 2^k-2 by 1 do //初始化g的真值表全为0
bin1:=Eltseq(x^tt, GF(2)); toInt1 := [Z | bin1 [j] : j in {1.. k by 1}];
k1:=&+[toInt1[i]*(2^(i-1)): i in [1..k]]; g[k1]:=0;
end for;

for tt:=0+ss to 2^(k-1)+ss-1 by 1 do //根据g的支撑架生成g的真值表
bin2:=Eltseq(x^tt, GF(2)); toInt2 := [Z | bin2 [j] : j in {1.. k by 1}];
k2:=&+[toInt2[i]*(2^(i-1)): i in [1..k]]; g[k2]:=1;
end for;
//g:=[0] cat g;
n:=2*k;
F<w>:=GF(2,n);
f:=[];
for tt:=0 to 2^n-2 by 1 do //初始化f的真值表全为0
bin3:=Eltseq(w^tt, GF(2)); toInt3 := [Z | bin3 [j] : j in {1.. n by 1}];
k3:=&+[toInt3[i]*(2^(i-1)): i in [1..n]]; f[k3]:=0;
end for;
for tt:=0 to 2^k-2 by 1 do //由f(x,y)=g(xy)生成f的真值表
    for dd:=0 to 2^k-2 by 1 do 
 bin4:=Eltseq(x^tt, GF(2)); toInt4 := [Z | bin4 [j] : j in {1.. k by 1}];
bin5:=Eltseq(x^dd, GF(2)); toInt5 := [Z | bin5 [j] : j in {1.. k by 1}];
bin6:=Eltseq(x^(tt+dd*(2^k-1-u)), GF(2)); toInt6 := [Z | bin6 [j] : j in {1.. k by 1}];
toIntw:=toInt4 cat toInt5;
k4:=&+[toIntw[i]*(2^(i-1)): i in [1..n]]; 
k5:=&+[toInt6[i]*(2^(i-1)): i in [1..k]];
value:=g[k5];
f[k4]:=value;
    end for;
end for;
for dd:=0 to 2^k-2 by 1 do //当x=0
    bin7:=Eltseq(x^dd, GF(2)); toInt7 := [Z | bin7 [j] : j in {1.. k by 1}];
    k7:=&+[toInt7[i]*(2^(i-1)): i in [1..k]]; f[k7]:=g[k7];
end for;
f:=[0] cat f;
a:= [1-2*f[i]:i in [1..2^n]];
for tt:=1 to n by 1 do // butterfly algorithm
    t:=2^n div 2^tt;
for j:=0 to 2^tt-1 by 2 do
for l:=1 to t by 1 do
        a[t*j+l]:=a[t*j+l]+a[t*(j+1)+l];
        a[t*(j+1)+l]:=a[t*j+l]-2*a[t*(j+1)+l];
end for;
    end for;
end for;
b:=[Abs (a[i]):i in [1..2^n]];
nl:=2^(n-1)-Max(b) div 2;
nl;
end for; 
end for;
//end for;

11.construction2 Immunity against fast algebraic attacks