cryptopp中的des和 网上找的des，算出来结果不一样

[aj3423]

某网上找的des算法，这个算法应该没问题，因为某知名软件中使用了相同的算法，相同的输入，会有相同的输出。
比如：

		string key = "ef73781e"; // key

		string plain;
		plain.assign("\xDF\xF8\x39\xAA\xBC\x7A\xF9\x8E", 8); // 输入是加密过的数据

		CDes des;
		string decrypted = des.Des_DecryptText(plain, key); // des解密
		display(decrypted);

		// 正确的输出: 52 8B F3 B6 EA 72 2C 68

但用cryptopp::des来解相同的数据/key， 结果却不对：

string key = "ef73781e";

		string plain;
		plain.assign("\xDF\xF8\x39\xAA\xBC\x7A\xF9\x8E", 8);

		char buf[128];
		memset(buf, 0, sizeof(buf));

		DES::Decryption d;
		d.SetKey((uchar*)key.data(), DES::KEYLENGTH);
		d.ProcessBlock((uchar*)plain.data(), (uchar*)buf);

		dump_hex("cryptopp", buf, 8); // 输出不对。

请问是为啥。

[aj3423]

补上那个网上找的 des.h 和 des.cpp

#ifndef _DES_H_
#define _DES_H_
#include <string>
using namespace std;
//////////////////////////////////////////////////////////////////////////
class CDes
{
protected:
 bool SubKey[16][48];
 void F_func(bool In[32], const bool Ki[48]);
 void S_func(bool Out[32], bool In[48]);
 void Transform(bool *Out, bool *In, const char *Table, int len);
 void Xor(bool *InA, const bool *InB, int len);
 void RotateL(bool *In, int len, int loop);
 void ByteToBit(bool *Out, const char *In, int bits);
 void BitToByte(char *Out, const bool *In, int bits);
public:
 string Des_EncryptText(string text,string key);
 string Des_DecryptText(string text,string key);
 void Des_Full(unsigned char* pdata,size_t len, bool bENCRYPT);
 void Des_Block(char* Out, char* In, bool bENCRYPT);
 void Des_SetKey(const char Key[8]);
 void Des_SetKey(const string &Key);
 char FullKey[8];
};
//////////////////////////////////////////////////////////////////////////
#endif

#include "memory.h"
#include "des.h"
//////////////////////////////////////////////////////////////////////////

//////////////////////////////////////////////////////////////////////////
// initial permutation IP
const static char IP_Table[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
};
// final permutation IP^-1
const static char IPR_Table[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
};
// expansion operation matrix
static const char E_Table[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
};
// 32-bit permutation function P used on the output of the S-boxes
const static char P_Table[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
};
// permuted choice table (key)
const static char PC1_Table[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
};
// permuted choice key (table)
const static char PC2_Table[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
};
// number left rotations of pc1
const static char LOOP_Table[16] = {
	1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
};
// The (in)famous S-boxes
const static char S_Box[8][4][16] = {
	// S1
	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,
	// S2
	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,
	// S3
	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,
	// S4
	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,
	// S5
	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,
	// S6
	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,
	// S7
	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,
	// S8
	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
};
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
// Code starts from Line 121
//////////////////////////////////////////////////////////////////////////
void CDes::Des_Block(char* Out, char* In, bool bEncrypt)
{
	static bool M[64], Tmp[32], * Li = &M[0], * Ri = &M[32];
	ByteToBit(M, In, 64);
	Transform(M, M, IP_Table, 64);
	if(bEncrypt) {
		for(int i = 0; i < 16; i++) {
			memcpy(Tmp, Ri, 32);
			F_func(Ri, SubKey[i]);
			Xor(Ri, Li, 32);
			memcpy(Li, Tmp, 32);
		}
	} else  {
		for(int i = 15; i >= 0; i--) {
			memcpy(Tmp, Li, 32);
			F_func(Li, SubKey[i]);
			Xor(Li, Ri, 32);
			memcpy(Ri, Tmp, 32);
		}
	}
	Transform(M, M, IPR_Table, 64);
	BitToByte(Out, M, 64);
}
void CDes::Des_Full(unsigned char* pdata, size_t len, bool bENCRYPT)
{
	char buf[8];
	size_t start = 0;
	while(start + 8 < len) {
		memcpy(buf, pdata + start, 8);
		Des_Block((char*)(pdata + start), (char*)buf, bENCRYPT);
		start += 8;
	}
	memset(buf, 0, 8);
	memcpy(buf, pdata + start, len - start);
	Des_Block((char*)(pdata + start), (char*)buf, bENCRYPT);
}
void CDes::Des_SetKey(const char Key[8])
{
	static bool K[64], * KL = &K[0], * KR = &K[28];
	memcpy(FullKey, Key, 8);
	ByteToBit(K, Key, 64);
	Transform(K, K, PC1_Table, 56);
	for(int i = 0; i < 16; i++) {
		RotateL(KL, 28, LOOP_Table[i]);
		RotateL(KR, 28, LOOP_Table[i]);
		Transform(SubKey[i], K, PC2_Table, 48);
	}
}
void CDes::Des_SetKey(const string& Key)
{
	Des_SetKey((char*)Key.data());
}
string CDes::Des_EncryptText(string text, string key)
{

	Des_SetKey(key);
	size_t txtlen = text.length();
	char* buf = new char[txtlen + 16];
	memset(buf, 0, txtlen + 16);
	memcpy(buf, text.c_str(), txtlen);
	if(txtlen % 8 != 0)
		txtlen += 8 - (txtlen % 8);
	Des_Full((unsigned char*)buf, txtlen, true);
	string result;
	result.assign(buf, txtlen);

	delete[] buf;
	return result;
}
string CDes::Des_DecryptText(string text, string key)
{
	Des_SetKey(key);
	size_t txtlen = text.length();
	char* buf = new char[txtlen + 16];
	memset(buf, 0, txtlen+16);

	if(txtlen % 8 != 0)
		txtlen += 8 - (txtlen % 8);

	memcpy(buf, text.data(), text.length());

	Des_Full((unsigned char*)buf, txtlen, false);

	string result;
	result.assign(buf, txtlen);
	delete[] buf;
	return result;
}

void CDes::F_func(bool In[32], const bool Ki[48])
{
	static bool MR[48];
	Transform(MR, In, E_Table, 48);
	Xor(MR, Ki, 48);
	S_func(In, MR);
	Transform(In, In, P_Table, 32);
}
void CDes::S_func(bool Out[32], bool In[48])
{
	for(char i = 0, j, k; i < 8; i++, In += 6, Out += 4) {
		j = (In[0] << 1) + In[5];
		k = (In[1] << 3) + (In[2] << 2) + (In[3] << 1) + In[4];
		ByteToBit(Out, &S_Box[i][j][k], 4);
	}
}
void CDes::Transform(bool* Out, bool* In, const char* Table, int len)
{
	static bool Tmp[256];
	for(int i = 0; i < len; i++)
		Tmp[i] = In[Table[i] - 1];
	memcpy(Out, Tmp, len);
}
void CDes::Xor(bool* InA, const bool* InB, int len)
{
	for(int i = 0; i < len; i++)
		InA[i] ^= InB[i];
}
void CDes::RotateL(bool* In, int len, int loop)
{
	static bool Tmp[256];
	memcpy(Tmp, In, loop);
	memcpy(In, In + loop, len - loop);
	memcpy(In + len - loop, Tmp, loop);
}
void CDes::ByteToBit(bool* Out, const char* In, int bits)
{
	for(int i = 0; i < bits; i++)
		Out[i] = (In[i / 8] >> (i % 8)) & 1;
}
void CDes::BitToByte(char* Out, const bool* In, int bits)
{
	memset(Out, 0, (bits + 7) / 8);
	for(int i = 0; i < bits; i++)
		Out[i / 8] |= In[i] << (i % 8);
}

[guaguo02100]

我算的结果也不一样，这个代码是不是OEM过了？我没仔细看代码