DES加密解密算法C++实现
DES加密算法并不难，是由一些简单的变换得来的，难的是要有足够的耐心。蒟蒻并不想说自己用了多久才把代码写好的。
代码：
我真的太难了QAQ
#include
using namespace std;
int jiami(){
// 明文
int mingwen[64];
cout<<"请输入16位十六进制的明文:";
string kk;
cin>>kk;
int len=kk.length();
while(len!=16){
cout<<"请重新输入16位十六进制的明文:";
cin>>kk;
len=kk.length();
}
int jishu=0;
for(int i=0;i<16;i++){
int a;
if(kk[i]>='0'&&kk[i]<='9')
a=kk[i]-'0';
else
a=kk[i]-'A'+10;
int n[4]={0};
int f=0;
while(a){
n[f]=a%2;
a=a/2;
f++;
}
mingwen[jishu*4]=n[3];
mingwen[jishu*4+1]=n[2];
mingwen[jishu*4+2]=n[1];
mingwen[jishu*4+3]=n[0];
jishu++;
}
//初始置换IP
int IP[64]={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};
// 选择运算E 32位明文扩充为48位
int E[48]={ 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 };
//64位秘钥 0123456789ABCDEF 56位的秘钥+8位校验码
int miyao[64];
cout<<"请输入16位十六进制的秘钥:";
string k_2;
cin>>k_2;
int len_2=k_2.length();
while(len_2!=16){
cout<<"请重新输入16位十六进制的秘钥:";
cin>>k_2;
len_2=k_2.length();
}
int jishu_2=0;
for(int i=0;i<16;i++){
int a;
if(k_2[i]>='0'&&k_2[i]<='9')
a=k_2[i]-'0';
else
a=k_2[i]-'A'+10;
int n[4]={0};
int f=0;
while(a){
n[f]=a%2;
a=a/2;
f++;
}
miyao[jishu_2*4]=n[3];
miyao[jishu_2*4+1]=n[2];
miyao[jishu_2*4+2]=n[1];
miyao[jishu_2*4+3]=n[0];
jishu_2++;
}
//置换选择1
int IP_1[56]={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};
//16次左移对应的位数
int weiyi[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
// 置换选择2 秘钥56->48位压缩
int IP_2[48]={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};
//S盒
int s[8][65]=
{
{
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,10,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
}
};
//P置换
int P[32]={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 };
//1初始置换
//1.1 64明文进行初始置换分左右
int mingwen_1[64];
int l[32],r[32];
for (int i=0;i<64;i++){
mingwen_1[i]=mingwen[IP[i]-1];
}
for(int i=0;i<32;i++){
l[i]=mingwen_1[i];
r[i]=mingwen_1[i+32];
}
cout<<"明文初始置换M =";
for(int i=0;i<64;i++){
if(i%64==0) cout<<" ";
cout<>YN;
cout<=0 && q<= 9){
cout<>kk;
int len=kk.length();
while(len!=16){
cout<<"请重新输入16位十六进制的密文:";
cin>>kk;
len=kk.length();
}
int jishu=0;
for(int i=0;i<16;i++){
int a;
if(kk[i]>='0'&&kk[i]<='9')
a=kk[i]-'0';
else
a=kk[i]-'A'+10;
int n[4]={0};
int f=0;
while(a){
n[f]=a%2;
a=a/2;
f++;
}
miwen[jishu*4]=n[3];
miwen[jishu*4+1]=n[2];
miwen[jishu*4+2]=n[1];
miwen[jishu*4+3]=n[0];
jishu++;
}
//初始置换IP
int IP[64]={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};
// 选择运算E 32位明文扩充为48位
int E[48]={ 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 };
//64位秘钥 0123456789ABCDEF 56位的秘钥+8位校验码
int miyao[64];
cout<<"请输入16位十六进制的秘钥:";
string k_2;
cin>>k_2;
int len_2=k_2.length();
while(len_2!=16){
cout<<"请重新输入16位十六进制的秘钥:";
cin>>k_2;
len_2=k_2.length();
}
int jishu_2=0;
for(int i=0;i<16;i++){
int a;
if(k_2[i]>='0'&&k_2[i]<='9')
a=k_2[i]-'0';
else
a=k_2[i]-'A'+10;
int n[4]={0};
int f=0;
while(a){
n[f]=a%2;
a=a/2;
f++;
}
miyao[jishu_2*4]=n[3];
miyao[jishu_2*4+1]=n[2];
miyao[jishu_2*4+2]=n[1];
miyao[jishu_2*4+3]=n[0];
jishu_2++;
}
//置换选择1
int IP_1[56]={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};
//16次左移对应的位数
int weiyi[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
// 置换选择2 秘钥56->48位压缩
int IP_2[48]={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};
//S盒
int s[8][65]=
{
{
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,10,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
}
};
//P置换
int P[32]={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 };
//1初始置换
//1.1 64密文进行逆置换分左右
int miwen_1[64];
int l[32],r[32];
for (int i=0;i<64;i++){
miwen_1[i]=miwen[IP[i]-1];
}
for(int i=0;i<32;i++){
r[i]=miwen_1[i];
l[i]=miwen_1[i+32];
}
cout<<"密文逆置换 =";
for(int i=0;i<64;i++){
if(i%64==0) cout<<" ";
cout<>YN;
cout<=0 && q<= 9){
cout<>number;
cout< 运行结果截图：
........
.......
