好文档就是一把金锄头!
欢迎来到金锄头文库![会员中心]
电子文档交易市场
安卓APP | ios版本
电子文档交易市场
安卓APP | ios版本

DES加密解密的C++源程序.doc

9页
  • 卖家[上传人]:ss****gk
  • 文档编号:281144331
  • 上传时间:2022-04-23
  • 文档格式:DOC
  • 文档大小:105.50KB
  • / 9 举报 版权申诉 马上下载
  • 文本预览
  • 下载提示
  • 常见问题
    • DES加密解密的C++源程序-测试版本,希望人家多多交流# include#include"stdio.h"#includeHmath.h"include "string.h"static char key[16][48];static char Hex[16][4];////IP 置换intIP[64]={58,50,42,34,26,18,10,2a60,52,44,36,28,20,12,4,、62,54,46,38,30,22,14,6a64,56,48,40,32,24,16,&\57.49.41.33.25.17.9.1, \59,51,43,35,27,19,11,3a61,53,45,37,29,21,13,5a63,55,47,39,31,23,15,7 \};//IP-1置换可根据IP表牛•成int IP_1[64]={40,8,48,16,56,24,64,32a39,7,47,15,55,23,63,31a38,6,46,14,54,22,62,30,\37,5,45,13,53,21,61,29a36,4,44,12,52,20,60,2&\35,3,43,11,51,19,59,27a34,2,42,10,50,18,58,26z\33,1,41,9, 49,17,57,25 \};〃E扩展int E[48]={32.1, 2Z 3, 4, 5,4, 5, 6, 7, 8, 9Z8, 9, 10,11,1243,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};//PC-1 置换。

      int PC_1[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};//PC-2 置换int PC_2[48]={14,17,11,244,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};//P置换int P[32]={16,7,20,21,29,12,28,17,1,15,23,26,5J&31,10,2,8,24,14,32,2739,19,13,30,6,22,11,4,25};intS[8][4][16]=〃S盒1 S盒都可以口己设置{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,〃s盒215,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,1269,3,2,15,13,8,10,1345,4,241,6,7,12,0,5,14,9, 〃S盒310,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,I, 10,13,0,6,9,8,7,4,15,14,3,11,5,2,12, 〃S盒47,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,乙 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, 〃S盒52,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,141,10,13,7,8,15,9,12,5,6,3,0,14,II, 8,12,7,1,14,2,13,6,15,0,9,10,4,5,3, 〃S盒612,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,24 乙 9,5,15,10,11,14,1,7,6,0,8,13, 〃S盒74,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1,13,0,117,4,9,1,10,14,3,5,12,2,15,8,6,1,4,11,13,12,37,14,10,15,6,8,0,5,9,2,13,8,2,4)0,7,9,5,0,15,14,2,3,12, 〃S盒813,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,843,15,12,9,0,3,5,6,11 };voidlnit_Hex() void LSfchar src[28],char dist[28],int n)〃将28比特的字符串循环左移n位 {for(int i=0;i<28;i卄)dist[i] = src[(28-n+i)%28];}void Decompose_56(char src[56],char distl[28],char dist2[28])〃将56比特的字符串分解为2个28比特的字符串}void Decompose_64(char src[64],char distl[32],char dist2[32])〃将一个64比特的字符串分解为两个32位的字符串{}void Combine_56(char srcl[28],char src2[28],char dist[56])〃将两个28比特的字符串合并成一个56比特的字符串 {}void Combine_64(char srcl[32],char src2[32],char dist[64])〃将两个32比特的字符串合并成一个64比特的字符串{for(int i=0;i<32;i++)dist[i] = srcl[i];for(int j=32;j<64;j++)dist[j] = src2[j-32];}void PC_l_Permutation(char src[64],char dist[56])//PC-1置换{for(int i=0;i<56;i++)dist[i] = src[PC_l[i]-l];}void PC_2_Permutation(char src[56],char dist[48])//PC-2置换{for(int i=0;i<64;i++)dist[i] = src[PC_2[i]-l];}voidlP_Permutation(char src[64],char dist[64])//IP置换{for(int i=0;i<64;i++)dist[i] = src[IP[i]-l];}void IP_l_Permutation(char src[64],char dist[64])//IP的逆置换for(int i =0;i<64;i++)dist[i]=src[IP_l[i]-l];voidE_Permutation(char src[32],char dist[48])//E置换{for(int i=0;i<48;i++)dist[i] = src[E[i]-l];}voidP_Permutation(char src[32],char dist[32])〃P置换{for(int i=0;i<32;i++)dist[i] = src[P[i]-l];}voidStrCpy(char src[],char dist[],int n)〃字符串的复制{for(int i=O;ivn;i++)dist[i] = src[i];}voidS_Permutation(char src[6],char dist[4],int n)〃第n个S盒的置换{lnit_Hex();inti,jzk,m[4];i=n;jf((src[O]==,O,)&&(src[5]==,0,))j = 0;else if((src[O]==*O')&&(src[5]=='l'))j = l;else if((src[O]=T)&&(src[5]==,0,))j = 2;elsej = 3;for(inttempl;temp_iv5;temp_i++){if(src[temp_i] =='l')m[temp_i-l] = 1;elsem[temp_i-l] = 0;}k = m[3]+2*m[2]+4*m[l]+8*m[3];StrCpy(Hex[(S[i][j][k])],dist,4);} voidMake_Key(char k[64])〃产生密钥charTemp_Key[56];PC_l_Permutation(k,Temp_Key);charTemp_C[28]/Temp_D[28]/Temp_C0[28],Temp_D0[28];Decompose_56(Temp_Key,Temp_C0,Temp_D0);for(int i=0;i<16;i++){if((i==O) 11 (i==l) 11 (i==8)| | (i==15)){LS(Tem p_CO,Te m p_C, 1);LS(Tem p_DO,Te mp_D,l);}else{LS(Tem p_CO,Te m p_C, 2);LS(Temp_D0,Temp_D,2);}Combine_56(Temp_C,Temp_D,key[i]);StrCpy(Tem p_CO,Te m p_C,28);StrCpy(Temp_D0,Temp_D,28);}}void XOR(char src[48],char dist[48])〃将两个48比特的字符串进行异或{for(int i=0;i<48;i++)。

      点击阅读更多内容
      关于金锄头网 - 版权申诉 - 免责声明 - 诚邀英才 - 联系我们
      手机版 | 川公网安备 51140202000112号 | 经营许可证(蜀ICP备13022795号)
      ©2008-2016 by Sichuan Goldhoe Inc. All Rights Reserved.