Base64加密

Base64编码常用于邮件发送时使用。其特点如下:

1. 经过Base64加密后的密文长度一定是4的倍数

2. 经过Base64加密后密文长度一定比原文长

原理很简单，首先确认想要使用Base64加密，原文长度必须是3的倍数。如果原文不是3的倍数就填充其他符号来凑足成3的倍数。

Base64会使用一串固定编码，其标准为：

ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/

原文经过加密会产生一系列索引，利用索引在这串固定编码中寻找对应的字符。

假设现在有一串字符串为: "Hello", 希望进行Base64加密。首先将每个字符的ASCII吗的二进制表示写出来: 

 把他们以6位为一组进行分组, 发现最后4个字节凑不足6位。这种情况下就补0。

 往后面补2个0, 这样就可以凑出7组

 按照之前的说法， 密文长度必须是4的倍数，可是"Hello"的长度只有5，解析出来的只有7组。这种情况怎么办。可以用=号补足，为了凑足4的倍数的密文，还需要加上1个=号, 这样密文一共有8组就符合了4的倍数。

计算一下前面7个二进制数对应的十进制数:

 还记得之前说的标准的固定编码吗，以上图所示的7个数字为索引，拿出该数组中对应的的字符:

SGVsbG8

一看发现是7个字符，不是说Base64编码出来的密文都是4的倍数吗? 别忘了还有个=号没加上去, 这样就是Base64加密得到的结果了:

SGVsbG8=

下面给出Base64加解密的代码实现:

#include <stdio.h>
#include <string.h>
#include <assert.h>

typedef unsigned char 	uint8;
typedef unsigned long	uint32;

static uint8 alphabet_map[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
static uint8 reverse_map[] = 
{
	 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 62, 255, 255, 255, 63,
	 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 255, 255, 255, 255, 255, 255,
	 255,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
	 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 255, 255, 255, 255, 255,
	 255, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
	 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 255, 255, 255, 255, 255
};

uint32 base64_encode(const uint8 *text, uint32 text_len, uint8 *encode)
{
	uint32 i, j;

	for (i = 0, j = 0; i+3 <= text_len; i+=3)
	{
		encode[j++] = alphabet_map[text[i]>>2];
		encode[j++] = alphabet_map[((text[i]<<4)&0x30)|(text[i+1]>>4)];
		encode[j++] = alphabet_map[((text[i+1]<<2)&0x3c)|(text[i+2]>>6)];
		encode[j++] = alphabet_map[text[i+2]&0x3f];
	}
	
	if (i < text_len)
	{
		uint32 tail = text_len - i;
		if (tail == 1)
		{
			encode[j++] = alphabet_map[text[i]>>2];
			encode[j++] = alphabet_map[(text[i]<<4)&0x30];
			encode[j++] = '=';
			encode[j++] = '=';
		}
		else //tail==2
		{
			encode[j++] = alphabet_map[text[i]>>2];
			encode[j++] = alphabet_map[((text[i]<<4)&0x30)|(text[i+1]>>4)];
			encode[j++] = alphabet_map[(text[i+1]<<2)&0x3c];
			encode[j++] = '=';
		}
	}
	return j;
}

uint32 base64_decode(const uint8 *code, uint32 code_len, uint8 *plain)
{
	assert((code_len&0x03) == 0);

	uint32 i, j = 0;
	uint8 quad[4];
	for (i = 0; i < code_len; i+=4)
	{
		for (uint32 k = 0; k < 4; k++)
		{
			quad[k] = reverse_map[code[i+k]];
		}

		assert(quad[0]<64 && quad[1]<64);

		plain[j++] = (quad[0]<<2)|(quad[1]>>4);

		if (quad[2] >= 64)
			break;
		else if (quad[3] >= 64)
		{
			plain[j++] = (quad[1]<<4)|(quad[2]>>2);
			break;
		}
		else
		{
			plain[j++] = (quad[1]<<4)|(quad[2]>>2);
			plain[j++] = (quad[2]<<6)|quad[3];
		}
	}
	return j;
}

再给一种:

char *Base64Decrypto(char *pszCrypto)
{
	size_t nLenOfCrypto = 0;
	size_t nLenOfContent = 0;
	char *pszContent = NULL;
	const CHAR Base64EncodeMap[] =
	{
		'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
		'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
		'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
		'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
		'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
		'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
		'w', 'x', 'y', 'z', '0', '1', '2', '3',
		'4', '5', '6', '7', '8', '9', '+', '/'
	};
	char szASCII[129] = { 0 };
	size_t nK = 0;
	for (size_t nIdx = 0; nIdx < 64; ++nIdx)
	{
		szASCII[Base64EncodeMap[nIdx]] = nK++;
	}
	nLenOfCrypto = strlen(pszCrypto);
	nLenOfContent = nLenOfCrypto / 4 * 3;
	pszContent = new char[nLenOfContent + 1];
	RtlZeroMemory(pszContent, nLenOfContent + 1);
	size_t nContentIdx = 0;
	for (size_t nIdx = 0; nIdx < nLenOfCrypto; ++nIdx)
	{
		pszContent[nContentIdx++] = ((szASCII[pszCrypto[nIdx]] << 2) | (szASCII[pszCrypto[nIdx + 1]] >> 4));
		++nIdx;
		if (pszCrypto[nIdx + 1] == '=')
		{
			break;
		}
		pszContent[nContentIdx++] = ((szASCII[pszCrypto[nIdx]] << 4) | (szASCII[pszCrypto[nIdx + 1]] >> 2));
		++nIdx;
		if (pszCrypto[nIdx + 1] == '=')
		{
			break;
		}
		pszContent[nContentIdx++] = ((szASCII[pszCrypto[nIdx]] << 6) | szASCII[pszCrypto[nIdx + 1]]);
		++nIdx;
	}

	return(pszContent);
}


char *Base64Crypto(char *pszContent)
{
	size_t nCryptedLen = 0;
	size_t nContentLen = 0;
	char *pszResult = NULL;
	size_t nOfst = 0;

	const CHAR Base64EncodeMap[] =
	{
		'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H',
		'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P',
		'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X',
		'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f',
		'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n',
		'o', 'p', 'q', 'r', 's', 't', 'u', 'v',
		'w', 'x', 'y', 'z', '0', '1', '2', '3',
		'4', '5', '6', '7', '8', '9', '+', '/'
	};

	nContentLen = strlen(pszContent);
	nCryptedLen = nContentLen / 3 * 4 + ((nContentLen % 3) ? 1 : 0);
	pszResult = new char[nCryptedLen + 1];
	if (NULL == pszResult)
	{
		return(NULL);
	}
	RtlZeroMemory(pszResult, nCryptedLen + 1);
	for (size_t nIdx = 0; nIdx < nContentLen; ++nIdx)
	{
		if (nContentLen - nIdx >= 3)
		{
			pszResult[nOfst++] = Base64EncodeMap[pszContent[nIdx] >> 2];
			pszResult[nOfst++] = Base64EncodeMap[((pszContent[nIdx] & 0x03) << 4) | (pszContent[++nIdx] >> 4)];
			pszResult[nOfst++] = Base64EncodeMap[((pszContent[nIdx] & 0x0F) << 2) | (pszContent[++nIdx] >> 6)];
			pszResult[nOfst++] = Base64EncodeMap[pszContent[nIdx] & 0x3F];
		}
		else if (nContentLen - nIdx == 2)
		{
			pszResult[nOfst++] = Base64EncodeMap[pszContent[nIdx] >> 2];
			pszResult[nOfst++] = Base64EncodeMap[((pszContent[nIdx] & 0x03) << 4) | (pszContent[++nIdx] >> 4)];
			pszResult[nOfst++] = Base64EncodeMap[(pszContent[nIdx] & 0x0F) << 2];
			pszResult[nOfst++] = '=';
		}
		else // nContentLen - nIdx == 1
		{
			pszResult[nOfst++] = Base64EncodeMap[pszContent[nIdx] >> 2];
			pszResult[nOfst++] = Base64EncodeMap[(pszContent[nIdx] & 0x03) << 4];
			pszResult[nOfst++] = '=';
			pszResult[nOfst++] = '=';
		}
	}

	return(pszResult);
}

(完)