3des.cpp

３ｄｅｓ算法..按作业要求编写..希望对作业的同学有所帮助,.代码比较简明易懂

#include <stdio.h>

void IP(int a[64])   
{int ip[]={
 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 b[64];
 int x=0;
 int y;
 while(x<64)
 {y=ip[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<64)
 {a[x]=b[x];
  x++;}
}

void PC1(int a[64])
{int pc1[]={
 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 x=0;
 int y;
 int b[64];
 while(x<56)
 {y=pc1[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<56)
 {a[x]=b[x];
 x++;}
}

void LCS(int a[64],int b)  //Left circular shift,b为左移位数
{unsigned int x,y;
 while(b>0)
 {x=0;
  y=a[x];
  while(x<27)
  {a[x]=a[x+1];
  x++;}
  a[x]=y;
  x++;
  y=a[x];
  while(x<55)
  {a[x]=a[x+1];
   x++;}
  a[x]=y;
  b--;}
}

void PC2(int a[64])
{int pc2[]={
 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 x=0;
 int y;
 int b[64];
 while (x<48)
 {y=pc2[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<48)
 {a[x]=b[x];
  x++;}
}

void E(int a[64])
{int e[]={
 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 b[64];
 int x=0;
 int y;
 while(x<48)
 {y=e[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<48)
 {a[x]=b[x];
  x++;}
}

void XOR(int a[64],int b[64])
{int x=0;
 int t,y,z;
 while(x<48)
 {y=a[x];
  z=b[x];
  if(y+z==1) t=1;
  else t=0;
  a[x]=t;
  x++;}
}

void SBOX(int a[64])
{int sbox[32][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};
 int c,d,e,f,g,h,i,j,k;
 int z=0;
 while(z<8) 
 {c=a[6*z];
  d=a[6*z+1];
  e=a[6*z+2];
  f=a[6*z+3];
  g=a[6*z+4];
  h=a[6*z+5];
  i=2*c+h;
  j=8*d+4*e+2*f+g;
  k=sbox[4*z+i][j];
  d=(k&8)/8;
  e=(k&4)/4;
  f=(k&2)/2;
  g=k&1;
  a[4*z]=d;
  a[4*z+1]=e;
  a[4*z+2]=f;
  a[4*z+3]=g;
  z++;}
}

void P(int a[64])
{int p[]={
 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 x=0;
 int y;
 int b[64];
 while(x<32)
 {y=p[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<32)
 {a[x]=b[x];
  x++;}
}

void NIP(int a[64])   //IP-1
{int nip[]={
 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 b[64];
 int x=0;
 int y;
 while(x<64)
 {y=nip[x];
  b[x]=a[y-1];
  x++;}
 x=0;
 while(x<64)
 {a[x]=b[x];
  x++;}
}

void main()
{char a[9],b[9],i[9];
 int d[64],e[64],f[64],g[64],h[64],j[9];
 int x,y,z;
 int c[]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};
 int k[]={0,27,26,26,26,26,26,26,27,26,26,26,26,26,26,27};
 printf("请输入八个字符\n");
 gets(a);
 printf("请输入八位密钥1\n");
 gets(b);
 printf("请输入八位密钥2\n");
 gets(i);
 x=0;
 z=0;
 while (z<8) //转换明文字符为二进制
 {y=int(a[z]);
  if(y<0) y=y+256;
  else y=y;
  d[x]=(y/128)%2;
  x++;
  d[x]=(y/64)%2;
  x++;
  d[x]=(y/32)%2;
  x++;
  d[x]=(y/16)%2;
  x++;
  d[x]=(y/8)%2;
  x++;
  d[x]=(y/4)%2;
  x++;
  d[x]=(y/2)%2;
  x++;
  d[x]=y%2;
  x++;
  z++;}
 IP(d);      //IP,d数组准备进入Round1
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(b[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,c[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(i[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 IP(d);
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,k[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(b[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 IP(d);
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,c[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 while(x<8)
 {y=128*d[8*x]+64*d[8*x+1]+32*d[8*x+2]+16*d[8*x+3]+8*d[8*x+4]+4*d[8*x+5]+2*d[8*x+6]+d[8*x+7];
  if(y<0) y=y+256;
  else y=y;
  j[x]=y;
  x++;}
 printf("密文为\n");
 /*x=0;
 while(x<8)
 {printf("%d\n",j[x]);
  x++;}*/
 x=0;
 while(x<8)
 {printf("%c",j[x]);
  x++;}
 printf("\n");
  
 //解密开始
 printf("请输入八位密钥1\n");
 gets(b);
 printf("请输入八位密钥2\n");
 gets(i);
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(b[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 IP(d);
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,k[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(i[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 IP(d);
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,c[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 z=0;
 while (z<8) //转换密文字符为二进制
 {y=int(b[z]);
  if(y<0) y=y+256;
  else y=y;
  e[x]=(y/128)%2;
  x++;
  e[x]=(y/64)%2;
  x++;
  e[x]=(y/32)%2;
  x++;
  e[x]=(y/16)%2;
  x++;
  e[x]=(y/8)%2;
  x++;
  e[x]=(y/4)%2;
  x++;
  e[x]=(y/2)%2;
  x++;
  e[x]=y%2;
  x++;
  z++;}
 IP(d);
 PC1(e);     //PC1,e数组前56位有效
 x=0;
 while(x<16)  //Round start
 {LCS(e,k[x]);  //循环左移
  y=0;
  while(y<56) //g为下一Round所用
  {g[y]=e[y];
   y++;}
  PC2(e); //PC2
  y=0;
  while(y<32) //f为下一Round所用
  {f[y]=d[y+32];
   y++;}
  y=0;
  while(y<32)
  {h[y]=d[y+32];
   y++;}
  E(h);  //E
  XOR(h,e);  //XOR，h数组为异或后数组，前48位有效
  SBOX(h);  //SBOX,h数组前32位有效
  P(h);     //P,h数组前32位有效
  XOR(h,d); //XOR，h数组为异或后数组，前32位有效
  y=0;
  while(y<32)
  {f[y+32]=h[y];
   y++;} 
  y=0;
  while(y<64)  //把f,g赋值给d,e
  {d[y]=f[y];
   y++;}
  y=0;
  while(y<64)
  {e[y]=g[y];
   y++;
  }
  x++;
 }                   //Round over
 x=0;                //32bit-swap  
 while(x<32)
 {h[x]=d[x+32];
  x++;}
 x=0;
 while(x<32)
 {d[x+32]=d[x];
  x++;}
 x=0;
 while(x<32)
 {d[x]=h[x];
  x++;}  
 NIP(d);             //IP-1
 x=0;
 while(x<8)
 {y=128*d[8*x]+64*d[8*x+1]+32*d[8*x+2]+16*d[8*x+3]+8*d[8*x+4]+4*d[8*x+5]+2*d[8*x+6]+d[8*x+7];
  if(y<0) y=y+256;
  else y=y;
  j[x]=y;
  x++;}
 printf("明文为\n");
 x=0;
 while(x<8)
 {printf("%c\040",j[x]);
  x++;}
 printf("\n");
}