des加密算法與解密(帶流程圖)-在線瀏覽
2025-07-17 18:14本頁面
【正文】 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}}。const static char Exp_Table[] = { //擴展置換 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}。const static char KeyRar_Table[]={ 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}。void ByteToBit(bool *Out,char *In,int bits) //字節(jié)到位轉(zhuǎn)換函數(shù){ int i。ibits。1。 for(i=0。i++) Out[i]=0。ibits。}void Xor(bool *InA,const bool *InB,int length) //按位異或{ for(int i=0。i++) InA[i]^=InB[i]。 bool* key0 = new bool[56]。 bool temp。 //字節(jié)到位的轉(zhuǎn)換 for(i=0。i++) //密鑰壓縮為56位 key0[i]=keyin[KeyRar_Table[i]1]。i16。 else mov=2。kmov。m8。 for(j=m*7。j++) key0[j]=key0[j+1]。 } temp=key0[0]。m27。 key0[27]=temp。 for(m=28。m++) key0[m]=key0[m+1]。 } for(j=0。j++) //壓縮置換并儲存 key[i][j]=key0[Rar_Table[j]1]。 delete[] keyin。 bool* tmp = new bool[32]。 bool* kzmw = new bool[48]。 bool* ss
公司管理相關(guān)推薦
鄂ICP備17016276號-1