DES数据加密算法C++实现

  S盒用容器实现似乎更麻烦，换了三维数组，有点刻意想练习一下vector，所以有的地方不非常合适也用了，密钥和明文代码内置的（好吧大可说我不专业。。。。），都说这种1-DES都是被破解的了，当是学习了，代码如下，真有闲的蛋疼的哥们儿可以测试，没写注释（我对灯发誓以后要养成写注释的好习惯）。好了，这么多，yin句诗？

啊～春暖花开！

             

#include 
#include 


using namespace std;
typedef vector > Mat;
int pc[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};
vector pc1(pc,pc+56);
int pcc[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};
vector pc2(pcc,pcc+48);
int move_times1[16] = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
vector move_times(move_times1,move_times1+16);
int pbox[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};
vector Pbox(pbox,pbox+32);
int S[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}}};


Mat FindSubkey(vector key) //
{
vector > subkey;
vector CandD(56,0);
for(int i = 0; i < 56 ; i++ )
CandD[i] = key[pc1[i]];
for(int i = 0 ; i<16 ;i++)
{
if (move_times[i] == 1)
{
bool tmp1,tmp2;
tmp1 = CandD[0]; tmp2 = CandD[28];
for(int j = 0 ;j < 27 ;j++)
{
CandD[j] = CandD[j+1];
CandD[j+28] = CandD[j+29];
}
CandD[27] = tmp1;
CandD[55] = tmp2;
}
else if (move_times[i] == 2)
{


bool tmp1,tmp2,tmp3,tmp4;
tmp1 = CandD[0]; tmp2 = CandD[1]; tmp3 = CandD[28]; tmp4 = CandD[29];
for(int j = 0 ;j < 26 ;j++)
{
CandD[j] = CandD[j+2];
CandD[j+28] = CandD[j+30];
}
CandD[26] = tmp1;
CandD[27] = tmp2;
CandD[54] = tmp3;
CandD[55] = tmp4;
}
vector keytmp(48,0);
for(int k = 0; k < 48; k++ )
keytmp[k] = CandD[pc2[k]];
subkey.push_back(keytmp);
}


return subkey;
}
vector Xor(vector x,vector y)
{
vector result;
if(x.size() == y.size())
{
for(int i = 0; i < (int)x.size(); i++)
{
if(x[i] == y[i])
result.push_back(0);
else
result.push_back(1);
}//www.software8.co
}
return result;
}
vector ExpansionPermutation(vector source)
{
vector Tmp(48,0);
Tmp[0] = source[31];Tmp[6] = source[3];Tmp[12] = source[7];Tmp[18] = source[11];Tmp[24] = source[15];Tmp[30] = source[19];Tmp[36] = source[23];Tmp[40] = source[27];
Tmp[5] = source[4];Tmp[11] = source[8];Tmp[17] = source[12];Tmp[23] = source[16];Tmp[29] = source[20];Tmp[35] = source[25];Tmp[41] = source[28];Tmp[47] = source[0];
for(int i =0 ;i < 8 ;i++)
for(int j = 0 ; j < 4 ; j++)
{
Tmp[6*i +j +1] =source[4*i+j];
}
return Tmp;


}
vector P_box(vector source)
{
vector result(32,0);
for(int i = 0 ;i < 32 ; i++)
{
result[i] = source[pbox[i]];
}
return result;
}
vector S_box(vector source)
{
vector result(32,0);
int cnt;
int line,row,output;
int cur1,cur2;
for(cnt = 0; cnt < 8; cnt++)
{
cur1 = cnt*6;
cur2 = cnt<<2;


//计算在S盒中的行与列
line = (source[cur1]<<1) + source[cur1+5];
row = (source[cur1+1]<<3) + (source[cur1+2]<<2)
+ (source[cur1+3]<<1) + source[cur1+4];
output = S[cnt][line][row];


//化为2进制
result[cur2] = (output&0X08)>>3;
result[cur2+1] = (output&0X04)>>2;
result[cur2+2] = (output&0X02)>>1;
result[cur2+3] = output&0x01;
}
return result;


}
//www.heatpress123.net

int main()
{
Mat subkey;
vector key;
for(int i = 0 ;i < 64 ; i++)
key.push_back(1);
subkey = FindSubkey(key);
vector Plaintext(64,0);
vector Ciphertext(64,0);
vector Ltmp,Rtmp;
for(int i = 0; i < 32 ; i++)
Ltmp.push_back(Plaintext[i]);
for(int i = 32; i < 64; i++)
Rtmp.push_back(Plaintext[i]);
for(int i = 0 ; i < 16; i++)
{
vector R(32,0);
R = Xor(P_box(S_box(Xor(ExpansionPermutation(Rtmp),subkey[i]))),Ltmp);
Ltmp = Rtmp;
Rtmp = R;
}
for(int i = 0 ; i < 32 ; i++)
Ciphertext[i] = Ltmp[i];
for(int i = 32; i < 64 ; i++)
Ciphertext[i] = Ltmp[i-32];


cout<<"Plaintext:"<<endl;


for(int i=0 ;i<4; i++)
{
for(int j = 0; j < 16 ;j++)
cout<<Plaintext[16*i+j];
cout<<endl;
}
cout<<"Key:"<<endl;


for(int i=0 ;i<4; i++)
{
for(int j = 0; j < 16 ;j++)
cout<<key[16*i+j];
cout<<endl;
}
cout<<"Ciphertext:"<<endl;


for(int i=0 ;i<4; i++)
{
for(int j = 0; j < 16 ;j++)
cout<<Ciphertext[16*i+j];
cout<<endl;
}




return 0;
}