www.pudn.com > ScanDlg.rar > DES.cpp

/*/////////////////////////////////////////////////////////////////////////// 
// DES.cpp   DES算法声明及实现，标准C++版本 
// CopyRight(C)   1996,2008   TCSY 公司 
// Pentium Working Room   ShanChengKun   2003.08.28   更新 
///////////////////////////////////////////////////////////////////////////*/ 
 
#include "stdafx.h" 
 
#define ENCRYPT   1   // 编码&加密 
#define DECRYPT   2   // 解码&解密 
 
#ifndef BYTE 
typedef unsigned char BYTE; 
#endif 
 
/*** 常量定义 **************************************************************/ 
 
// 初始置换 
static const unsigned char 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 
}; 
 
// 末置换 
static const unsigned char IPinv[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 
}; 
 
// 扩展置换 
static const unsigned char 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 
}; 
 
// S盒代替1 
static const unsigned char S1[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 
}; 
 
// S盒代替2 
static const unsigned char S2[64] = 
{ 
	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 
}; 
 
// S盒代替3 
static const unsigned char S3[64] = 
{ 
	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 
}; 
 
// S盒代替4 
static const unsigned char S4[64] = 
{ 
	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 
}; 
 
// S盒代替5 
static const unsigned char S5[64] = 
{ 
	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 
}; 
 
// S盒代替6 
static const unsigned char S6[64] = 
{ 
	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 
}; 
 
// S盒代替7 
static const unsigned char S7[64] = 
{ 
	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 
}; 
 
// S盒代替8 
static const unsigned char S8[64] = 
{ 
	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 
}; 
 
// P盒置换 
static const unsigned char 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 
}; 
 
// 密钥置换 
static const unsigned char PC1[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 
}; 
 
// 压缩置换 
static const unsigned char 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 
}; 
 
// 每轮移动的位数 
static const unsigned char LS[17] = 
{ 
	0,1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1 
}; 
 
static unsigned char Ki[1000]; 
 
/*** 算法变换函数 **********************************************************/ 
 
static void Init_bit_tab(BYTE *dest, const BYTE *source, BYTE n) 
{ 
	register BYTE masque, i, j; 
 
	for(i=0; i> (7-j); 
			masque >>= 1; 
		} 
	} 
} 
 
static BYTE puissance(BYTE puissance) 
{ 
	register BYTE res = 1, i; 
 
	for(i=1; i<=puissance; i++)  
		res *= 2; 
 
	return(res); 
} 
 
static void Bin_to_Hex(BYTE *vect, const BYTE *source) 
{ 
	register BYTE i, j, masque; 
 
	memset(vect, 0, 8); 
	for(i=0; i<8; i++)  
	{ 
		masque = 7; 
		for(j=0; j<8; j++)  
		{ 
			vect[i] += (puissance(masque)) * source[i * 8 + j]; 
			--masque; 
		} 
	} 
} 
 
static void Vect_Permutation(BYTE *vect, BYTE n_vect, const BYTE *regle, BYTE n_regle) 
{ 
	register BYTE buff[65], i; 
 
	memset(buff, 0, 65); 
	memcpy(buff, vect, n_vect); 
 
	for(i=0; i> (3 - i); 
		masque >>= 1; 
	} 
} 
 
static void S_Box_Calc(BYTE *vect) 
{ 
	const BYTE *S_Box[8]; 
	register unsigned lig, col, i; 
 
	S_Box[0] = S1; 
	S_Box[1] = S2; 
	S_Box[2] = S3; 
	S_Box[3] = S4; 
	S_Box[4] = S5; 
	S_Box[5] = S6; 
	S_Box[6] = S7; 
	S_Box[7] = S8; 
 
	for(i=0; i<8; i++)  
	{ 
		col = 8*vect[1+6*i] + 4*vect[2+6*i] + 2*vect[3+6*i] + vect[4+6*i]; 
		lig = 2*vect[6*i] + vect[5+6*i]; 
		Init_4bit_tab(&vect[4*i], &S_Box[i][col+lig*16]); 
	} 
} 
 
static void Xor(BYTE *vect1, BYTE * vect2, BYTE num_byte) 
{ 
	register BYTE i; 
 
	for(i=0; i