static void Main(string[] args)
{
int b, c;
GF gf1 = new GF();
int[] RandomA = new int[100000];
int[] RandomB = new int[100000];
//DateTime dtBeginTime = DateTime.Now;
for (int i = 0; i < 100000; i++)
{
RandomA[i] = RandomStatic.ProduceIntRandom(0, 255);
RandomB[i] = RandomStatic.ProduceIntRandom(0, 255);
}
DateTime BeginTime = DateTime.Now;
for (int i = 0; i < 100000; i++)
{
c = gf1.Mul(RandomA[i], RandomB[i]);
}
DateTime EndTime = DateTime.Now;
TimeSpan ts = EndTime.Subtract(BeginTime);
Console.WriteLine("乘法所花的时间:");
Console.WriteLine(ts.ToString());
for (int i = 0; i < 100000; i++)
{
RandomA[i] = RandomStatic.ProduceIntRandom(1, 255);
}
DateTime BeginTime1 = DateTime.Now;
for (int i = 0; i < 100000; i++)
{
c = gf1.Inverse(RandomA[i]);
}
DateTime EndTime1 = DateTime.Now;
TimeSpan ts1 = EndTime1.Subtract(BeginTime1);
Console.WriteLine("求逆元所花的时间:");
Console.WriteLine(ts1.ToString());
int[] SBox = new int[256];
SBinary SBinary_t = new SBinary();
int[,] Bias = new int[256, 256];
int[] y = new int[8];
int[] z = { 1, 1, 0, 0, 0, 1, 1, 0 };
// 转化为二进制
/*for (int i = 0; i < 256; i++)
* {
* int n = i;
* for (int j = 0; j < 8; j++)
* {
* SBinary[i, j] = n % 2;
* n = n / 2;
* }
* }*/
// 计算SBox------Subbyte
for (int i = 0; i < 256; i++)
{
if (i != 0)
{
b = gf1.Inverse(i);
}
else
{
b = 0;
}
int n = 1;
SBox[i] = 0;
for (int k = 0; k < 8; k++)
{
y[k] = SBinary.GetData(b, k) + SBinary.GetData(b, (k + 4) % 8) + SBinary.GetData(b, (k + 5) % 8) + SBinary.GetData(b, (k + 6) % 8) + SBinary.GetData(b, (k + 7) % 8) + z[k];
y[k] = y[k] % 2;
SBox[i] += y[k] * n;
n = n * 2;
}
}
// for (int i = 0; i < 256; i++)
// {
// Console.Write("i=");
// Console.Write(i);
// Console.Write(" y=");
// Console.WriteLine(SBox[i]);
// }
// 线性分析
for (int input_sum = 0; input_sum < 256; input_sum++)
{
for (int output_sum = 0; output_sum < 256; output_sum++)
{
Bias[input_sum, output_sum] = 0;
for (int i = 0; i < 256; i++)
{
int m = 0, n = 0;
for (int j = 0; j < 8; j++)
{
m = m + SBinary.GetData(input_sum, j) * SBinary.GetData(i, j);
n = n + SBinary.GetData(output_sum, j) * SBinary.GetData(SBox[i], j);
}
m = m % 2;
n = n % 2;
if (m == n)
{
Bias[input_sum, output_sum]++;
}
}
Bias[input_sum, output_sum] -= 128;
}
}
int[] input = new int[11];
int[] output = new int[11];
int[] g = new int[11];
// 求偏差最大的前十个线性方程
for (int i = 0; i < 11; i++)
{
int m, n1 = 0, n2 = 0;
m = Bias[0, 0];
for (int j = 0; j < 256; j++)
{
for (int k = 0; k < 256; k++)
{
if (Bias[j, k] > m)
{
m = Bias[j, k];
n1 = j;
n2 = k;
}
}
}
input[i] = n1;
output[i] = n2;
g[i] = m;
Bias[n1, n2] = -128;
}
// 输出
Console.WriteLine("偏差最大的前十个线性方程：");
for (int i = 1; i < 11; i++)
{
for (int j = 0; j < 8; j++)
{
if (j != 0)
{
Console.Write('+');
}
Console.Write(SBinary.GetData(input[i], j));
Console.Write('x');
Console.Write(j);
}
Console.Write('=');
for (int j = 0; j < 8; j++)
{
if (j != 0)
{
Console.Write('+');
}
Console.Write(SBinary.GetData(output[i], j));
Console.Write('y');
Console.Write(j);
}
Console.Write(" Bias=");
Console.Write(g[i] / 256.0);
Console.WriteLine();
}
Console.ReadLine();
}
static void Main(string[] args)
{
DateTime dtBeginTime = DateTime.Now;
int a, b, c;
GF gf1 = new GF();
for (int i = 0; i < 100000; i++)
{
a = RandomStatic.ProduceIntRandom(0, 255);
b = RandomStatic.ProduceIntRandom(0, 255);
c = gf1.Mul(a, b);
}
DateTime dtEndTime = DateTime.Now;
TimeSpan ts = dtEndTime.Subtract(dtBeginTime);
Console.WriteLine("乘法所花的时间:");
Console.WriteLine(ts.ToString());
DateTime dtBeginTime1 = DateTime.Now;
for (int i = 0; i < 100000; i++)
{
a = RandomStatic.ProduceIntRandom(1, 255);
b = gf1.Inverse(a);
}
DateTime dtEndTime1 = DateTime.Now;
TimeSpan ts1 = dtEndTime1.Subtract(dtBeginTime1);
Console.WriteLine("求逆元所花的时间:");
Console.WriteLine(ts1.ToString());
int[] SBox = new int[256];
int[,] SBinary = new int[256, 8];
int[,] Bias = new int[256, 256];
int [] y = new int [8];
int [] z = { 1, 1, 0, 0, 0, 1, 1, 0 };
// 转化为二进制
for (int i = 0; i < 256; i++)
{
int n = i;
for (int j = 0; j < 8; j++)
{
SBinary[i, j] = n % 2;
n = n / 2;
}
}
// 计算SBox------Subbyte
for (int i = 0; i < 256; i++)
{
if (i != 0)
{
b = gf1.Inverse(i);
}
else
{
b = 0;
}
int n = 1;
SBox[i] = 0;
for (int k = 0; k < 8; k++)
{
y[k] = SBinary[b, k] + SBinary[b, (k + 4) % 8] + SBinary[b, (k + 5) % 8] + SBinary[b, (k + 6) % 8] + SBinary[b, (k + 7) % 8] + z[k];
y[k] = y[k] % 2;
SBox[i] += y[k] * n;
n = n * 2;
}
}
// for (int i = 0; i < 256; i++)
// {
// Console.Write("i=");
// Console.Write(i);
// Console.Write(" y=");
// Console.WriteLine(SBox[i]);
// }
// 线性分析
for (int input_sum = 0; input_sum < 256; input_sum++)
{
for (int output_sum = 0; output_sum < 256; output_sum++)
{
Bias[input_sum, output_sum] = 0;
for (int i = 0; i < 256; i++)
{
int m = 0, n = 0;
for (int j = 0; j < 8; j++)
{
m = m + SBinary[input_sum, j] * SBinary[i, j];
n = n + SBinary[output_sum, j] * SBinary[SBox[i], j];
}
m = m % 2;
n = n % 2;
if (m == n)
{
Bias[input_sum, output_sum]++;
}
}
Bias[input_sum, output_sum] -= 128;
}
}
int[] input = new int[10];
int[] output = new int[10];
int[] g = new int[10];
// 求偏差最大的前十个线性方程
for (int i = 0; i < 10; i++)
{
int m, n1 = 0, n2 = 0;
m = Bias[0, 0];
for (int j = 0; j < 256; j++)
{
for (int k = 0; k < 256; k++)
{
if (Bias[j, k] > m)
{
m = Bias[j, k];
n1 = j;
n2 = k;
}
}
}
input[i] = n1;
output[i] = n2;
g[i] = m;
Bias[n1, n2] = -128;
}
// 输出
Console.WriteLine("偏差最大的前十个线性方程：");
for (int i = 0; i < 10; i++)
{
for (int j = 0; j < 8; j++)
{
if (j != 0)
{
Console.Write('+');
}
Console.Write(SBinary[input[i], j]);
Console.Write('x');
Console.Write(j);
}
Console.Write('=');
for (int j = 0; j < 8; j++)
{
if (j != 0)
{
Console.Write('+');
}
Console.Write(SBinary[output[i], j]);
Console.Write('x');
Console.Write(j);
}
Console.Write(" Bias=");
Console.Write(g[i]);
Console.WriteLine();
}
Console.ReadLine();
}
