DES加密算法

#include<cstdio>
#include<cstring>
#include <bitset>
#include<iostream>
#include<algorithm>

using namespace std;

string ss="0001001100110100010101110111100110011011101111001101111111110001";
bitset<64> key(ss);// 64位密钥  56位秘钥+8位奇数偶校验位 
bitset<48> subkey[16];// 存放16轮子密钥

// 密钥置换表，将64位密钥变成56位

int PC_1[] = {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
             };
             
// 压缩置换，将56位密钥压缩成48位子密钥
int PC_2[] = {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
             };
//循环左移位数表
int leftshift[] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1}; 


// 初始置换表
int IP[] = {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
           };
           
// 扩展置换表，32->48
int E[] = {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盒，每个S盒是4x16的置换表，6位 -> 4位
int S[8][4][16] = {
	{
		{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}
	}
};

// P置换，32位 -> 32位
int P[] = {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
          };

// 结尾置换表
int IP_1[] = {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
             };
  
//生成16个子秘钥 
void generateKeys(){
	
	bitset<56> newkey; //去掉奇偶校验位后新的秘钥
	bitset<28> leftkey; //分组后左半边的秘钥
	bitset<28> rightkey; //分钟后右半边的秘钥
	bitset<56> comkey; //左右两部分合并后的秘钥 
	
	//进行置换选择1，64位->56位 ，生成新的秘钥
	for(int i=0; i<56; i++){
		newkey[55-i] = key[64-PC_1[i]];
	}
	cout<<key<<endl<<newkey<<endl;
	for(int round=0; round<16; round++){
		//把新的秘钥分成左右两部分
		for(int i=0, j=0; i<56; i++){
			if(i<28){
				rightkey[j++] = newkey[i];
			}else if(i==28){
				j = 0;
				leftkey[j++] = newkey[i];
			}else{
				leftkey[j++] = newkey[i];	
			}
		}
		//把两部分分别循环左移
		int r =  leftshift[round];
		bitset<28> swap = leftkey;
		for(int i=0; i<28; i++){
			if(i<r){
				leftkey[i] = swap[28+i-r];
			}else{
				leftkey[i] = swap[i-r];
			}
		}
		swap = rightkey;
		for(int i=0; i<28; i++){
			if(i<r){
				rightkey[i] = swap[28+i-r];
			}else{
				rightkey[i] = swap[i-r];
			}
		}
		cout<<round<<endl<<leftkey<<endl<<rightkey<<endl;
		// 将上面的两部分合并
		for(int i=0; i<28; i++){
			newkey[i] = rightkey[i];
			newkey[i+28] = leftkey[i];
		}
		cout<<newkey<<endl;	
		//压缩置换，由56位得到48位子密钥
		for(int i=0; i<48; i++){
			subkey[round][47-i] = newkey[56 - PC_2[i]];
		}
	}
}

//扩展每个Rn-1，将其从32位扩展到48位
bitset<48> EE(bitset<32> R){
	bitset<48> eR; 
	for(int i=0; i<48; i++){
		eR[47-i] = R[32-E[i]];
	}
	return eR;
}

bitset<32> f(bitset<48> k, bitset<32> R){
	
	//选择扩展运算E 将R从32->48 
	bitset<48> eR = EE(R);
	cout<<eR<<endl;
	//eR和秘钥Kn执行了异或运算
	for(int i=0; i<48; i++){
		eR[i] = eR[i] ^ k[i];
	}
	cout<<eR<<endl;
	
	bitset<32> sR;
	//S盒压缩寄存器 eR:011000 010001 011110 111010 100001 100110 010100 100111 48->32
	for(int i=0; i<8; i++){
	
		int col = eR[i*6] + eR[i*6+5]*2;
		int rol = eR[i*6+1] + eR[i*6+2]*2 + eR[i*6+3]*4 + eR[i*6+4]*8;
		int index = 7 - i;
		int num = S[index][col][rol];
		bitset<4> a(num);
		for(int j=0; j<4; j++){
			sR[i*4+j] = a[j];
		}
	}
	//sR: 0101 1100 1000 0010 1011 0101 1001 0111
	cout<<sR<<endl;
	//P-置换 32->32
	bitset<32> pR;
	for(int i=0; i<32; ++i)
		pR[31-i] = sR[32-P[i]];
	return pR;//pR:0010 0011 0100 1010 1010 1001 1011 1011
}

//加密 
bitset<64> DESencrypt(){
	string M="0000000100100011010001010110011110001001101010111100110111101111";
	bitset<64> plain(M);
	bitset<32> leftplain;
	bitset<32> rightplain;
	bitset<64> Iplain;
	bitset<32> newleft;
	
	//初始置换IP 
	for(int i=0; i<64; i++){
		Iplain[63-i] = plain[64-IP[i]];
	}
	cout<<endl<<Iplain<<endl;
	
	//将IP分成32位的左半边L0和右半边R0
	for(int i=0, j=0; i<64; i++){
		if(i<32){
			rightplain[j++] = Iplain[i];
		}else if(i==32){
			j = 0;
			leftplain[j++] = Iplain[i];
		}else{
			leftplain[j++] = Iplain[i];	
		}
	}
	cout<<leftplain<<endl<<rightplain<<endl;
	
	 //进行16个迭代
	for(int round=0; round<16; round++){
	 	newleft = rightplain;
		rightplain = leftplain ^ f(subkey[round], rightplain);
		leftplain = newleft;
	}
	//合并L16和R16，注意合并为 R16L16
	bitset<64> mergeplain;
	for(int i=0; i<32; ++i)
		mergeplain[i] = leftplain[i];
	for(int i=32; i<64; ++i)
		mergeplain[i] = rightplain[i-32];
	// 第五步：结尾置换IP-1
	Iplain = mergeplain;
	for(int i=0; i<64; ++i)
		mergeplain[63-i] = Iplain[64-IP_1[i]];
	// 返回密文
	cout<<"密文:"<<mergeplain<<endl;//10000101 11101000 00010011 01010100 00001111 00001010 10110100 00000101 
	return mergeplain;
}



//将char字符数组转为二进制
bitset<64> charToBitset(const char s[8]){
	bitset<64> bits;
	int h = 0;
	for(int i=0; i<8; ++i)
		for(int j=0; j<8; ++j){
			bits[i*8+j] = ((s[i]>>j) & 1);
		}	
	return bits;
	
}
int main() {
//	string ss = "11110000101010101111000010101010";
//	string st = "000110110000001011101111111111000111000001110010";
//	bitset<32> R0(ss);
//	bitset<48> k(st);
//	cout<<f(k, R0)<<endl;
//	return 0;
//	string s = "romantic";
//	string k = "12345678";
//	bitset<64> plain = charToBitset(s.c_str());
//	//key = charToBitset(k.c_str());
//	// 生成16个子密钥
	generateKeys();
	for(int i=0; i<16; i++){
		cout<<subkey[i]<<endl;
	}
//	// 密文写入 a.txt
	DESencrypt();
	
	fstream file1;
	file1.open("D://a.txt", ios::binary | ios::out);
	file1.write((char*)&cipher,sizeof(cipher));
	file1.close();
//
//	// 读文件 a.txt
//	bitset<64> temp;
//	file1.open("D://a.txt", ios::binary | ios::in);
//	file1.read((char*)&temp, sizeof(temp));
//	file1.close();
//
//	// 解密，并写入文件 b.txt
//	bitset<64> temp_plain = decrypt(temp);
//	file1.open("D://b.txt", ios::binary | ios::out);
//	file1.write((char*)&temp_plain,sizeof(temp_plain));
//	file1.close();

	return 0;
}