操屁眼的视频在线免费看,日本在线综合一区二区,久久在线观看免费视频,欧美日韩精品久久综

新聞資訊

    目錄

    DES簡(jiǎn)介

    DES（Data ），數(shù)據(jù)加密標(biāo)準(zhǔn)，于1977年被美國(guó)國(guó)家標(biāo)準(zhǔn)局采納為聯(lián)邦信息處理標(biāo)準(zhǔn)46，這個(gè)算法本身指的是數(shù)據(jù)加密算法（DEA）。DES采用的是64位分組長(zhǎng)度和56位的密鑰長(zhǎng)度，其算法原理是基于進(jìn)行的改進(jìn)。雖然其安全性已被證明不再安全，但理解它的算法原理對(duì)于密碼學(xué)的學(xué)習(xí)有重要幫助。

    本篇博客基于計(jì)算機(jī)網(wǎng)絡(luò)安全的實(shí)驗(yàn)題目進(jìn)行撰寫(xiě)，主要介紹DES的加解密原理，以及給出用C語(yǔ)言實(shí)現(xiàn)單個(gè)分組加密的代碼。

    一、DES加密算法

    對(duì)于任意的加密方案，總有兩個(gè)輸入：明文和密鑰。DES的明文長(zhǎng)度為64位，密鑰長(zhǎng)度為56位（以64位輸入，經(jīng)算法處理自動(dòng)生成56位密鑰）

    其加密過(guò)程大致如下圖所示：

    首先對(duì)輸入的64位明文進(jìn)行初始置換（基于初始置換表），打亂順序，再經(jīng)過(guò)16輪輪函數(shù)的處理，最后將左右的32位進(jìn)行互換，送入逆初始置換表進(jìn)行逆初始置換，得到加密后的結(jié)果。

    輪函數(shù)的過(guò)程及輪密鑰的生成如下圖所示：

    其中，密鑰首先要經(jīng)過(guò)置換選擇1將64位轉(zhuǎn)換為56位。

    注：所有的置換表、S盒均有預(yù)定義。

    二、加密實(shí)現(xiàn) 1.全局變量

    首先將需要用到的置換表作為全局變量進(jìn)行定義

    int ct[64];//加密結(jié)果
int K[16][48];//輪密鑰存儲(chǔ)
int IP[8][8]={{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 antiIP[8][8]={{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};//擴(kuò)展置換表
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};//置換函數(shù) 
int PC1[56]={57,49,41,33,25,17,9,
             1,58,50,42,32,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};//置換選擇1
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};//置換選擇2
int LN[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};//循環(huán)左移次數(shù) 
int S[8][64]={{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}};//S盒

    2.輸入數(shù)據(jù)的轉(zhuǎn)換

    DES處理的是二進(jìn)制數(shù)據(jù)，人工輸入的是八位字符，因此需要將輸入按照ASCII進(jìn)行二進(jìn)制轉(zhuǎn)換：

    int** str2hex(char* src) //字符轉(zhuǎn)ASCII二進(jìn)制 
{
	int t1[8];
	int i,j;
	int** bi = (int**)malloc(sizeof(int*)*8);
	for(i=0;i<8;i++)
	{
		t1[i]=src[i]+0;
	}
	for(i=0;i<8;i++)
	{
		bi[i] = (int*)malloc(sizeof(int) * 8);
		for(j=7;j>=0;j--)
		{
			bi[i][j]=t1[i]%2;
			t1[i]=t1[i]/2;
		}
	}
	return bi;
}

    3.輪密鑰生成函數(shù)

    對(duì)輸入的64位（8位字符經(jīng)過(guò)二進(jìn)制轉(zhuǎn)化來(lái)的）密鑰進(jìn)行處理，得到16個(gè)輪密鑰：

    void KEY(int* keys) //密鑰生成 
{
	int k0[56],tl[28],tr[28],temp;
	int i,j,k;
	for(i=0;i<56;i++) //置換選擇1 
	{
		k0[i]=keys[PC1[i]-1];
	}
	/*printf("\n置換選擇1：");
	for(i=0;i<56;i++) 
	{
		printf("%d",k0[i]);
    }*/
    for(i=0;i<28;i++) //左右分裂 
    {
    	tl[i]=k0[i];
    	tr[i]=k0[i+28];
	}
    for(i=0;i<16;i++) 
    {
    	for(j=0;jdes算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)_des算法原理及實(shí)現(xiàn)_des解密在線解密
    
		{
			K[i][j]=k0[PC2[j]-1];
		}
		/*printf("\n第%d個(gè)輪密鑰：",i+1);
		for(j=0;j<48;j++)
		{
			printf("%d",K[i][j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}*/
	}
    return;
}

    4.輸出結(jié)果的轉(zhuǎn)換

    加密算法的輸出是64位二進(jìn)制，需要把他轉(zhuǎn)換為8位十進(jìn)制數(shù)，以ASCII擴(kuò)展表進(jìn)行輸出：

    int* bi2c(int* c) //結(jié)果顯示 
{
	int i;
	int* cp=(int*)malloc(sizeof(int)*8);
	for(i=0;i<8;i++)
	{
		cp[i]=c[i*8+0]*128+c[i*8+1]*64+c[i*8+2]*32+c[i*8+3]*16+c[i*8+4]*8+c[i*8+5]*4+c[i*8+6]*2+c[i*8+7]*1;
	}
	return cp;
}

    注意：經(jīng)過(guò)加密后的字符ASCII值可能超過(guò)了127des算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)，因此需要用到ASCII擴(kuò)展字符集，而正常的控制臺(tái)無(wú)法輸出，需要用到字符集轉(zhuǎn)換函數(shù)：

    #include
SetConsoleOutputCP(437);//為了輸出特殊字符集 
SetConsoleOutputCP(936);//為了輸出中文

    字符一經(jīng)轉(zhuǎn)變則無(wú)法輸出中文，因此輸出密文后需將字符集再轉(zhuǎn)回utf-8

    5.輸入明文和密鑰詞，并作轉(zhuǎn)換

    printf("加密系統(tǒng)：\n");
	char p[8],kw[8];
	int** phex = (int**)malloc(sizeof(int*)*8);
	int** kw2 = (int**)malloc(sizeof(int*)*8);
	int i,j,k, pb[64], pe[64], ape[64], keys[64];
	int* cyp=(int*)malloc(sizeof(int)*8);
	printf("請(qǐng)輸入八位明文：");
	scanf("%s",p);
	printf("請(qǐng)輸入八位密鑰：");
	scanf("%s",kw);
	printf("即將加密的明文為：%s\n",p);
	//明文轉(zhuǎn)二進(jìn)制
	phex=str2hex(p); 
	printf("二進(jìn)制明文為：");
	k=0;
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			pb[k]=phex[i][j];
			k++;
		}
	}
	for(k=0;k<64;k++)
	{
		printf("%d",pb[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}

    6.對(duì)明文作初始置換

    //初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			pe[i*8+j]=pb[IP[i][j]-1];
		}
	}
	printf("\n初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",pe[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}

    7.輪函數(shù)前置——左右分裂

    //左右分裂 
	for(j=0;j<32;j++)
	{
		cl[j]=pe[j];
		cr[j]=pe[j+32];
	}

    8.輪函數(shù)——擴(kuò)展至換、異或

            for(j=0;j<48;j++)//擴(kuò)展置換 
		{
			ce[j]=cr[E[j]-1];
		}
		for(j=0;j<48;j++)//異或 
		{
			ce[j]=(ce[j]+K[i][j])%2;
		}

    9.輪函數(shù)——S盒代替

    		for(j=0;j<8;j++)//S盒代替 
		{
			t2[0]=ce[j*6];
			t2[1]=ce[j*6+5];
			t4[0]=ce[j*6+1];
			t4[1]=ce[j*6+2];
			t4[2]=ce[j*6+3];
			t4[3]=ce[j*6+4];
			cs[j]=S[j][(t2[0]*2+t2[1]*1)*16+(t4[0]*8+t4[1]*4+t4[2]*2+t4[3]*1)];
			for(k=3;k>=0;k--)
			{
				temp[k]=cs[j]%2;
				cs[j]/=2;
			}
			for(k=0;k<4;k++)
			{
				pf[k+j*4]=temp[k];
				//printf("%d",pf[k+j*4]);
			}
			//printf("\t");
		}

    10.輪函數(shù)——備份及P置換

    		for(j=0;j<32;j++)//P置換備份 
		{
			pf2[j]=pf[j];
		}
		for(j=0;j<32;j++)//P置換 
		{
			pf[j]=pf2[P[j]-1];
		}

    11.輪函數(shù)——左右異或、輸出當(dāng)前輪次加密

    des算法原理及實(shí)現(xiàn)_des算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)_des解密在線解密

    		for(j=0;j<32;j++)//左右異或 
		{
			pf[j]=(cl[j]+pf[j])%2;
		}
		for(j=0;j<32;j++)
		{
			cl[j]=cr[j];
			cr[j]=pf[j];
		}
		printf("\n第%d輪加密結(jié)果：",i+1);
		for(j=0;j<32;j++)
		{
			printf("%d",cl[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}
		for(j=0;j<32;j++)
		{
			printf("%d",cr[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}

    12.左右交換、逆初始置換、輸出加密結(jié)果

    	//左右置換
	for(i=0;i<32;i++)
	{
		ape[i]=cr[i];
		ape[i+32]=cl[i];
	}
	//逆初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			ct[i*8+j]=ape[antiIP[i][j]-1];
		}
	}
	printf("\n逆初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",ct[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	
	printf("\n加密結(jié)果：");
	SetConsoleOutputCP(437);//為了輸出特殊字符集 
	cyp=bi2c(ct);
	for(i=0;i<8;i++)
	{
		printf("%c ",(unsigned char)cyp[i]);
	}
	return;

    三、解密實(shí)現(xiàn)

    DES由于是基于的，因此其加解密算法完全一樣，只需將加密后的二進(jìn)制密文作為輸入，在進(jìn)行一次加密即可得到解密結(jié)果，注意，解密時(shí)輪密鑰應(yīng)倒著使用！

    四、結(jié)果展示

    五、完整代碼

    #include
#include
#include
#include
#include
#include
//函數(shù)聲明 
void en_des();
int** str2hex(char* src);
void KEY(int* keys);
int* bi2c(int* c);
void de_des();
//全局變量 
int ct[64];
int K[16][48];
int IP[8][8]={{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 antiIP[8][8]={{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};//擴(kuò)展置換表
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};//置換函數(shù) 
int PC1[56]={57,49,41,33,25,17,9,
             1,58,50,42,32,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};//置換選擇1
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};//置換選擇2
int LN[16]={1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};//循環(huán)左移次數(shù) 
int S[8][64]={{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}};//S盒 

    des算法原理及實(shí)現(xiàn)_des算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)_des解密在線解密
    
int main(void)
{
	//加密 
	en_des();
	//解密 
	de_des();
	
	return 0;
}
//加密 
void en_des()
{
	printf("加密系統(tǒng)：\n");
	char p[8],kw[8];
	int** phex = (int**)malloc(sizeof(int*)*8);
	int** kw2 = (int**)malloc(sizeof(int*)*8);
	int i,j,k, pb[64], pe[64], ape[64], keys[64];
	int* cyp=(int*)malloc(sizeof(int)*8);
	printf("請(qǐng)輸入八位明文：");
	scanf("%s",p);
	printf("請(qǐng)輸入八位密鑰：");
	scanf("%s",kw);
	printf("即將加密的明文為：%s\n",p);
	//明文轉(zhuǎn)二進(jìn)制
	phex=str2hex(p); 
	printf("二進(jìn)制明文為：");
	k=0;
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			pb[k]=phex[i][j];
			k++;
		}
	}
	for(k=0;k<64;k++)
	{
		printf("%d",pb[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	//初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			pe[i*8+j]=pb[IP[i][j]-1];
		}
	}
	printf("\n初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",pe[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	//密鑰詞轉(zhuǎn)二進(jìn)制 
	kw2=str2hex(kw); 
	k=0;
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			keys[k]=kw2[i][j];
			k++;
		}
	}
	//密鑰生成 
	KEY(keys);
	int cl[32],cr[32];
	//左右分裂 
	for(j=0;j<32;j++)
	{
		cl[j]=pe[j];
		cr[j]=pe[j+32];
	}
	//輪函數(shù)
	for(i=0;i<16;i++)
	{
		int ce[48],cs[8],temp[4],pf[32],pf2[32];
		int t2[2],t4[4];
		for(j=0;j<48;j++)//擴(kuò)展置換 
		{
			ce[j]=cr[E[j]-1];
		}
		for(j=0;j<48;j++)//異或 
		{
			ce[j]=(ce[j]+K[i][j])%2;
			//printf("%d",ce[j]);
		}
		for(j=0;j<8;j++)//S盒代替 
		{
			t2[0]=ce[j*6];
			t2[1]=ce[j*6+5];
			t4[0]=ce[j*6+1];
			t4[1]=ce[j*6+2];
			t4[2]=ce[j*6+3];
			t4[3]=ce[j*6+4];
			cs[j]=S[j][(t2[0]*2+t2[1]*1)*16+(t4[0]*8+t4[1]*4+t4[2]*2+t4[3]*1)];
			for(k=3;k>=0;k--)
			{
				temp[k]=cs[j]%2;
				cs[j]/=2;
			}
			for(k=0;k<4;k++)
			{
				pf[k+j*4]=temp[k];
				//printf("%d",pf[k+j*4]);
			}
			//printf("\t");
		}
		for(j=0;j<32;j++)//P置換備份 
		{
			pf2[j]=pf[j];
		}
		//printf("\n\n");
		for(j=0;j<32;j++)//P置換 
		{
			pf[j]=pf2[P[j]-1];
			//printf("%d",pf[j]);
		}
		//printf("\n\n");
		for(j=0;j<32;j++)//左右異或 
		{
			pf[j]=(cl[j]+pf[j])%2;
		}
		for(j=0;j<32;j++)

    des解密在線解密_des算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)_des算法原理及實(shí)現(xiàn)
    
		{
			cl[j]=cr[j];
			cr[j]=pf[j];
		}
		printf("\n第%d輪加密結(jié)果：",i+1);
		for(j=0;j<32;j++)
		{
			printf("%d",cl[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}
		for(j=0;j<32;j++)
		{
			printf("%d",cr[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}
	} 
	//左右置換
	for(i=0;i<32;i++)
	{
		ape[i]=cr[i];
		ape[i+32]=cl[i];
	}
	//逆初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			ct[i*8+j]=ape[antiIP[i][j]-1];
		}
	}
	printf("\n逆初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",ct[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	
	printf("\n加密結(jié)果：");
	SetConsoleOutputCP(437);//為了輸出特殊字符集 
	cyp=bi2c(ct);
	for(i=0;i<8;i++)
	{
		printf("%c ",(unsigned char)cyp[i]);
	}
	return;
}
int** str2hex(char* src) //字符轉(zhuǎn)ASCII二進(jìn)制 
{
	int t1[8];
	int i,j;
	int** bi = (int**)malloc(sizeof(int*)*8);
	for(i=0;i<8;i++)
	{
		t1[i]=src[i]+0;
	}
	for(i=0;i<8;i++)
	{
		bi[i] = (int*)malloc(sizeof(int) * 8);
		for(j=7;j>=0;j--)
		{
			bi[i][j]=t1[i]%2;
			t1[i]=t1[i]/2;
		}
	}
	return bi;
}
void KEY(int* keys) //密鑰生成 
{
	int k0[56],tl[28],tr[28],temp;
	int i,j,k;
	for(i=0;i<56;i++) //置換選擇1 
	{
		k0[i]=keys[PC1[i]-1];
	}
    for(i=0;i<28;i++) //左右分裂 
    {
    	tl[i]=k0[i];
    	tr[i]=k0[i+28];
	}
    for(i=0;i<16;i++) 
    {
    	for(j=0;jdes算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)_des解密在線解密_des算法原理及實(shí)現(xiàn)
    
void de_des()
{
	SetConsoleOutputCP(936);
	printf("\n\n解密系統(tǒng)："); 
	int ce[64],pp[64],dpt[64];
	int* dep=(int*)malloc(sizeof(int)*8);
	int i,j,k;
	//初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			ce[i*8+j]=ct[IP[i][j]-1];
		}
	}
	printf("\n初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",ce[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	int pl[32],pr[32];
	//左右分裂 
	for(j=0;j<32;j++)
	{
		pl[j]=ce[j];
		pr[j]=ce[j+32];
	}
	//輪函數(shù)
	for(i=0;i<16;i++)
	{
		int pe[48],ps[8],temp[4],cf[32],cf2[32];
		int t2[2],t4[4];
		for(j=0;j<48;j++)//擴(kuò)展置換 
		{
			pe[j]=pr[E[j]-1];
		}
		for(j=0;j<48;j++)//異或 
		{
			pe[j]=(pe[j]+K[15-i][j])%2;
		}
		for(j=0;j<8;j++)//S盒代替 
		{
			t2[0]=pe[j*6];
			t2[1]=pe[j*6+5];
			t4[0]=pe[j*6+1];
			t4[1]=pe[j*6+2];
			t4[2]=pe[j*6+3];
			t4[3]=pe[j*6+4];
			ps[j]=S[j][(t2[0]*2+t2[1]*1)*16+(t4[0]*8+t4[1]*4+t4[2]*2+t4[3]*1)];
			for(k=3;k>=0;k--)
			{
				temp[k]=ps[j]%2;
				ps[j]/=2;
			}
			for(k=0;k<4;k++)
			{
				cf[k+j*4]=temp[k];
			}
		}
		for(j=0;j<32;j++)//P置換備份 
		{
			cf2[j]=cf[j];
		}
		for(j=0;j<32;j++)//P置換 
		{
			cf[j]=cf2[P[j]-1];
		}
		for(j=0;j<32;j++)//左右異或 
		{
			cf[j]=(pl[j]+cf[j])%2;
		}
		for(j=0;j<32;j++)
		{
			pl[j]=pr[j];
			pr[j]=cf[j];
		}
		printf("\n第%d輪解密結(jié)果：",i+1);
		for(j=0;j<32;j++)
		{
			printf("%d",pl[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}
		for(j=0;j<32;j++)
		{
			printf("%d",pr[j]);
			if((j+1)%8==0)
			{
				printf(" ");
			}
		}
	} 
	//左右置換
	for(i=0;i<32;i++)
	{
		pp[i]=pr[i];
		pp[i+32]=pl[i];
	}
	//逆初始置換
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
		{
			dpt[i*8+j]=pp[antiIP[i][j]-1];
		}
	}
	printf("\n逆初始置換：");
	for(k=0;k<64;k++)
	{
		printf("%d",dpt[k]);
		if((k+1)%8==0)
		{
			printf(" ");
		}
	}
	
	printf("\n解密結(jié)果：");
	dep=bi2c(dpt);
	for(i=0;i<8;i++)
	{
		printf("%c",(unsigned char)dep[i]);
	}
	return;
}

    總結(jié)

    以上就是對(duì)DES加解密的簡(jiǎn)單實(shí)現(xiàn)。DES目前已不再安全des算法的加解密系統(tǒng)設(shè)計(jì)與實(shí)現(xiàn)，之后將介紹其衍生版本——AES。

    （第一次寫(xiě)博客，請(qǐng)大家多多支持！有任何問(wèn)題請(qǐng)?jiān)谠u(píng)論區(qū)指正，感謝大家！）

網(wǎng)站首頁(yè)   |    關(guān)于我們   |    公司新聞   |    產(chǎn)品方案   |    用戶(hù)案例   |    售后服務(wù)   |    合作伙伴   |    人才招聘   |   

友情鏈接： 餐飲加盟

地址：北京市海淀區(qū)    電話(huà)：010-     郵箱：@126.com

備案號(hào)：冀ICP備2024067069號(hào)-3 北京科技有限公司版權(quán)所有