参考:DES加密算法_不揭.的博客-CSDN博客_des加密算法
这位大佬写的非常好,建议去看一看。
--------------------------------------------------------------------------------------------------------------------------------
DES加密,是一种对称加密算法,一种比较传统的加密方式,其加密运算、解密运算使用的是同样的密钥,信息的发送者和信息的接收者必须共同持有该密钥。
明文按64位进行分组,密钥长64位,实际长度是56位(64-8)(第8、16、24、32、40、48、56、64位是奇偶校验位)。
1. DES的加密过程
明文64位->初始置换IP->生成子密钥->在密钥控制下进行16轮加密变换->交换左右32比特->逆初始置换IP-1->密文64位
假设我们输入明文M,选取密钥K
a.初始置换IP
通过置换表将数据的位置进行变化,得到新的数据。
初始逆置换表和初始置换表是相互可逆的,只是还原 原来的数据位置。
被分组为一组长64位的明文M 根据初始IP置换表进行置换。
初始IP置换表如下:
把64位明文按照表中的规则替换,将数据的第58位放在第一位,将第50位放在第二位,以此类推。由明文M得到M'。
b.子密钥生成
由于16轮加密变换每一轮的迭代都有密钥参与,因此需要产生不同的轮密钥共16组。
DES算法子密钥输入长度为64位,但是只有48位是有效的,所以需要对密钥K进行变换得到每一轮所需的子密钥。16轮迭代就需要16个48位的子密钥来进行加密。
子密钥的产生:
(1)64位密钥经过置换选择1,选择其中的56位,对56位密钥同样分为左右28位。
置换选择表1如下:
int PC1[] = { 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 };
(2)每轮:按照子密钥计算逻辑表,每一轮进行循环左移运算分别得到新的56位。
子密钥计算逻辑表如下:
int LS[] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };
得到的56位结果再经过第二次置换 选择有效的位数就得到了本轮的子密钥(48位)。
置换选择表2如下:
int PC2[] = { 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 };
c.16轮加密变换
取M’的前32位作为L0(32位),后32位作为R0(32位)。
16轮加密变换流程图如下:
可以从图中看出,左边的32位L0经过变换成为下一轮右边的输入,右边的32位R0直接成为下一轮左边的输入。
L0->R1:
(1)扩充/置换:此处的32位R0先进行扩充置换变成了48位(因为我们需要将其与48位的子密钥异或)。
(2)与第一轮密钥异或:扩充之后与48位的密钥进行异或运算。
(3)代换/选择:将这48位数据转换为32位。
这一步是整个DES算法的核心,简称S盒。
S盒示意图如下:
每个S盒:对照着4行16列的表,6比特输入中的第1比特和第6比特组成的二进制数来确定行,中间4位二进制数来确定列,对应行、列位置的十进制数的4位二进制数表示作为输出。
每个S盒的表如下:
例如对第2个S盒,输入为101001,则行数和列数的二进制表示分别是11和0100,即第3行和第4列,第3行和第4列的十进制数为3,用4位二进制数表示为0011,所以的输出为0011,如下图所示。
(4)置换:经过置换表进行置换。
(5)与L0异或:接下来将这32位数据与上一轮的L0进行异或运算得到R1的输入(32位)。
d.交换左右32比特
e.逆初始置换IP-1
逆置换是初始置换的逆运算。从初始置换规则中可以看到,原始数据的第1位置换到了第40位,第2位置换到了第8位。则逆置换就是将第40位置换到第1位,第8位置换到第2位。以此类推,逆置换规则表如下:
int IPR[] = { 40, 8, 48, 16, 56, 24, 64, 32,
39, 7, 47, 15, 55, 23, 63, 31,
38, 6, 46, 14, 54, 22, 62, 30,
37, 5, 45, 13, 53, 21, 61, 29,
36, 4, 44, 12, 52, 20, 60, 28,
35, 3, 43, 11, 51, 19, 59, 27,
34, 2, 42, 10, 50, 18, 58, 26,
33, 1, 41, 9, 49, 17, 57, 25 };
得到密文
2. 代码
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
using namespace std;
string roundKey[16];//函数在传递数组的时候需要用到指针,因为不想使用指针,所以一开始预定义
//生成轮密钥的过程//
//1:生成密钥置换PC-1,将输入的初始密钥由64位变成56位
int PC1[] = { 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 };
string PC1Exchange(string key) {//PC-1置换函数
string result = "";
for (int i = 0; i < 56; ++i) {
result += key[PC1[i]-1];
}
return result;
}
//2:生成的56比特分为C0和的D0,每一轮生成的Ci和Di都要进行循环左移,循环左移轮数写成一张表
int LS[] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };
string LeftShift(string key, int ShiftNumber) {//循环左移函数
return key.substr(ShiftNumber) + key.substr(0, ShiftNumber);
//比如循环左移两次,ShiftNumber为2,排除第零、第一个,从第二个字符串开始,截取到最后一位;加上从第零个字符串开始,截取长度为2。
}
//3:生成压缩置换表,将Ci和Di合并为56位密钥,然后进行压缩,生成48位轮密钥
int PC2[] = { 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 };
string PC2Exchange(string key) {//压缩置换PC-2函数
string result = "";
for (int i = 0; i < 48; ++i) {
result += key[PC2[i] - 1];
}
return result;
}
//轮密钥生成函数
void KeyGenerate(string initKey) {//将初始密钥传递到函数中
string leftKey;//将密钥分为Ci和Di,分别用leftKey和rightKey表示
string rightKey;
string tempKey = PC1Exchange(initKey);//用来存储经过密钥置换PC-1之后的56位密钥值以及生成的密钥中间值
for (int i = 0; i < 16; ++i) {
leftKey = tempKey.substr(0, 28);//将56位密钥分为左右两部分
rightKey = tempKey.substr(28);
leftKey = LeftShift(leftKey, LS[i]);//对左右两部分Ci和Di进行循环左移操作
rightKey = LeftShift(rightKey, LS[i]);
tempKey = leftKey + rightKey;//将Ci和Di进行合并得到密钥中间值
roundKey[i] = PC2Exchange(tempKey);
}
}
//生成轮密钥的过程结束//
//加解密操作的过程//
//1:初始置换IP
int IP[] = { 58, 50, 42, 34, 26, 18, 10, 2,
60, 52, 44, 36, 28, 20, 12, 4,
62, 54, 46, 38, 30, 22, 14, 6,
64, 56, 48, 40, 32, 24, 16, 8,
57, 49, 41, 33, 25, 17, 9, 1,
59, 51, 43, 35, 27, 19, 11, 3,
61, 53, 45, 37, 29, 21, 13, 5,
63, 55, 47, 39, 31, 23, 15, 7 };
string IPExchange(string init) {//IP置换函数
string result = "";
for (int i = 0; i < 64; ++i) {
result += init[IP[i] - 1];
}
return result;
}
//2:函数F
//扩展置换E
int 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 EExchange(string right) {//扩展置换函数
string result = "";
for (int i = 0; i < 48; ++i) {
result += right[E[i] - 1];
}
return result;
}
//S盒
int SBOX[8][4][16] = {
{{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}},
{{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}},
{{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}},
{{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}},
{{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}},
{{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}},
{{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}},
{{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}}
};
string DecToBin(int str) {//十进制转二进制的函数实现
string bin = "";
while (str >= 1) {
bin = to_string(str % 2) + bin;
str = str / 2;
}
while (bin.size() != 4) {
bin = '0' + bin;
}
return bin;
}
int BinToDec(char str) {//二进制转十进制的函数实现
return str - '0';
//字符和字符相减的本质就是ASCII码的计算,多用于字符转数字;用%d打印出来的结果是对应的ASCII码值,使用%c打印就会转义为ASCII码对应的字符解释
}
string SExchange(string right) {//S盒置换函数
string result = "";
for (int i = 0; i < 48; i = i + 6) {
int row = BinToDec(right[i]) * 2 + BinToDec(right[i + 5]);
int col = BinToDec(right[i + 1]) * 8 + BinToDec(right[i + 2]) * 4 + BinToDec(right[i + 3]) * 2 + BinToDec(right[i + 4]);
result += DecToBin(SBOX[i / 6][row][col]);
}
return result;
}
//P置换
int 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 PExchange(string right) {//P置换函数
string result = "";
for (int i = 0; i < 32; ++i) {
result += right[P[i] - 1];
}
return result;
}
string XOR(string str1, string str2) {//异或函数实现
string res = "";
for (int i = 0; i < str1.size(); i++) {
if (str1[i] == str2[i]) {
res += "0";
}
else {
res += "1";
}
}
return res;
}
//函数F函数实现
string F(string right, string key) {
string temp = EExchange(right);//用来存储right部分进行扩展置换后的中间值
temp = XOR(temp, key);//进行异或操作
string result = SExchange(temp);//进行S盒转换
result = PExchange(result);//进行P置换
return result;
}
//3:尾置换IP逆
int IPR[] = { 40, 8, 48, 16, 56, 24, 64, 32,
39, 7, 47, 15, 55, 23, 63, 31,
38, 6, 46, 14, 54, 22, 62, 30,
37, 5, 45, 13, 53, 21, 61, 29,
36, 4, 44, 12, 52, 20, 60, 28,
35, 3, 43, 11, 51, 19, 59, 27,
34, 2, 42, 10, 50, 18, 58, 26,
33, 1, 41, 9, 49, 17, 57, 25 };
string IPRExchange(string end) {//IP逆置换实现
string result = "";
for (int i = 0; i < 64; ++i) {
result += end[IPR[i] - 1];
}
return result;
}
//4:加密函数实现
string encrypt(string plain, string key) {
string cipher = "";
string temp = IPExchange(plain);//对输入明文进行初始置换IP
string left = temp.substr(0, 32);//将经过IP置换的明文串转换为左右两部分
string right = temp.substr(32);
for (int i = 0; i < 16; i++) {//进行16轮迭代
string middle = right;
right = XOR(left, F(right, roundKey[i]));
left = middle;
}
cipher = right + left;//对左右两部分进行合并
cipher = IPRExchange(cipher);//进行IP逆置换
return cipher;
}
//5:解密函数实现
string decrypt(string cipher, string key) {
string plain = "";
string temp = IPExchange(cipher);//对输入密文进行初始置换IP
string left = temp.substr(0, 32);//将经过IP置换的密文串转换为左右两部分
string right = temp.substr(32);
for (int i = 0; i < 16; ++i) {//进行16轮迭代
string middle = right;
right = XOR(left, F(right, roundKey[15-i]));
left = middle;
}
plain = right + left;//对左右两部分进行合并
plain = IPRExchange(plain);//进行IP逆置换
return plain;
}
int HexToDec(char str) {//十六进制转换为十进制的函数实现
int dec = 0;
if (str >= 'A' && str <= 'F') {
dec += (str - 'A' + 10);
}
else {
dec += (str - '0');
}
return dec;
}
//加解密函数实现结束
string HexToBin(string str) {//十六进制转换为二进制的函数实现
string bin = "";
string table[16] = { "0000","0001","0010","0011","0100","0101","0110","0111","1000","1001","1010","1011","1100","1101","1110","1111" };
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 'A'&&str[i] <= 'F') {
bin += table[str[i] - 'A' + 10];
}
else {
bin += table[str[i] - '0'];
}
}
return bin;
}
string BinToHex(string str) {//二进制转换为十六进制的函数实现
string hex = "";
int temp = 0;
while (str.size() % 4 != 0) {
str = "0" + str;
}
for (int i = 0; i < str.size(); i += 4) {
temp = (str[i] - '0') * 8 + (str[i + 1] - '0') * 4 + (str[i + 2] - '0') * 2 + (str[i + 3] - '0') * 1;
if (temp < 10) {
hex += to_string(temp);
}
else {
hex += 'A' + (temp - 10);
}
}
return hex;
}
int main() {
cout << endl << "=========================================DES加密算法=========================================" << endl;
cout << "请输入16进制明文:";
string input;//636F6D7075746572
cin >> input;
cout << "请输入16进制密钥:";
string initKey;//133457799BBCDFF1
cin >> initKey;
cout << endl;
//string input = "636F6D7075746572";
//string initKey = "133457799BBCDFF1";
string plain = HexToBin(input);
string key = HexToBin(initKey);
cout << "明文: Hex: " << input << endl;
cout << " Bin: " << plain << endl;
cout << "密钥: Hex: " << initKey << endl;
cout << " Bin: " << key << endl << endl << endl;
KeyGenerate(key);
cout << "-------------------------------------------加密中-------------------------------------------" << endl;
string cipher_bin = encrypt(plain, key);
string cipher_hex = BinToHex(cipher_bin);
cout << "密文: Hex: " << cipher_hex << endl;
cout << " Bin: " << cipher_bin << endl << endl << endl;
cout << "-------------------------------------------解密中-------------------------------------------" << endl;
string plain_gen_bin = decrypt(cipher_bin, key);
string plain_gen_hex = BinToHex(plain_gen_bin);
cout << "明文: Hex: " << plain_gen_hex << endl;
cout << " Bin: " << plain_gen_bin << endl;
}
输入:64位的明文与密钥
明文:636F6D7075746572
密钥:133457799BBCDFF1
经过子密钥生成函数KeyGenerate()生成子密钥,将明文与16轮子密钥经过加密算法encrypt()得到密文。
同样,可以运用KeyGenerate()生成的相同的子密钥,使密文经过解密算法decrypt()重新得到明文。