1、密钥产生:
#include <bits/stdc++.h>
using namespace std;
int permChoiceOne[] = { //PC-1 置换选择1
57, 49, 41, 33, 25, 17, 9 ,
1 , 58, 50, 42, 34, 26, 18,
10, 2 , 59, 51, 43, 35, 27,
19, 11, 3 , 60, 52, 44, 36,
63, 55, 47, 39, 31, 23, 15,
7 , 62, 54, 46, 38, 30, 22,
14, 6 , 61, 53, 45, 37, 29,
21, 13, 5 , 28, 20, 12, 4 };
int permChoiceTwo[] = { //PC-2 置换选择2
14, 17, 11, 24, 1 , 5 , 3 , 28,
15, 6 , 21, 10, 23, 19, 12, 4 ,
26, 8 , 16, 7 , 27, 20, 13, 2 ,
41, 52, 31, 37, 47, 55, 30, 40,
51, 45, 33, 48, 44, 49, 39, 56,
34, 53, 46, 42, 50, 36, 29, 32 };
//左移次数确定
int leftShiftTable[] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };
string rotateSubKey(string s, int rot) // rot是左移旋转次数
{
return s.substr(rot, s.length() - rot) + s.substr(0, rot); //截取字符
}
string firstPermute(string input)
{
string res = "";
for (int i = 0; i < 56; i++)
{
res += input[permChoiceOne[i] - 1];
}
return res;
}
string secondPermute(string input)
{
string res = "";
for (int i = 0; i < 48; i++)
{
res += input[permChoiceTwo[i] - 1];
}
return res;
}
void genKeys(string left, string right)
{
ofstream fout;
fout.open("keygen.txt");
for (int i = 0; i < 16; i++)
{
left = rotateSubKey(left, leftShiftTable[i]);
right = rotateSubKey(right, leftShiftTable[i]);
string key = secondPermute(left + right);
cout << "key " << i + 1 << " \t: " << key << endl;
fout << key << endl; // 保存到文件
}
}
int main()
{
unsigned long long hexkey;
cout << "\n 请输入64bit的数字(16进制,共16个数字) : ";
cin >> hex >> hexkey;
string key = bitset<64>(hexkey).to_string(); // 16 -> 2
cout << "二进制密钥 \t: " << key << endl;
key = firstPermute(key);
cout << "PC-1 key (k+) \t: " << key << endl;
cout << "\nSubKeys: " << endl;
genKeys(key.substr(0, 28), key.substr(28, 28));
cout << endl << endl;
}
2、S盒变换
#include <bits/stdc++.h>
using namespace std;
int expPermute[] = { //扩展置换E
32, 1 , 2 , 3 , 4 , 5 ,
4 , 5 , 6 , 7 , 8 , 9 ,
8 , 9 , 10, 11, 12, 13,
12, 13, 14, 15, 16, 17,
16, 17, 18, 19, 20, 21,
20, 21, 22, 23, 24, 25,
24, 25, 26, 27, 28, 29,
28, 29, 30, 31, 32, 1 };
string expansionPermute(string input)
{
string res = "";
for(int i=0; i<48; i++)
{
res += input[expPermute[i]-1];
}
return res;
}
string XOR(string input1, string input2)
{
string res = "";
for(int i=0; i<input1.length(); i++)
{
res += (input1[i] == input2[i]) ? "0" : "1";
}
return res;
}
int main()
{
int i;
unsigned long long hexInput;
string Ki;
ifstream fin;
cout << "\n输入第几轮(i) : ";
cin >> i;
cout << "Enter 64-bit (i-1)th round output in hex: " ;
cin >> hex >> hexInput;
string input = bitset<64>(hexInput).to_string();
fin.open("keygen.txt");
for(int j=1; j<=i; j++)
{
fin >> Ki;
}
if(Ki.length() == 0)
{
cout << "\n 错误 \n" << endl;
exit(1);
}
cout << "\n64-bit 二进制输入 = " << input << endl ;
cout << " (Ki) = " << Ki << endl ;
string Ri_1 = input.substr(32,32);
cout << "\n Ri_1 = " << Ri_1 << endl;
string R48 = expansionPermute(Ri_1);
cout << "Ri_1 变换后 = " << R48 << endl;
string sBoxInput = XOR(R48, Ki);
cout << "\n S变换后 : " << sBoxInput << endl << endl;
}
3、Ri
#include <bits/stdc++.h>
using namespace std;
unsigned int sBoxes[8][4][16] = {
//S1
{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7,
0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8,
4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0,
15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13},
//S2
{15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10,
3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5,
0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15,
13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9},
//S3
{10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8,
13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1,
13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7,
1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12},
//S4
{7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15,
13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9,
10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4,
3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14},
//S5
{2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9,
14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6,
4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14,
11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3},
//S6
{12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11,
10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8,
9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6,
4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13,},
//S7
{4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,
13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6,
1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2,
6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12},
//S8
{13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7,
1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2,
7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8,
2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}
};
int permTable[] = { //置换函数P
16, 7 , 20, 21, 29, 12, 28, 17,
1 , 15, 23, 26, 5 , 18, 31, 10,
2 , 8 , 24, 14, 32, 27, 3 , 9 ,
19, 13, 30, 6 , 22, 11, 4 , 25 };
string substitution(string input)
{
string res = "";
for(int i=0; i<8; i++)
{
string sInput = input.substr(6*i, 6) ;
int row = bitset<2>( sInput.substr(0,1) + sInput.substr(5,1) ).to_ulong() ;
int col = bitset<4>( sInput.substr(1,4) ).to_ulong() ;
res += bitset<4>(sBoxes[i][row][col]).to_string() ;
}
return res;
}
string permute(string input)
{
string res = "";
for(int i=0; i<32; i++)
{
res += input[permTable[i]-1];
}
return res;
}
string XOR(string input1, string input2)
{
string res = "";
for(int i=0; i<input1.length(); i++)
{
res += (input1[i] == input2[i]) ? "0" : "1";
}
return res;
}
int main()
{
unsigned long long hexSBoxInput, hexInput;
cout << "\n 输入十六进制的S-box的48位输入(12bit) : " ;
cin >> hex >> hexSBoxInput;
cout << "输入 十六进制的 64位(i-1)的输出(16-digits) : " ;
cin >> hex >> hexInput;
string sBoxinput = bitset<48>(hexSBoxInput).to_string();
cout << "\n S-Box Input : " << sBoxinput << endl;
string input = bitset<64>(hexInput).to_string();
cout << " Round(i-1) output : " << input << endl;
string Li_1 = input.substr(0,32);
cout << "\n Li_1 : " << Li_1 << endl;
string sBoxOutput = substitution(sBoxinput);
cout << "\n S-Box output = " << sBoxOutput << endl;
string P = permute(sBoxOutput);
cout << " P置换输出 = " << P << endl;
string Ri = XOR(P, Li_1); // P is permuted string and Li_1 is left half output of (i-1)th round
cout << "\n (Ri) = " << Ri << endl << endl;
}