DES加密算法编程实现 C++实现

DES算法描述

DES算法编程实现

//文件名：DES加密算法编程实现.cpp
//作者：Frost_Ann

#include <iostream>

#include "置换表.cpp"

//根据置换表p，将数组src的元素放进数组des。
template<std::size_t N>
void Permutation(const std::array<int, N> p, const int* src, int* des)
{
	for (int i = 0; i < N; ++i)
		des[i] = src[p[i] - 1];
}

void S盒(int* src, int* des)
{
	for (int i = 0; i < 8; ++i) {
		int r = (src[i * 6 + 0] << 1) | src[i * 6 + 5];
		int c = (src[i * 6 + 1] << 3) | (src[i * 6 + 2] << 2) | (src[i * 6 + 3] << 1) | src[i * 6 + 4];
		des[i * 4 + 0] = (S[i][r][c] >> 3) & 1;
		des[i * 4 + 1] = (S[i][r][c] >> 2) & 1;
		des[i * 4 + 2] = (S[i][r][c] >> 1) & 1;
		des[i * 4 + 3] = S[i][r][c] & 1;
	}
}

//encode为true时加密，encode为false时解密。
void DES(int* data, const int* key, bool encode)
{
	int LR[64];
	Permutation(初始置换IP, data, LR);//64位->64位

	int CD[56];
	Permutation(置换选择1, key, CD);//64位->56位

	int* L = LR, * R = LR + 32;
	int* C = CD, * D = CD + 28;

	for (int i = 0; i < 16; ++i) {
		if (encode) {//加密
			std::rotate(C, C + 循环左移次数[i], C + 28);
			std::rotate(D, D + 循环左移次数[i], D + 28);
		}

		int Ki[48];
		Permutation(置换选择2, CD, Ki);//56位->48位

		if (!encode) {//解密
			std::rotate(C, C + (28 - 循环左移次数[15 - i]), C + 28);
			std::rotate(D, D + (28 - 循环左移次数[15 - i]), D + 28);
		}

		int tmp1[48];
		Permutation(扩充置换E, R, tmp1);//32位->48位

		//tmp1 = tmp1 ^ Ki
		for (int j = 0; j < 48; ++j)
			tmp1[j] ^= Ki[j];

		int tmp2[32];
		S盒(tmp1, tmp2);//48位->32位

		int tmp3[32];
		Permutation(置换函数P, tmp2, tmp3);//32位->32位

		//tmp3 = tmp3 ^ L(i-1)
		for (int j = 0; j < 32; ++j)
			tmp3[j] ^= L[j];

		//L(i) = R(i-1)
		std::move(R, R + 32, L);
		//R(i) = tmp3
		std::move(tmp3, tmp3 + 32, R);
	}
	//32位互换
	int tmp[64];
	std::move(R, R + 32, tmp);
	std::move(L, L + 32, tmp + 32);
	//逆初始置换
	Permutation(逆初始置换, tmp, data);
}

void Print(const char* text, int* a, int n = 64)
{
	std::cout << text;
	for (int i = 0; i < n; ++i) {
		if (i != 0 && i % 8 == 0)
			std::cout << ' ';
		std::cout << a[i];
	}
	std::cout << std::endl;
}

int main()
{
	{
		std::cout << "a) 使用同一密钥，对两组明文进行加密和解密。" << std::endl << std::endl;

		int key[64] = { 0,0,0,0,0,0,1,0,1,0,0,1,0,1,1,0,0,1,0,0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,1,1,1,0,0,0,0,0,1,1,0,0,0,0,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0,0 };
		Print("64位密钥：", key);

		int block1[64] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
		int block2[64] = { 1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0 };
		Print("明文块1：", block1);
		Print("明文块2：", block2);
		std::cout << std::endl;

		DES(block1, key, true);
		DES(block2, key, true);
		Print("明文块1加密：", block1);
		Print("明文块2加密：", block2);
		int count = 0;
		for (int i = 0; i < 64; ++i)
			if (block1[i] != block2[i])
				++count;
		std::cout << "两个密文块间不同数据位的数量：" << count << std::endl << std::endl;

		DES(block1, key, false);
		DES(block2, key, false);
		Print("明文块1加密解密：", block1);
		Print("明文块2加密解密：", block2);
		std::cout << std::endl;
	}
	{
		std::cout << "b) 对同一段明文，使用不同密钥进行加密和解密操作。" << std::endl << std::endl;

		int key1[64] = { 1,1,1,0,0,0,1,0,1,1,1,1,0,1,1,0,1,1,0,1,1,1,1,0,0,0,1,1,0,0,0,0,0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,1,1,1,0,0 };
		int key2[64] = { 0,1,1,0,0,0,1,0,1,1,1,1,0,1,1,0,1,1,0,1,1,1,1,0,0,0,1,1,0,0,0,0,0,0,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,1,1,1,0,0 };//与key1仅有一位的不同
		int block1[64] = { 0,1,1,0,1,0,0,0,1,0,0,0,0,1,0,1,0,0,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,0,0,1,0,0,1,1,0,1,1,1,0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,0,0,1,0,0 };
		int block2[64] = { 0,1,1,0,1,0,0,0,1,0,0,0,0,1,0,1,0,0,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,0,0,1,0,0,1,1,0,1,1,1,0,1,1,0,1,1,1,0,1,0,1,1,1,0,1,0,0,1,0,0 };//同block1
		Print("明文：", block1);
		Print("密钥1：", key1);
		Print("密钥2：", key2);
		std::cout << std::endl;

		DES(block1, key1, true);
		DES(block2, key2, true);
		Print("密钥1加密：", block1);
		Print("密钥2加密：", block2);
		int count = 0;
		for (int i = 0; i < 64; ++i)
			if (block1[i] != block2[i])
				++count;
		std::cout << "两个密文块间不同数据位的数量：" << count << std::endl << std::endl;

		DES(block1, key1, false);
		DES(block2, key2, false);
		Print("密钥1加密解密：", block1);
		Print("密钥2加密解密：", block2);
		std::cout << std::endl;
	}
	return 0;
}

//文件名：置换表.cpp

#include <array>

const std::array<int, 64> 初始置换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 };

const std::array<int, 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 };

const std::array<int, 48> 扩充置换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 };

const std::array<int, 64> 置换函数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 };

const std::array<int, 56> 置换选择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 };

const std::array<int, 48> 置换选择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 };

const int 循环左移次数[16] = {
	1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1
};

const 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},
} };