热门搜索 :
考研考公
您的当前位置:首页正文

C语言DES加密解密算法

来源:伴沃教育


加密

/* Note:Your choice is C IDE */ #include \"stdio.h\"

int a1[64];

int am[64];

int nizhi[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 miyaohe[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 L[17][32],R[17][32],RE[48],C[16][28],D[16][28],key[56],cc[28],dd[28],Sya[32],yh[48],LS;

int a2[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},//扩展E盒

miyao[16][48];

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 She[512]={ //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

};//S盒表

int Phe[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},Phes[32]; void miyaocs()// C与D产生 {

int i,n,m;

//密钥PC1产生 for(i=0;i<=55;i++)

key[i]=am[miyaohe[i]-1]; //cc,dd产生 for(i=0;i<=27;i++) {

cc[i]=key[i];dd[i]=key[i+28]; }

//Ci与Di的产生

for(n=0;n<=15;n++) {

if(n==0||n==1||n==8||n==15) {

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

if(n==0) {C[n][i]=cc[(i+1)%28];D[n][i]=dd[(i+1)%28];} else {C[n][i]=C[n-1][(i+1)%28];D[n][i]=D[n-1][(i+1)%28];} } }

else { for(i=0;i<=27;i++)

{

C[n][i]=C[n-1][(i+2)%28]; D[n][i]=D[n-1][(i+2)%28];

}

} }

//密钥的产生

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

for(n=0;n<=27;n++)

}

{key[n]=C[i][n];key[n+28]=D[i][n];} for(m=0;m<48;m++)

{miyao[i][m]=key[PC2[m]-1];} }

void main() {

int b[64],i,j,k,z,n,miwen[64],nimi[64],aam2[64];

char aa[8],ab[16],aam[8]; //置换

//明文输入

printf(\"请输入明文:\"); for(i=0;i<8;i++) {

scanf(\"%x\ }

k=strlen(aa);

printf(\"明文长度%d\ if(k<8)

{ for(i=k;k<8;i++) aa[i]=' ';}

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

n=0x80;

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

k=aa[j]&n; k>>=(7-i); n>>=1;

a1[j*8+i]=k; } }

//密钥输入

printf(\"\\n请输入密钥:\"); for(i=0;i<8;i++) {

scanf(\"%x\ }

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

n=0x80;

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

k=aam[j]&n; k>>=(7-i); n>>=1;

aam2[j*8+i]=k; } }

/*

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

if(i%8==0) printf(\"\\n\"); printf(\"%d\

} */

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

for(j=0;j<=7;j++) }

/*

for(i=0;i<=63;i++) { }

printf(\"\\n\"); */

//第一次置换 for(n=0;n<=1;n++) {

{

am[i*8+j]=aam2[i*8+j]; }

if(i%8==0) printf(\"\\n\"); printf(\"%d\

for(j=0;j<=6;)

{

for(i=7;i>=0;i--) {

if(n==0){ k=7-i+j/2*8;z=8*i+1+j;} else {k=7-i+j/2*8+32;z=8*i+j;} b[k]=a1[z]; } j=j+2; } }

printf(\"置换1显示\\n\"); for(i=0;i<=63;i++) {

if(i%8==0) printf(\"\\n\"); printf(\"%d\\ }

miyaocs();//密钥产生

//L,R产生 for(i=0;i<32;i++)

{

L[0][i]=b[i];R[0][i]=b[i+32]; }

//轮改

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

//E盒扩展R for(i=0;i<=47;i++) {

RE[i]=R[j][a2[i]-1]; }

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

yh[i]=RE[i]+miyao[j][i]; if(yh[i]>1) yh[i]=0;

}

//S盒的压缩

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

//n=i%16;//列

k=yh[i*6]*2+yh[i*6+5]; //行

n=yh[i*6+1]*8+yh[i*6+2]*4+yh[i*6+3]*2+yh[i*6+4];//列 //k=i%4;//行 /*

Sya[4*i+3]=She[k][n]/8; Sya[4*i+2]=She[k][n]%8/4; Sya[4*i+1]=She[k][n]%8%4/2; Sya[4*i]=She[k][n]%2; */

LS=She[k*16+n+i*64]; for(z=0;z<=3;z++) {

Sya[4*i+3-z]=LS%2; } }

//P置换

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

Phes[i]=Sya[Phe[i]-1]; }

//Ri+1 Li+1 for(i=0;i<=31;i++) {

R[j+1][i]=L[j][i]+Phes[i]; if((R[j+1][i])>1)R[j+1][i]=0; L[j+1][i]=R[j][i]; }

}

//轮改后密文

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

miwen[i]=R[16][i];miwen[i+32]=L[16][i]; }

LS=LS/2;

//逆密文

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

nimi[i]=miwen[nizhi[i]-1]; }

//密文2讲制显示

printf(\"\\n密文2进制显示\"); for(i=0;i<=63;i++) {

if(i%8==0) printf(\"\\n\"); printf(\"%d\\

}

//转换密文16进制

printf(\"\\n密文16进制显示\\n\"); for(j=0;j<=7;j++) {

k=0; n=0x01; z=0;

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

k=nimi[j*8+i]&n; k<<=(7-i); z=z+k; } ab[j]=z; }

printf(\"\\n\"); for(i=0;i<=7;i++) printf(\"%x\

//原明文

printf(\"\\n原明文显示\\n\"); for(i=0;i<=63;i++) {

nimi[i]=b[nizhi[i]-1]; }

printf(\"\\n\");

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

if(i%8==0) printf(\"\\n\"); printf(\"%d\\ } /*

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

printf(\"\\n\"); for(i=0;i<=27;i++) {

if(i%7==0) printf(\"\\n\"); printf(\"%d\\ }

printf(\"\\n\");

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

if(i%7==0) printf(\"\\n\"); printf(\"%d\\ } }*/

//C与D显示

printf(\"\\nC与D显示\\n\"); for(i=1;i<=16;i++) {

printf(\"\\n\");

printf(\"C[%d]\\n\ for(j=0;j<=27;j++) {

printf(\"%d\ }

printf(\"\\n\"); printf(\"D[%d]\\n\ for(j=0;j<=27;j++) {

printf(\"%d\ } }

//R与L显示

printf(\"\\nR与L显示\\n\"); for(i=1;i<=16;i++) {

printf(\"\\n\"); printf(\"L[%d]\\n\ for(j=0;j<=31;j++) {

printf(\"%d\ }

printf(\"\\n\");

printf(\"R[%d]\\n\ for(j=0;j<=31;j++) {

printf(\"%d\ } } while(1); }

解密

/* Note:Your choice is C IDE */ #include \"stdio.h\"

int a1[64]; int am[64];

int nizhi[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};

miyaohe[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 L[17][32],R[17][32],RE[48],C[16][28],D[16][28],key[56],cc[28],dd[28],Sya[32],yh[48],LS;

int a2[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},//扩展E盒

miyao[16][48];

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 She[512]={ //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

};//S盒表

int Phe[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},Phes[32]; void miyaocs()// C与D产生 {

int i,n,m;

//密钥PC1产生 for(i=0;i<=55;i++)

key[i]=am[miyaohe[i]-1]; //cc,dd产生 for(i=0;i<=27;i++) {

cc[i]=key[i];dd[i]=key[i+28]; }

//Ci与Di的产生 for(n=0;n<=15;n++)

{

if(n==0||n==1||n==8||n==15) {

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

if(n==0) {C[n][i]=cc[(i+1)%28];D[n][i]=dd[(i+1)%28];} else {C[n][i]=C[n-1][(i+1)%28];D[n][i]=D[n-1][(i+1)%28];} } }

else { for(i=0;i<=27;i++)

{C[n][i]=C[n-1][(i+2)%28]; D[n][i]=D[n-1][(i+2)%28];} } }

//密钥的产生 }

void main() {

int b[64],i,j,k,z,n,miwen[64],aa[16],nimi[64],aam2[58]; char ab[16],aam[7]; //置换 //明文输入

printf(\"请输入密文:\"); for(i=0;i<=15;i++) scanf(\"%x\

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

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

for(n=0;n<=27;n++)

{key[n]=C[i][n];key[n+28]=D[i][n];} for(m=0;m<48;m++)

{miyao[i][m]=key[PC2[m]-1];} }

k=0;

n=0x08;

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

k=aa[j]&n; k>>=(3-i); n>>=1; a1[j*4+i]=k; } }

//密钥输入

printf(\"\\n请输入密钥:\"); scanf(\"%s\

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

n=0x80; for(i=0;i<=7;i++) {

k=aam[j]&n; k>>=(7-i); n>>=1;

aam2[j*8+i]=k;

} }

/*

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

if(i%8==0) printf(\"\\n\"); printf(\"%d\

} */

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

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

if(j==7) am[i*8+7]=0;

else am[i*8+j]=aam2[i*7+j];

} }

for(n=0;n<=1;n++) {

for(j=0;j<=6;)

{

for(i=7;i>=0;i--) {

if(n==0){ k=7-i+j/2*8;z=8*i+1+j;} else {k=7-i+j/2*8+32;z=8*i+j;}

b[k]=a1[z]; } j=j+2;

} }

printf(\"置换1显示\\n\"); for(i=0;i<=63;i++) {

if(i%8==0) printf(\"\\n\"); printf(\"%d\\ }

miyaocs();//密钥产生

//L,R产生 for(i=0;i<32;i++) {

L[0][i]=b[i];R[0][i]=b[i+32]; }

//轮改

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

//E盒扩展R for(i=0;i<=47;i++) {

RE[i]=R[j][a2[i]-1]; }

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

{

yh[i]=RE[i]+miyao[15-j][i]; if(yh[i]>1) yh[i]=0; }

//S盒的压缩 for(i=0;i<=7;i++) {

//n=i%16;//列

k=yh[i*6]*2+yh[i*6+5]; //行

n=yh[i*6+1]*8+yh[i*6+2]*4+yh[i*6+3]*2+yh[i*6+4];//列 //k=i%4;//行 /*

Sya[4*i+3]=She[k][n]/8; Sya[4*i+2]=She[k][n]%8/4; Sya[4*i+1]=She[k][n]%8%4/2; Sya[4*i]=She[k][n]%2; */

LS=She[k*16+n+i*64]; for(z=0;z<=3;z++)

{

Sya[4*i+3-z]=LS%2; LS=LS/2; }

}

//P置换

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

Phes[i]=Sya[Phe[i]-1]; }

//Ri+1 Li+1 for(i=0;i<=31;i++) {

R[j+1][i]=L[j][i]+Phes[i]; if((R[j+1][i])>1)R[j+1][i]=0; L[j+1][i]=R[j][i]; }

}

//轮改后密文

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

{

miwen[i]=R[16][i];miwen[i+32]=L[16][i]; }

//置换密文 for(i=0;i<=63;i++) {

nimi[i]=miwen[nizhi[i]-1]; }

//明文2进制显示

printf(\"\\n明文2进制显示\"); for(i=0;i<=63;i++) {

if(i%8==0) printf(\"\\n\"); printf(\"%d\\

}

//转换密文16进制 for(j=0;j<=15;j++) {

k=0; n=0x01; z=0;

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

{

k=nimi[j*8+i]&n;

k<<=(7-i); z=z+k; }

ab[j]=z;

}

printf(\"\\n\");

printf(\"明文显示\"); for(i=0;i<=7;i++) printf(\"%c\

//原密钥

printf(\"\\n原密钥显示\\n\"); for(i=0;i<=63;i++) {

nimi[i]=b[nizhi[i]-1]; }

printf(\"\\n\");

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

if(i%8==0) printf(\"\\n\"); printf(\"%d\\ } /*

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

printf(\"\\n\"); for(i=0;i<=27;i++) {

if(i%7==0) printf(\"\\n\"); printf(\"%d\\ }

printf(\"\\n\");

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

if(i%7==0) printf(\"\\n\"); printf(\"%d\\ } }*/ }

因篇幅问题不能全部显示,请点此查看更多更全内容

Top