简单叙述des算法c语言,DES算法

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

有人能帮我看看DES算法吗？

下面是C代码，调试无错误，但是运行不出结果

改了很多次，特别无奈

#include

#include

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

};

int pi[64]={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,

};

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

};

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

};

int PC1[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

};

int PC2[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

};

int S[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,6,8,5,3,15,13,0,14,9,

14,11,2,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,12 },

{

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 }

};

//8位字符扩展成64位二进制数

void CtoB(char array1[],int array2[] )

{

int i,j;

for(i=0;i<8;i++)

{

for(j=0;j<8;j++)

{

array2[8*(i+1)-1-j]=(array1[i]>>j)&1;

}

}

};

//ip置换表(将输入的第58位换到第一位，第50位换到第二位，以此类推)

//根据IP表中的数据确定输入表中各位数据的重新排列顺序

void replace(int array1[],int array2[],int p[],int n){

int i,j;

for(i=0;i

{j=p[i];

array2[i]=array1[j];

}

};

//S盒的扩展

void sbox(int array1[48],int array2[32],int S[8][4][16])

{int a[8];

int i,j=0;

for(i=0;i<48;i=i+6)

{

a[j]=S[j][array1[i]*2+array1[i+5]][array1[i+1]*8+

array1[i+2]*4+array1[i+3]*2+array1[i+4]];

j++; //i=i+6 限定只运行8次

}

for(j=0;j<8;j++)

for(i=0;i<4;i++){

array2[4*(j+1)-1-i]=a[j]%2; //四个bit为一组(3,7,11,15)倒序存储

a[j]=a[j]/2;

}

};

void Xor(int *inA,int *inB,int len) //异或

{

int i;

for(i=0;i

{*(inA+i)=*(inA+i)^*(inB+i);}

};

//秘钥循环左移

void left(int C0[28],int C1[28],int leftcount){

int i;

for(i=0;i<28;i++){

C1[i]=C0[(i+leftcount)%28];

}

};

//子秘钥的产生

void Key_out(int array1[64],int k[16][48]){

int l=1,r=2,leftcount=0;

int i,j,C[28],D[28];

int out_c[16][28]={0};

int out_d[16][28]={0};

int pc_2[16][56]={0};

int pc_1[56]={0};

replace(array1,pc_1,PC1,56);//调用PC1表

for(i=0;i<28;i++) {

C[i]=pc_1[i];

D[i]=pc_1[i+28]; } //定义C0，D0

//根据LS移位表左移

for(i=1;i<17;i++){

{if(i==1||i==2||i==9||i==16)

{ leftcount+=l;

left(C,out_c[i-1],leftcount);

left(D,out_d[i-1],leftcount);

}

else leftcount+=r;

left(C,out_c[i],leftcount);

left(D,out_d[i],leftcount);

}

}

for(i=0;i<16;i++){

for(j=0;j<28;j++){

pc_2[i][j]=out_c[i][j];

pc_2[i][j+28]=out_d[i][j];

}

for(i=0;i<16;i++){

replace(pc_2[i],k[i],PC2,48); //调用PC2表

}

}

};

void f(int array1[32],int array2[32],int k[48]){ //f函数轮转变换

int temp[48]={0};

int temp_1[32]={0};

replace(array1,temp,E,48); //调用E表

Xor(temp,k,48);

sbox(temp,temp_1,S);

replace(temp_1,array2,P,32); //调用P表

};

// 明文 密钥 加密后的铭文

void DES(char array1[9],char key_in[9],int array2[64]){

int IP[64]={0};//存储初始置换后的矩阵

int array_2[64]={0};

int k1[16][48];

int cTob[64]={0};

int Key[64];

int L[17][32],R[17][32];

int i,j,t;

CtoB(array1,cTob);

replace(cTob,IP,ip,64); //调用IP表

CtoB(key_in,Key);

Key_out(Key,k1);

for(i=0;i<32;i++){

L[0][i]=IP[i];

R[0][i]=IP[i+32];

}

for(j=1;j<16;j++) { //前15**作

for(i=0;i<32;i++)

{

L[j][i]=R[j-1][i];

}

f(R[j-1],R[j],k1[j-1]);

Xor(R[j],L[j-1],32); }

//最后一**作

for(t=0;t<32;t++) {

L[16][t]=R[15][t];

}

f(R[15],R[16],k1[15]);

Xor(R[16],L[15],32);

for(t=0;t<32;t++){

array_2[t]=L[16][t];

array_2[t+32]=R[16][t];

replace(array_2,array2,pi,64); //调用pi表

}

};

int main(){

char a1[9],a2[9];

int array2[64];

int i;

printf("输入要加密的8个字符\n");

gets(a1);

printf("input8位K秘钥\n");

gets(a2);

DES(a1,a2,array2);

printf("密文如下：\n");

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

{

printf("%d",array2[i]);

if((i+1)%4==0) printf("\n");

}

return 0;

}