记录一个C++编译时字符串加密的方法,根据https://www.cnblogs.com/nanfei/p/14458821.html改进,用来防止逆向工具中看到明文字符串,增加逆向难度。
代码如下,只有一个头文件"StrEnCode.h"
#pragma once
#include <iostream>
namespace crypt {
#define XSTR_SEED ((__TIME__[7] - '0') * 1ull + (__TIME__[6] - '0') * 10ull + \
(__TIME__[4] - '0') * 60ull + (__TIME__[3] - '0') * 600ull + \
(__TIME__[1] - '0') * 3600ull + (__TIME__[0] - '0') * 36000ull)
constexpr unsigned long long linear_congruent_generator(unsigned rounds) {
return 1013904223ull + (1664525ull * ((rounds > 0) ? linear_congruent_generator(rounds - 1) : (XSTR_SEED))) % 0xFFFFFFFF;
}
#define Random() linear_congruent_generator(10)
#define XSTR_RANDOM_NUMBER(Min, Max) (Min + (Random() % (Max - Min + 1)))
template <unsigned size>
class Xor_string {
public:
const unsigned _nb_chars = (size - 1);
char _string[size];
unsigned char _key1 = XSTR_RANDOM_NUMBER(0x00, 0xA0);
unsigned char _key2 = XSTR_RANDOM_NUMBER(0xA1, 0xFF);
//加密存储
inline constexpr Xor_string(const char* string) : _string{}
{
for (unsigned i = 0u; i < size; ++i)
{
_string[i] = (string[i] ^ _key1) + _key2; //加密
}
}
//解密
const char* decrypt() const
{
char* ret_string = const_cast<char*>(_string);
for (unsigned i = 0; i < _nb_chars; i++)
{
ret_string[i] = (_string[i] - _key2) ^ _key1; //解密
}
ret_string[_nb_chars] = '\0';
return ret_string;
}
};
}// END crypt NAMESPACE ========================================================
#define XorS(name, my_string) constexpr crypt::Xor_string<(sizeof(my_string)/sizeof(char))> name(my_string)
#define XorString(my_string) []{ constexpr crypt::Xor_string<(sizeof(my_string)/sizeof(char))> expr(my_string); return expr; }().decrypt()
#define _c( string ) XorString( string )
cpp demo
#include "StrEnCode.h"
#include <iostream>
using namespace std;
int main(void)
{
cout << _c("aaa11") << endl;
cout << ("aaa22") << endl;
cout << ("aaa33") << endl;
cout << _c("aaa44") << endl;
system("pause");
return 0;
}
运行结果如下
下面是在windbg搜寻字符串,已经看不到加密的字符串了
另外好像有个开源库ADVobfuscator也能实现,暂时不去研究了。