1、密钥产生:

  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int permChoiceOne[] = { //PC-1 置换选择1
  4. 57, 49, 41, 33, 25, 17, 9 ,
  5. 1 , 58, 50, 42, 34, 26, 18,
  6. 10, 2 , 59, 51, 43, 35, 27,
  7. 19, 11, 3 , 60, 52, 44, 36,
  8. 63, 55, 47, 39, 31, 23, 15,
  9. 7 , 62, 54, 46, 38, 30, 22,
  10. 14, 6 , 61, 53, 45, 37, 29,
  11. 21, 13, 5 , 28, 20, 12, 4 };
  12. int permChoiceTwo[] = { //PC-2 置换选择2
  13. 14, 17, 11, 24, 1 , 5 , 3 , 28,
  14. 15, 6 , 21, 10, 23, 19, 12, 4 ,
  15. 26, 8 , 16, 7 , 27, 20, 13, 2 ,
  16. 41, 52, 31, 37, 47, 55, 30, 40,
  17. 51, 45, 33, 48, 44, 49, 39, 56,
  18. 34, 53, 46, 42, 50, 36, 29, 32 };
  19. //左移次数确定
  20. int leftShiftTable[] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };
  21. string rotateSubKey(string s, int rot) // rot是左移旋转次数
  22. {
  23. return s.substr(rot, s.length() - rot) + s.substr(0, rot); //截取字符
  24. }
  25. string firstPermute(string input)
  26. {
  27. string res = "";
  28. for (int i = 0; i < 56; i++)
  29. {
  30. res += input[permChoiceOne[i] - 1];
  31. }
  32. return res;
  33. }
  34. string secondPermute(string input)
  35. {
  36. string res = "";
  37. for (int i = 0; i < 48; i++)
  38. {
  39. res += input[permChoiceTwo[i] - 1];
  40. }
  41. return res;
  42. }
  43. void genKeys(string left, string right)
  44. {
  45. ofstream fout;
  46. fout.open("keygen.txt");
  47. for (int i = 0; i < 16; i++)
  48. {
  49. left = rotateSubKey(left, leftShiftTable[i]);
  50. right = rotateSubKey(right, leftShiftTable[i]);
  51. string key = secondPermute(left + right);
  52. cout << "key " << i + 1 << " \t: " << key << endl;
  53. fout << key << endl; // 保存到文件
  54. }
  55. }
  56. int main()
  57. {
  58. unsigned long long hexkey;
  59. cout << "\n 请输入64bit的数字(16进制,共16个数字) : ";
  60. cin >> hex >> hexkey;
  61. string key = bitset<64>(hexkey).to_string(); // 16 -> 2
  62. cout << "二进制密钥 \t: " << key << endl;
  63. key = firstPermute(key);
  64. cout << "PC-1 key (k+) \t: " << key << endl;
  65. cout << "\nSubKeys: " << endl;
  66. genKeys(key.substr(0, 28), key.substr(28, 28));
  67. cout << endl << endl;
  68. }

2、S盒变换

  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int expPermute[] = { //扩展置换E
  4. 32, 1 , 2 , 3 , 4 , 5 ,
  5. 4 , 5 , 6 , 7 , 8 , 9 ,
  6. 8 , 9 , 10, 11, 12, 13,
  7. 12, 13, 14, 15, 16, 17,
  8. 16, 17, 18, 19, 20, 21,
  9. 20, 21, 22, 23, 24, 25,
  10. 24, 25, 26, 27, 28, 29,
  11. 28, 29, 30, 31, 32, 1 };
  12. string expansionPermute(string input)
  13. {
  14. string res = "";
  15. for(int i=0; i<48; i++)
  16. {
  17. res += input[expPermute[i]-1];
  18. }
  19. return res;
  20. }
  21. string XOR(string input1, string input2)
  22. {
  23. string res = "";
  24. for(int i=0; i<input1.length(); i++)
  25. {
  26. res += (input1[i] == input2[i]) ? "0" : "1";
  27. }
  28. return res;
  29. }
  30. int main()
  31. {
  32. int i;
  33. unsigned long long hexInput;
  34. string Ki;
  35. ifstream fin;
  36. cout << "\n输入第几轮(i) : ";
  37. cin >> i;
  38. cout << "Enter 64-bit (i-1)th round output in hex: " ;
  39. cin >> hex >> hexInput;
  40. string input = bitset<64>(hexInput).to_string();
  41. fin.open("keygen.txt");
  42. for(int j=1; j<=i; j++)
  43. {
  44. fin >> Ki;
  45. }
  46. if(Ki.length() == 0)
  47. {
  48. cout << "\n 错误 \n" << endl;
  49. exit(1);
  50. }
  51. cout << "\n64-bit 二进制输入 = " << input << endl ;
  52. cout << " (Ki) = " << Ki << endl ;
  53. string Ri_1 = input.substr(32,32);
  54. cout << "\n Ri_1 = " << Ri_1 << endl;
  55. string R48 = expansionPermute(Ri_1);
  56. cout << "Ri_1 变换后 = " << R48 << endl;
  57. string sBoxInput = XOR(R48, Ki);
  58. cout << "\n S变换后 : " << sBoxInput << endl << endl;
  59. }

3、Ri

  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. unsigned int sBoxes[8][4][16] = {
  4. //S1
  5. {14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7,
  6. 0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8,
  7. 4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0,
  8. 15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13},
  9. //S2
  10. {15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10,
  11. 3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5,
  12. 0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15,
  13. 13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9},
  14. //S3
  15. {10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8,
  16. 13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1,
  17. 13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7,
  18. 1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12},
  19. //S4
  20. {7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15,
  21. 13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9,
  22. 10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4,
  23. 3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14},
  24. //S5
  25. {2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9,
  26. 14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6,
  27. 4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14,
  28. 11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3},
  29. //S6
  30. {12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11,
  31. 10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8,
  32. 9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6,
  33. 4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13,},
  34. //S7
  35. {4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,
  36. 13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6,
  37. 1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2,
  38. 6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12},
  39. //S8
  40. {13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7,
  41. 1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2,
  42. 7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8,
  43. 2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}
  44. };
  45. int permTable[] = { //置换函数P
  46. 16, 7 , 20, 21, 29, 12, 28, 17,
  47. 1 , 15, 23, 26, 5 , 18, 31, 10,
  48. 2 , 8 , 24, 14, 32, 27, 3 , 9 ,
  49. 19, 13, 30, 6 , 22, 11, 4 , 25 };
  50. string substitution(string input)
  51. {
  52. string res = "";
  53. for(int i=0; i<8; i++)
  54. {
  55. string sInput = input.substr(6*i, 6) ;
  56. int row = bitset<2>( sInput.substr(0,1) + sInput.substr(5,1) ).to_ulong() ;
  57. int col = bitset<4>( sInput.substr(1,4) ).to_ulong() ;
  58. res += bitset<4>(sBoxes[i][row][col]).to_string() ;
  59. }
  60. return res;
  61. }
  62. string permute(string input)
  63. {
  64. string res = "";
  65. for(int i=0; i<32; i++)
  66. {
  67. res += input[permTable[i]-1];
  68. }
  69. return res;
  70. }
  71. string XOR(string input1, string input2)
  72. {
  73. string res = "";
  74. for(int i=0; i<input1.length(); i++)
  75. {
  76. res += (input1[i] == input2[i]) ? "0" : "1";
  77. }
  78. return res;
  79. }
  80. int main()
  81. {
  82. unsigned long long hexSBoxInput, hexInput;
  83. cout << "\n 输入十六进制的S-box的48位输入(12bit) : " ;
  84. cin >> hex >> hexSBoxInput;
  85. cout << "输入 十六进制的 64位(i-1)的输出(16-digits) : " ;
  86. cin >> hex >> hexInput;
  87. string sBoxinput = bitset<48>(hexSBoxInput).to_string();
  88. cout << "\n S-Box Input : " << sBoxinput << endl;
  89. string input = bitset<64>(hexInput).to_string();
  90. cout << " Round(i-1) output : " << input << endl;
  91. string Li_1 = input.substr(0,32);
  92. cout << "\n Li_1 : " << Li_1 << endl;
  93. string sBoxOutput = substitution(sBoxinput);
  94. cout << "\n S-Box output = " << sBoxOutput << endl;
  95. string P = permute(sBoxOutput);
  96. cout << " P置换输出 = " << P << endl;
  97. string Ri = XOR(P, Li_1); // P is permuted string and Li_1 is left half output of (i-1)th round
  98. cout << "\n (Ri) = " << Ri << endl << endl;
  99. }