AES加密算法

NKU-Jan
已于 2022-11-27 00:25:16 修改
阅读量333
点赞数
文章标签：算法安全
于 2022-11-27 00:22:13 首次发布
本文链接：https://blog.csdn.net/m0_57929980/article/details/128059597
版权
#ifndef AES_H
#define AES_H
#include<iostream>
using namespace std;
typedef unsigned char u_char;
struct word {
	u_char byte[4];
};
static int Nb = 4, Nk = 4, Nr = 10;
u_char* Key = new u_char[4 * Nk];
word* wordKey = new word[Nb * (Nr + 1)];
word* Plaintext = new word[Nb];
word* Ciphertext = new word[Nb];
word* Rcon = new word[Nr + 1];
static const u_char SBox[16][16] =
{
	{0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76},
	{0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0},
	{0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15},
	{0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75},
	{0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84},
	{0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf},
	{0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8},
	{0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2},
	{0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73},
	{0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb},
	{0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79},
	{0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08},
	{0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a},
	{0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e},
	{0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf},
	{0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16}
};
static const u_char InvSBox[16][16] =
{
	0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb,
	0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb,
	0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e,
	0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25,
	0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92,
	0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84,
	0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06,
	0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b,
	0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73,
	0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e,
	0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b,
	0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4,
	0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f,
	0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef,
	0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61,
	0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d
};
static const u_char MixColumnMatrix[4][4] = {
	{0x02, 0x03, 0x01, 0x01},
	{0x01, 0x02, 0x03, 0x01},
	{0x01, 0x01, 0x02, 0x03},
	{0x03, 0x01, 0x01, 0x02}
};
static const u_char InvMixColumnMatrix[4][4] = {
	{0x0e, 0x0b, 0x0d, 0x09},
	{0x09, 0x0e, 0x0b, 0x0d},
	{0x0d, 0x09, 0x0e, 0x0b},
	{0x0b, 0x0d, 0x09, 0x0e}
};
void WordtoByte(const word* state, u_char* result, int N) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 4; j++) {
			result[i * N + j] = state[i].byte[j];
		}
	}
}
void BytetoWord(word* state, const u_char* result, int N) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] = result[i * N + j];
		}
	}
}
void printWord(word* state, int N) {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 4; j++) {
			printf("%02x  ", state[i].byte[j]);
		}
		cout << endl;
	}
	cout << endl;
}
void initRcon() {
	for (int i = 0; i < Nr + 1; i++) {
		for (int j = 0; j < 4; j++) {
			Rcon[i].byte[j] = 0x0;
		}
	}
	Rcon[1].byte[0] = 0x01;
	Rcon[2].byte[0] = 0x02;
	Rcon[3].byte[0] = 0x04;
	Rcon[4].byte[0] = 0x08;
	Rcon[5].byte[0] = 0x10;
	Rcon[6].byte[0] = 0x20;
	Rcon[7].byte[0] = 0x40;
	Rcon[8].byte[0] = 0x80;
	Rcon[9].byte[0] = 0x1b;
	Rcon[10].byte[0] = 0x36;
}
word RotWord(word w) {
	word temp;
	for (int i = 0; i < 4; i++) {
		temp.byte[(i + 3) % 4] = w.byte[i];
	}
	return temp;
}
word SubWord(word w) {
	u_char L, R;
	for (int i = 0; i < 4; i++) {
		L = w.byte[i] >> 4;
		R = w.byte[i] & 0x0f;
		w.byte[i] = SBox[L][R];
	}
	return w;
}
word WordXOR(word w1, word w2) {
	word temp;
	for (int i = 0; i < 4; i++) {
		temp.byte[i] = w1.byte[i] ^ w2.byte[i];
	}
	return temp;
}
void KeyExpansion(const u_char* key, word* w) {
	initRcon();
	for (int i = 0; i < Nk; i++) {
		for (int j = 0; j < 4; j++) {
			w[i].byte[j] = key[4 * i + j];
		}
	}
	for (int i = Nk; i < Nb * (Nr + 1); i++) {
		word temp = w[i - 1];
		if (i % Nk == 0) {
			temp = RotWord(temp);
			temp = SubWord(temp);
			temp = WordXOR(temp, Rcon[i / Nk]);
		}
		else if (Nk > 6 && (i % Nk) == 4) {
			temp = SubWord(temp);
		}
		w[i] = WordXOR(w[i - Nk], temp);
	}
}
u_char GFMultiplyByte(u_char L, u_char R) {
	u_char temp[8];
	u_char result = 0x00;
	temp[0] = L;
	for (int i = 1; i < 8; i++) {
		if (temp[i - 1] >= 0x80) {
			temp[i] = (temp[i - 1] << 1) ^ 0x1b;
		}
		else {
			temp[i] = temp[i - 1] << 1;
		}
	}
	for (int i = 0; i < 8; i++) {
		if (((R >> i) & 0x01) == 1) {
			result ^= temp[i];
		}
	}
	return result;
}
void ByteSub(word* state) {
	u_char L, R;
	for(int i=0;i<Nb;i++)
	for (int j = 0; j < 4; j++) {
		L = state[i].byte[j] >> 4;
		R = state[i].byte[j] & 0x0f;
		state[i].byte[j] = SBox[L][R];
	}
}
void InvByteSub(word* state) {
	u_char L, R;
	for (int i = 0; i < Nb; i++)
		for (int j = 0; j < 4; j++) {
			L = state[i].byte[j] >> 4;
			R = state[i].byte[j] & 0x0f;
			state[i].byte[j] = InvSBox[L][R];
		}
}
void ShiftRow(word* state) {
	word tmp[4];
	int C[4] = { 0,1,2,3 };
	if (Nb == 8) {
		C[2] = 3;
		C[3] = 4;
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			tmp[i].byte[j] = state[(i + C[j]) % Nb].byte[j];
		}
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] = tmp[i].byte[j];
		}
	}
}
void InvShiftRow(word* state) {
	word tmp[4];
	int C[4] = { 0,1,2,3 };
	if (Nb == 8) {
		C[2] = 3;
		C[3] = 4;
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			tmp[i].byte[j] = state[(i - C[j] + Nb) % Nb].byte[j];
		}
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] = tmp[i].byte[j];
		}
	}
}
void MixColumn(word* state) {
	word* temp = new word[Nb];
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			temp[i].byte[j] = GFMultiplyByte(MixColumnMatrix[j][0], state[i].byte[0]);
			for (int k = 1; k < 4; k++) {
				temp[i].byte[j] ^= GFMultiplyByte(MixColumnMatrix[j][k], state[i].byte[k]);
			}
		}
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] = temp[i].byte[j];
		}
	}
}
void InvMixColumn(word* state) {
	word* temp = new word[Nb];
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			temp[i].byte[j] = GFMultiplyByte(InvMixColumnMatrix[j][0], state[i].byte[0]);
			for (int k = 1; k < 4; k++) {
				temp[i].byte[j] ^= GFMultiplyByte(InvMixColumnMatrix[j][k], state[i].byte[k]);
			}
		}
	}
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] = temp[i].byte[j];
		}
	}
}
void AddRoundKey(word* state, int round) {
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			state[i].byte[j] ^= wordKey[i + Nb * round].byte[j];
		}
	}
}
void AES_Encryption(const word* plaintext, word* ciphertext, const u_char* key) {
	KeyExpansion(key, wordKey);
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			ciphertext[i].byte[j] = plaintext[i].byte[j];
		}
	}
	AddRoundKey(ciphertext, 0);
	for (int i = 1; i < Nr; i++) {
		ByteSub(ciphertext);
		ShiftRow(ciphertext);
		MixColumn(ciphertext);
		AddRoundKey(ciphertext, i);
	}
	ByteSub(ciphertext);
	ShiftRow(ciphertext);
	AddRoundKey(ciphertext, Nr);
}
void AES_Decryption(word* plaintext, const word* ciphertext, const u_char* key) {
	KeyExpansion(key, wordKey);
	for (int i = 0; i < Nb; i++) {
		for (int j = 0; j < 4; j++) {
			plaintext[i].byte[j] = ciphertext[i].byte[j];
		}
	}
	AddRoundKey(plaintext, Nr);
	for (int i = Nr-1; i > 0; i--) {
		InvShiftRow(plaintext);
		InvByteSub(plaintext);
		AddRoundKey(plaintext, i);
		InvMixColumn(plaintext);
	}
	InvShiftRow(plaintext);
	InvByteSub(plaintext);
	AddRoundKey(plaintext, 0);
}

#endif // !AES_H