351.cpp

DES加/解密算法源代码

//＃include msp430x41x.h
#include <math.h>
#include<iostream.h>
//source 待加/解密数据(8bytes)
//inkey  输入密钥(8bytes)
//flg加/解密标志  1为加密   0为解密
//返回加/解密好的数据(8bytes)
unsigned int *des(unsigned int *source,unsigned int * inkey, int flg) {
unsigned int ss[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 }
};

unsigned int shift[16] = { 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 };

unsigned int binary[64] = { 
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1,0, 0, 0, 1, 0, 1, 0, 
1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 
0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1 };

unsigned int middle1[64]={
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,56,48,40,32,24,16,8,0,58,50,42,34,26,18,10,2,60,52,44,36,
28,20,12,4,62,54,46,38,30,22,14,6};

unsigned int middle2[56]={
56,48,40,32,24,16,8,0,57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,
59,51,43,35,62,54,46,38,30,22,14,6,61,53,45,37,29,21,13,5,60,52,44,36,
28,20,12,4,27,19,11,3};

unsigned int middle3[48]={
31,0,1,2,3,4,3,4,5,6,7,8,7,8,7,8,9,10,11,12,11,12,13,14,15,16,17,18,
19,20,19,20,21,22,23,24,23,24,25,26,27,28,27,28,29,30,31,0};

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};

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};

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};

unsigned int bufout[64],kwork[56], worka[48], kn[48], buffer[64], key[64]; 
unsigned int nbrofshift, temp1, temp2;
int valindex;
unsigned int OutData1[8];
unsigned int i, j, k, iter;
unsigned int *dest=OutData1;
unsigned int *p;
//8字节转换为64位

for (i = 0; i < 8; i++) {
j = *(inkey + i);           //取一个字节：分8位
key[8*i] =   (j / 128) % 2;
key[8*i+1] = (j / 64) % 2;
key[8*i+2] = (j / 32) % 2;
key[8*i+3] = (j / 16) % 2;
key[8*i+4] = (j / 8) % 2;
key[8*i+5] = (j / 4) % 2;
key[8*i+6] = (j / 2) % 2;
key[8*i+7] = j % 2;
}



for (i = 0; i < 8; i++) {
	j = *(source + i);
buffer[8*i] = (j  / 128) % 2;
buffer[8*i+1] = (j / 64) % 2;
buffer[8*i+2] = (j / 32) % 2;
buffer[8*i+3] = (j / 16) % 2;
buffer[8*i+4] = (j / 8) % 2;
buffer[8*i+5] = (j / 4) % 2;
buffer[8*i+6] = (j / 2) % 2;
buffer[8*i+7] = j % 2;
}


/* Initial Permutation of Data */

p=middle1;
for(i=0;i<64;i++)
bufout[i]=buffer[*(p+i)];

/* Initial Permutation of Key */

p=middle2;
for(i=0;i<56;i++)
kwork[i]=key[*(p+i)];

////////////////////////////////////////////////////////////////////////////////////////// iter begin
for (iter = 1; iter < 17; iter++) {


for (i = 0; i < 32; i++)  buffer[i] = bufout[32+i];

p=middle3;
for (i = 0; i < 48; i++)
worka[i]=buffer[*(p+i)];


 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] */

p=middle4;
for (i = 0; i < 48; i++)
kn[i]=kwork[*(p+i)];


/* 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]][8*worka[ 6*i+1]+4*worka[ 6*i+2]+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];
}



p=middle5;
for (i = 0; i < 32; i++)
worka[i]=kn[*(p+i)];



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; 
          }



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

buffer[i]=bufout[*(p+i)];




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;          
 }
//////////返回输出首地址/////////////////
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 InData[8]={0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01};
unsigned int i,m,n;
unsigned char j=1;
unsigned int *p1,*p2,*p3;


int flg=0;
if(flg==0){        ///////////////////////////////////////



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<<endl<<"加密 1   解密  0\n";
cin>>Fly;               //加/解密标志（1 加密  0 解密）
p1=InData;              //输入数据
p3=des(p1,p2,Fly);
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;
}

}                               ////////flg
else{






for(i=0;i<100;i++)
{
p1=InData;
p2=des(p1,Key1,1);
for(m=0;m<8;m++)
{

InData[m]=*(p2+m);
if(InData[m]>=100)
cout<<*(p2+m)<<"     ";
else if(InData[m]>=10)  
cout<<*(p2+m)<<"      ";
else  cout<<*(p2+m)<<"       ";

}

cout<<"******"<<i<<endl;
}



}             ////////////////////flg
return;
}