跨平台C++ Des加密类库,des.h
(2005-05-26 11:17:44)
当使用字符串作为密钥时,依赖与前面的md5类库
#ifndef _DES_H_
#define _DES_H_
#include <string>
#include "md5.h"
using namespace std;
//////////////////////////////////////////////////////////////////////////
class CDes
{
protected:
bool SubKey[16][48];
void F_func(bool In[32], const bool Ki[48]);// f 函数
void S_func(bool Out[32], bool In[48]);// S 盒代替
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:
//加密文本,产生base64加密结果
string Des_EncryptText(string text,string key);
//解密文本,由base64解密成原始字符串
string Des_DecryptText(string text,string key);
// 加/解密 一个连续内存块,要求len必须8倍数
void Des_Full(unsigned char* pdata,size_t len, bool
bENCRYPT);
// 加/解密 一个8字节块
void Des_Block(char* Out, char* In, bool bENCRYPT);
// 设置密钥
void Des_SetKey(const char Key[8]);
void Des_SetKey(const string &Key);
//当前使用的key,即常见的56bit密码
char FullKey[8];
};
//////////////////////////////////////////////////////////////////////////
#endif 跨平台C++ Des加密类库,des.cpp
(2005-05-26 11:19:00)
字符串转整数和整数转字符串依赖于convert.h,可以单写一个
#include "memory.h"
#include "des.h"
#include "convert.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, |