⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 des.txt

📁 DES加/解密算法源代码
💻 TXT
📖 第 1 页 / 共 2 页
字号:
 worka[47] = buffer[ 0];*/


 if (flg) {                                       
nbrofshift = shift[iter-1];                          //flg=1,加密
for (i = 0; i < (int) nbrofshift; i++)       //按规律key左移1或2位
{
   temp1 = kwork[0];
   temp2 = kwork[28];
   for (j = 0; j < 27; j++) 
   {
           kwork[j] = kwork[j+1];
           kwork[j+28] = kwork[j+29];
   }
  kwork[27] = temp1;
  kwork[55] = temp2;
}
 }
else if (iter> 1) {                               //flg=1,解密
nbrofshift = shift[17-iter];
for (i = 0; i < (int) nbrofshift; i++) {
temp1 = kwork[27];
temp2 = kwork[55];
for (j = 27; j>0; j--) {
kwork[j] = kwork[j-1];
kwork[j+28] = kwork[j+27];
}
kwork[0] = temp1;
kwork[28] = temp2;
}
}


/* Permute kwork - PC2  56-->48 Bi 得到48位的K[I] */
unsigned int middle4[48]={
13,16,10,23,0,4,2,27,
14,5,20,9,22,18,11,3,
25,7,15,6,26,19,12,1,
40,51,30,36,46,54,29,39,
50,44,32,47,43,48,38,55,
33,52,45,41,49,35,28,31};
p=middle4;
for (i = 0; i < 48; i++)
kn[i]=kwork[*(p+i)];
/*
kn[ 0] = kwork[13]; 
kn[ 1] = kwork[16];
 kn[ 2] = kwork[10];
 kn[ 3] = kwork[23]; 
 kn[ 4] = kwork[ 0];
 kn[ 5] = kwork[ 4]; 
kn[ 6] = kwork[ 2];
 kn[ 7] = kwork[27];
 kn[ 8] = kwork[14];
 kn[ 9] = kwork[ 5];
 kn[10] = kwork[20];
 kn[11] = kwork[ 9]; 
kn[12] = kwork[22];
 kn[13] = kwork[18];
 kn[14] = kwork[11];
 kn[15] = kwork[ 3];
 kn[16] = kwork[25]; 
 kn[17] = kwork[ 7]; 
kn[18] = kwork[15];
 kn[19] = kwork[ 6]; 
 kn[20] = kwork[26]; 
 kn[21] = kwork[19];  
 kn[22] = kwork[12];
 kn[23] = kwork[ 1]; 
kn[24] = kwork[40];
 kn[25] = kwork[51];
 kn[26] = kwork[30];
 kn[27] = kwork[36]; 
 kn[28] = kwork[46];
 kn[29] = kwork[54]; 
kn[30] = kwork[29];
 kn[31] = kwork[39];
 kn[32] = kwork[50];
 kn[33] = kwork[44]; 
 kn[34] = kwork[32]; 
 kn[35] = kwork[47]; 
kn[36] = kwork[43]; 
kn[37] = kwork[48];
 kn[38] = kwork[38];
 kn[39] = kwork[55];
 kn[40] = kwork[33]; 
 kn[41] = kwork[52]; 
kn[42] = kwork[45];
 kn[43] = kwork[41]; 
 kn[44] = kwork[49]; 
 kn[45] = kwork[35]; 
 kn[46] = kwork[28];
 kn[47] = kwork[31];*/

/* worka XOR kn */

for (i = 0; i < 48; i++)              // ???????????
worka[i] = worka[i] ^ kn[i];


for (i = 0; i < 8; i++)  
{
valindex =4*ss[i][2*worka[6*i]+worka[6*i+5]][2*(2*(2*worka[ 6*i+1]+worka[ 6*i+2])+worka[ 6*i+3])+worka[ 6*i+4]];
kn[ 4*i+0] = binary[0+valindex];
 kn[ 4*i+1] = binary[1+valindex];
 kn[ 4*i+2] = binary[2+valindex];
 kn[ 4*i+3] = binary[3+valindex];
}
/*
valindex = s1[2*worka[ 0]+worka[ 5]][2*(2*(2*worka[ 1]+worka[ 2])+worka[ 3])+worka[ 4]];
valindex = valindex * 4;
kn[ 0] = binary[0+valindex];
 kn[ 1] = binary[1+valindex];
 kn[ 2] = binary[2+valindex];
 kn[ 3] = binary[3+valindex];

valindex = s2[2*worka[ 6]+worka[11]][2*(2*(2*worka[ 7]+worka[ 8])+worka[ 9])+worka[10]]; 
valindex = valindex * 4;
 kn[ 4] = binary[0+valindex];
 kn[ 5] = binary[1+valindex]; 
 kn[ 6] = binary[2+valindex];
 kn[ 7] = binary[3+valindex];
valindex = s3[2*worka[12]+worka[17]][2*(2*(2*worka[13]+worka[14])+worka[15])+worka[16]]; 
valindex = valindex * 4;
 kn[ 8] = binary[0+valindex];
 kn[ 9] = binary[1+valindex]; 
 kn[10] = binary[2+valindex];
 kn[11] = binary[3+valindex];
valindex = s4[2*worka[18]+worka[23]][2*(2*(2*worka[19]+worka[20])+worka[21])+worka[22]]; 
valindex = valindex * 4; 
kn[12] = binary[0+valindex];
 kn[13] = binary[1+valindex];
 kn[14] = binary[2+valindex]; 
 kn[15] = binary[3+valindex];
valindex = s5[2*worka[24]+worka[29]][2*(2*(2*worka[25]+worka[26])+worka[27])+worka[28]]; 
valindex = valindex * 4; 
kn[16] = binary[0+valindex]; 
kn[17] = binary[1+valindex]; 
kn[18] = binary[2+valindex];
 kn[19] = binary[3+valindex];
valindex = s6[2*worka[30]+worka[35]][2*(2*(2*worka[31]+worka[32])+worka[33])+worka[34]]; 
valindex = valindex * 4; 
kn[20] = binary[0+valindex];
 kn[21] = binary[1+valindex]; 
 kn[22] = binary[2+valindex];
 kn[23] = binary[3+valindex];
valindex = s7[2*worka[36]+worka[41]][2*(2*(2*worka[37]+worka[38])+worka[39])+worka[40]];
 valindex = valindex * 4;
 kn[24] = binary[0+valindex]; 
 kn[25] = binary[1+valindex]; 
 kn[26] = binary[2+valindex];
 kn[27] = binary[3+valindex];
valindex = s8[2*worka[42]+worka[47]][2*(2*(2*worka[43]+worka[44])+worka[45])+worka[46]]; 
valindex = valindex * 4; 
kn[28] = binary[0+valindex]; 
kn[29] = binary[1+valindex]; 
kn[30] = binary[2+valindex]; 
kn[31] = binary[3+valindex];*/


unsigned int middle5[32]={
15,6,19,20,28,11,27,16,0,14,22,25,4,17,30,9,1,
7,23,13,31,26,2,8,18,12,29,5,21,10,3,24};
p=middle5;
for (i = 0; i < 32; i++)
worka[i]=kn[*(p+i)];

/*
worka[ 0] = kn[15]; 
worka[ 1] = kn[ 6];
 worka[ 2] = kn[19];
 worka[ 3] = kn[20];
 worka[ 4] = kn[28]; 
 worka[ 5] = kn[11]; 
worka[ 6] = kn[27]; 
worka[ 7] = kn[16]; 
worka[ 8] = kn[ 0]; 
worka[ 9] = kn[14]; 
worka[10] = kn[22];
 worka[11] = kn[25]; 
worka[12] = kn[ 4]; 
worka[13] = kn[17]; 
worka[14] = kn[30];
 worka[15] = kn[ 9];
 worka[16] = kn[ 1]; 
 worka[17] = kn[ 7]; 
worka[18] = kn[23];
 worka[19] = kn[13]; 
 worka[20] = kn[31];
 worka[21] = kn[26]; 
 worka[22] = kn[ 2]; 
 worka[23] = kn[ 8]; 
worka[24] = kn[18]; 
worka[25] = kn[12];
 worka[26] = kn[29];
 worka[27] = kn[ 5];
 worka[28] = kn[21]; 
 worka[29] = kn[10]; 
worka[30] = kn[ 3];
 worka[31] = kn[24];*/


for (i = 0; i < 32; i++) {
bufout[i+32] = bufout[i] ^ worka[i];
bufout[i] = buffer[i]; 
 } 
}//////////////////////////////////////////////////end of iter




//prepare of output
for (i =0; i < 32; i++) {
j = bufout[i];                
bufout[i] = bufout[32+i];  
bufout[32+i] = j; 
          }

unsigned int middle6[64]={
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,32,0,40,8,48,16,56,24};

p=middle6;
for (i =0; i < 64; i++) 

buffer[i]=bufout[*(p+i)];
/*
buffer[ 0] = bufout[39]; 
buffer[ 1] = bufout[ 7]; 
buffer[ 2] = bufout[47]; 
buffer[ 3] = bufout[15]; 
buffer[ 4] = bufout[55]; 
buffer[ 5] = bufout[23]; 
buffer[ 6] = bufout[63]; 
buffer[ 7] = bufout[31]; 
buffer[ 8] = bufout[38]; 
buffer[ 9] = bufout[ 6]; 
buffer[10] = bufout[46]; 
buffer[11] = bufout[14]; 
buffer[12] = bufout[54]; 
buffer[13] = bufout[22]; 
buffer[14] = bufout[62]; 
buffer[15] = bufout[30]; 
buffer[16] = bufout[37];
 buffer[17] = bufout[ 5];
 buffer[18] = bufout[45];
 buffer[19] = bufout[13];
 buffer[20] = bufout[53];
 buffer[21] = bufout[21]; 
 buffer[22] = bufout[61]; 
 buffer[23] = bufout[29];
 buffer[24] = bufout[36]; 
 buffer[25] = bufout[ 4];
 buffer[26] = bufout[44]; 
 buffer[27] = bufout[12];
 buffer[28] = bufout[52];
 buffer[29] = bufout[20]; 
 buffer[30] = bufout[60]; 
 buffer[31] = bufout[28];
 buffer[32] = bufout[35]; 
 buffer[33] = bufout[ 3]; 
 buffer[34] = bufout[43];
 buffer[35] = bufout[11]; 

buffer[36] = bufout[51];
 buffer[37] = bufout[19];
 buffer[38] = bufout[59];
 buffer[39] = bufout[27]; 
 buffer[40] = bufout[34]; 
 buffer[41] = bufout[ 2];
 buffer[42] = bufout[42]; 
 buffer[43] = bufout[10];
 buffer[44] = bufout[50]; 
 buffer[45] = bufout[18];
 buffer[46] = bufout[58];
 buffer[47] = bufout[26];
 buffer[48] = bufout[33];
 buffer[49] = bufout[ 1];
 buffer[50] = bufout[41]; 
 buffer[51] = bufout[ 9]; 
 buffer[52] = bufout[49]; 

 buffer[53] = bufout[17];
 buffer[54] = bufout[57];
 buffer[55] = bufout[25]; 
 buffer[56] = bufout[32];
 buffer[57] = bufout[ 0];
 buffer[58] = bufout[40]; 
 buffer[59] = bufout[ 8]; 

buffer[60] = bufout[48];
 buffer[61] = bufout[16];
 buffer[62] = bufout[56]; 
 buffer[63] = bufout[24];*/

/**\\64位--转为8字节   */

j = 0;
for (i = 0; i < 8; i++)
 {                 
    *(dest + i) = 0x00;                 
     for (k = 0; k < 7; k++)
	{ 
        *(dest + i) = ((*(dest + i)) + buffer[j+k]) * 2;
	}               
     *(dest + i) = *(dest + i) + buffer[j+7];
     j += 8;          
 }
//////////返回输出首地址/////////////////

//cout<<"dest:  "<<dest<<endl;

return(dest);
//////////////////////////////////////////
}


void main(){

int Fly;
unsigned int Key1[8]={0x65,0x5e,0xa6,0x28,0xcf,0x62,0x58,0x5f};
unsigned int Key2[8]={0x58,0x65,0x39,0x77,0x1f,0x22,0x53,0x77};
unsigned int Key3[8]={0x11,0x45,0x11,0x01,0x48,0x65,0x14,0x5f};
unsigned int Key4[8]={0x32,0x89,0x21,0xa1,0xaa,0xbb,0xcc,0xee};
unsigned int Key5[8]={0x89,0x56,0x32,0x15,0x8a,0x92,0x3f,0x88};

//unsigned int OutData[8];
unsigned int InData[8];
unsigned int i,m,n;
unsigned char j=1;
unsigned int *p1,*p2,*p3;
 
while(j==1){

cout<<"请选择密钥号: 1 2 3 4 5 "<<endl;
cin>>n;
switch(n){
case 1 : p2=Key1;break;                //密钥
case 2 : p2=Key2;break;  
case 3 : p2=Key3;break;  
case 4 : p2=Key4;break;  
case 5 : p2=Key5;break;  
default :  p2=Key1;n=1;break;  
}

cout<<"当前密钥号为:"<<n<<"    请输入待加/解密数据(0~255):"<<endl;
for(i=0;i<8;i++)
cin>>InData[i];
cout<<"加密 1   解密  0\n";
cin>>Fly;               //加/解密标志(1 加密  0 解密)


p1=InData;              //输入数据

p3=des(p1,p2,Fly);

//cout<<"p3:  "<<p3<<endl;

if(Fly==0)             //加/解密标志(1 加密  0 解密)
cout<<"解密结果:"<<endl;
else {Fly=1;cout<<"加密结果:"<<endl;}
for(i=0;i<8;i++)
cout<<*(p3+i)<<endl;
cout<<"继续请按 1  其它退出"<<endl;
cin>>m;
j=m;
}
return;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -