⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 endes.h

📁 在vc++上实现的des算法。并且能对任何文件进行加密
💻 H
📖 第 1 页 / 共 2 页
字号:
#include "stdio.h"
#include "conio.h"

#include <iostream.h>

void endes(unsigned char m_bit[8] , unsigned char k_bit[8] , unsigned char e_bit[8]);


void undes(unsigned char * , unsigned char * , unsigned char *) ;

unsigned char *byte2bit(unsigned char * , unsigned char *) ;
unsigned char *bit2byte(unsigned char * , unsigned char *) ;
void keychange(unsigned char oldkey[8] , unsigned char newkey[16][8]);

void s_replace(unsigned char *) ;



/* byte2bit */
unsigned char *byte2bit(unsigned char byte[64] , unsigned char bit[8])
{
int i = 0 ;
/*byte1*/
	for(i = 0;i <= 7;i++)
	{
		if(byte[0] == 0x1) bit[0] = bit[0] | 0x80 ;
		else bit[0] = bit[0] & 0x7f ;
		if(byte[1] == 0x1) bit[0] = bit[0] | 0x40 ;
		else bit[0] = bit[0] & 0xbf ;
		if(byte[2] == 0x1) bit[0] = bit[0] | 0x20 ;
		else bit[0] = bit[0] & 0xdf ;
		if(byte[3] == 0x1) bit[0] = bit[0] | 0x10 ;
		else bit[0] = bit[0] & 0xef ;
		if(byte[4] == 0x1) bit[0] = bit[0] | 0x08 ;
		else bit[0] = bit[0] & 0xf7 ;
		if(byte[5] == 0x1) bit[0] = bit[0] | 0x04 ;
		else bit[0] = bit[0] & 0xfb ;
		if(byte[6] == 0x1) bit[0] = bit[0] | 0x02 ;
		else bit[0] = bit[0] & 0xfd ;
		if(byte[7] == 0x1) bit[0] = bit[0] | 0x01 ;
		else bit[0] = bit[0] & 0xfe ;
	}
/*byte2*/
	for(i = 8;i <= 15;i++)
	{
		if(byte[8] == 0x1) bit[1] = bit[1] | 0x80 ;
		else bit[1] = bit[1] & 0x7f ;
		if(byte[9] == 0x1) bit[1] = bit[1] | 0x40 ;
		else bit[1] = bit[1] & 0xbf ;
		if(byte[10] == 0x1) bit[1] = bit[1] | 0x20 ;
		else bit[1] = bit[1] & 0xdf ;
		if(byte[11] == 0x1) bit[1] = bit[1] | 0x10 ;
		else bit[1] = bit[1] & 0xef ;
		if(byte[12] == 0x1) bit[1] = bit[1] | 0x08 ;
		else bit[1] = bit[1] & 0xf7 ;
		if(byte[13] == 0x1) bit[1] = bit[1] | 0x04 ;
		else bit[1] = bit[1] & 0xfb ;
		if(byte[14] == 0x1) bit[1] = bit[1] | 0x02 ;
		else bit[1] = bit[1] & 0xfd ;
		if(byte[15] == 0x1) bit[1] = bit[1] | 0x01 ;
		else bit[1] = bit[1] & 0xfe ;
	}
/*byte3*/
	for(i = 16;i <= 23 ;i++)
	{
		if(byte[16] == 0x1) bit[2] = bit[2] | 0x80 ;
		else bit[2] = bit[2] & 0x7f ;
		if(byte[17] == 0x1) bit[2] = bit[2] | 0x40 ;
		else bit[2] = bit[2] & 0xbf ;
		if(byte[18] == 0x1) bit[2] = bit[2] | 0x20 ;
		else bit[2] = bit[2] & 0xdf ;
		if(byte[19] == 0x1) bit[2] = bit[2] | 0x10 ;
		else bit[2] = bit[2] & 0xef ;
		if(byte[20] == 0x1) bit[2] = bit[2] | 0x08 ;
		else bit[2] = bit[2] & 0xf7 ;
		if(byte[21] == 0x1) bit[2] = bit[2] | 0x04 ;
		else bit[2] = bit[2] & 0xfb ;
		if(byte[22] == 0x1) bit[2] = bit[2] | 0x02 ;
		else bit[2] = bit[2] & 0xfd ;
		if(byte[23] == 0x1) bit[2] = bit[2] | 0x01 ;
		else bit[2] = bit[2] & 0xfe ;
	}
/*byte4*/
	for(i = 24;i <= 31 ;i++)
	{
		if(byte[24] == 0x1) bit[3] = bit[3] | 0x80 ;
		else bit[3] = bit[3] & 0x7f ;
		if(byte[25] == 0x1) bit[3] = bit[3] | 0x40 ;
		else bit[3] = bit[3] & 0xbf ;
		if(byte[26] == 0x1) bit[3] = bit[3] | 0x20 ;
		else bit[3] = bit[3] & 0xdf ;
		if(byte[27] == 0x1) bit[3] = bit[3] | 0x10 ;
		else bit[3] = bit[3] & 0xef ;
		if(byte[28] == 0x1) bit[3] = bit[3] | 0x08 ;
		else bit[3] = bit[3] & 0xf7 ;
		if(byte[29] == 0x1) bit[3] = bit[3] | 0x04 ;
		else bit[3] = bit[3] & 0xfb ;
		if(byte[30] == 0x1) bit[3] = bit[3] | 0x02 ;
		else bit[3] = bit[3] & 0xfd ;
		if(byte[31] == 0x1) bit[3] = bit[3] | 0x01 ;
		else bit[3] = bit[3] & 0xfe ;
	}
/*byte5*/
	for(i = 32;i <= 39 ;i++)
	{
		if(byte[32] == 0x1) bit[4] = bit[4] | 0x80 ;
		else bit[4] = bit[4] & 0x7f ;
		if(byte[33] == 0x1) bit[4] = bit[4] | 0x40 ;
		else bit[4] = bit[4] & 0xbf ;
		if(byte[34] == 0x1) bit[4] = bit[4] | 0x20 ;
		else bit[4] = bit[4] & 0xdf ;
		if(byte[35] == 0x1) bit[4] = bit[4] | 0x10 ;
		else bit[4] = bit[4] & 0xef ;
		if(byte[36] == 0x1) bit[4] = bit[4] | 0x08 ;
		else bit[4] = bit[4] & 0xf7 ;
		if(byte[37] == 0x1) bit[4] = bit[4] | 0x04 ;
		else bit[4] = bit[4] & 0xfb ;
		if(byte[38] == 0x1) bit[4] = bit[4] | 0x02 ;
		else bit[4] = bit[4] & 0xfd ;
		if(byte[39] == 0x1) bit[4] = bit[4] | 0x01 ;
		else bit[4] = bit[4] & 0xfe ;
	}
/*byte6*/
	for(i = 40;i <= 47 ;i++)
	{
		if(byte[40] == 0x1) bit[5] = bit[5] | 0x80 ;
		else bit[5] = bit[5] & 0x7f ;
		if(byte[41] == 0x1) bit[5] = bit[5] | 0x40 ;
		else bit[5] = bit[5] & 0xbf ;
		if(byte[42] == 0x1) bit[5] = bit[5] | 0x20 ;
		else bit[5] = bit[5] & 0xdf ;
		if(byte[43] == 0x1) bit[5] = bit[5] | 0x10 ;
		else bit[5] = bit[5] & 0xef ;
		if(byte[44] == 0x1) bit[5] = bit[5] | 0x08 ;
		else bit[5] = bit[5] & 0xf7 ;
		if(byte[45] == 0x1) bit[5] = bit[5] | 0x04 ;
		else bit[5] = bit[5] & 0xfb ;
		if(byte[46] == 0x1) bit[5] = bit[5] | 0x02 ;
		else bit[5] = bit[5] & 0xfd ;
		if(byte[47] == 0x1) bit[5] = bit[5] | 0x01 ;
		else bit[5] = bit[5] & 0xfe ;
	}
/*byte7*/
	for(i = 48;i <= 55 ;i++)
	{
		if(byte[48] == 0x1) bit[6] = bit[6] | 0x80 ;
		else bit[6] = bit[6] & 0x7f ;
		if(byte[49] == 0x1) bit[6] = bit[6] | 0x40 ;
		else bit[6] = bit[6] & 0xbf ;
		if(byte[50] == 0x1) bit[6] = bit[6] | 0x20 ;
		else bit[6] = bit[6] & 0xdf ;
		if(byte[51] == 0x1) bit[6] = bit[6] | 0x10 ;
		else bit[6] = bit[6] & 0xef ;
		if(byte[52] == 0x1) bit[6] = bit[6] | 0x08 ;
		else bit[6] = bit[6] & 0xf7;
		if(byte[53] == 0x1) bit[6] = bit[6] | 0x04 ;
		else bit[6] = bit[6] & 0xfb ;
		if(byte[54] == 0x1) bit[6] = bit[6] | 0x02 ;
		else bit[6] = bit[6] & 0xfd ;
		if(byte[55] == 0x1) bit[6] = bit[6] | 0x01 ;
		else bit[6] = bit[6] & 0xfe ;
	}
/*byte8*/
	for(i = 56;i <= 63 ;i++)
	{
		if(byte[56] == 0x1) bit[7] = bit[7] | 0x80 ;
		else bit[7] = bit[7] & 0x7f ;
		if(byte[57] == 0x1) bit[7] = bit[7] | 0x40 ;
		else bit[7] = bit[7] & 0xbf ;
		if(byte[58] == 0x1) bit[7] = bit[7] | 0x20 ;
		else bit[7] = bit[7] & 0xdf ;
		if(byte[59] == 0x1) bit[7] = bit[7] | 0x10 ;
		else bit[7] = bit[7] & 0xef ;
		if(byte[60] == 0x1) bit[7] = bit[7] | 0x08 ;
		else bit[7] = bit[7] & 0xf7 ;
		if(byte[61] == 0x1) bit[7] = bit[7] | 0x04 ;
		else bit[7] = bit[7] & 0xfb ;
		if(byte[62] == 0x1) bit[7] = bit[7] | 0x02 ;
		else bit[7] = bit[7] & 0xfd ;
		if(byte[63] == 0x1) bit[7] = bit[7] | 0x01 ;
		else bit[7] = bit[7] & 0xfe ;
	}
return bit ;
}/*end of byte2bit*/

/* bit2byte */
unsigned char *bit2byte(unsigned char bit[8] , unsigned char byte[64])
/*实现bit到byte之间的转换*/
{
int i=0 ;
for(i=0 ; i<=63 ; i++)
	{
		byte[i] = 0x0 ;
	}
	for(i=0 ; i<=7 ; i++)
	{
		if((bit[i] & 0x80) == 0x80) byte[i*8+0] = 0x01 ;
		if((bit[i] & 0x40) == 0x40) byte[i*8+1] = 0x01 ;
		if((bit[i] & 0x20) == 0x20) byte[i*8+2] = 0x01 ;
		if((bit[i] & 0x10) == 0x10) byte[i*8+3] = 0x01 ;
		if((bit[i] & 0x08) == 0x08) byte[i*8+4] = 0x01 ;
		if((bit[i] & 0x04) == 0x04) byte[i*8+5] = 0x01 ;
		if((bit[i] & 0x02) == 0x02) byte[i*8+6] = 0x01 ;
		if((bit[i] & 0x01) == 0x01) byte[i*8+7] = 0x01 ;
	}
	return byte;
}/* end of bit2byte */

/*密钥key的转换*/
void keychange(unsigned char oldkey[8] , unsigned char newkey[16][8])
{
int i=0,j=0,k=0 ;
int pc_1[56] = {57,49,41,33,25,17,9,           /*PC-1中去掉了8,16,24,32,40,*/
                1,58,50,42,34,26,18,           /*48,56,64位奇偶校验位 */
		        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 pc_2[48] = {14,17,11,24,1,5,               /*48位输出*/
		        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 ccmovebit[16] = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1} ;/*左移位数*/
unsigned char oldkey_byte[64] ;
unsigned char oldkey_byte1[64] ;
unsigned char oldkey_byte2[64] ;
unsigned char oldkey_c[28] ;
unsigned char oldkey_d[28] ;
unsigned char cc_temp ;
unsigned char newkey_byte[16][64] ;

bit2byte(oldkey,oldkey_byte) ;
for(i=0;i<=55;i++) 
   oldkey_byte1[i] = oldkey_byte[pc_1[i] - 1] ;/*实现 PC-1*/
for(i=0;i<=27;i++) 
   oldkey_c[i] = oldkey_byte1[i] ;/*将前28bit送入c0*/
for(i=28;i<=55;i++) 
   oldkey_d[i -28] = oldkey_byte1[i] ;/*将后28bit送入d0*/
/*按cc_movebit中元素进行左移,获得 c1-16,d1-16*/
for(i=0;i<=15;i++)
   {
	for(j=1;j<=ccmovebit[i];j++)
	{
		cc_temp = oldkey_c[0] ; /*取出第一bit*/
		for(k=0;k<=26;k++)
		   {oldkey_c[k] = oldkey_c[k+1] ;}
		oldkey_c[27] = cc_temp ; /*将第一bit放到最后一bit*/

		cc_temp = oldkey_d[0] ; /*取出第一bit*/
                for(k=0;k<=26;k++)
		   {oldkey_d[k] = oldkey_d[k+1] ;}
		oldkey_d[27] = cc_temp ; /*将第一bit放到最后一bit*/
	}  
	/*通过pc-2变换bit*/
	for(k=0;k<=27;k++) 
           oldkey_byte2[k] = oldkey_c[k] ;
	for(k=28;k<=55;k++) 
           oldkey_byte2[k] = oldkey_d[k-28] ;
	/*c(i)+d(i)得到48位输出k[i]*/
	for(k=0;k<=47;k++) 
           newkey_byte[i][k] = oldkey_byte2[pc_2[k] - 1] ;
        
    }    
for(i=0;i<=15;i++) byte2bit(newkey_byte[i],newkey[i]) ;
}/*end of keychange*/

/*加密数据*/
void endes(unsigned char m_bit[8] , unsigned char k_bit[8] , unsigned char e_bit[8])
{
int ip[64] = {  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 ip_1[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 e[48] = {   32,1, 2, 3, 4, 5,          /*定义e函数表*/
		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
		} ;
unsigned char m_bit1[8] = {0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0} ;
unsigned char m_byte[64] ;
unsigned char m_byte1[64] ;
unsigned char key_n[16][8] ;

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -