邮箱:service@hongdaqianqiu.com
为了维护世界的和平，就单纯的写成X方吧。至于这个X是什么，自己YY？
|
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
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
#include <iostream>#include <string>using namespace std;
string ReverseStr(string strFormer)
{
string strReversed = “”;
string:: iterator iter = strFormer.end();
while(iter != strFormer.begin())
{
strReversed += *(–iter);
}
return strReversed;
}
string Decode(string PlainStr, string key)
{
int i;
string jiemi;
string KeyChar;
string NewStr;
int Pos;
string Side1;
string Side2;
string strChar;
int _Vb_t_i4_0;
Pos = 1;
if(PlainStr.size()%2 == 0)
{
Side1 = ReverseStr(PlainStr.substr(0, PlainStr.size()/2));
Side2 = ReverseStr(PlainStr.substr(PlainStr.size()/2));
PlainStr = Side1 + Side2;
}
_Vb_t_i4_0 = PlainStr.size();
int bl_1, bl_2, bl_3, bl_4=0;
for(i=1; i<=_Vb_t_i4_0; i++)
{
strChar = PlainStr.substr(i-1, 1);
KeyChar = key.substr(Pos-1, 1);
bl_1 = (strChar[0] ^ KeyChar[0]) < 32? 1:0;
bl_2 = (strChar[0] ^ KeyChar[0]) > 126? 1:0;
bl_3 = (strChar[0] < 0? 1:0) | (bl_1 | bl_2);
bl_4 = (strChar[0] > 0xFF? 1:0) | bl_3;
if(bl_4)
{
cout << “if” << endl;
NewStr += strChar;
cout << “strChar :” <<endl;
}
else
{
cout << “else” << endl;
char ch = strChar[0] ^ KeyChar[0];
string str = “”;
str += ch;
NewStr += str;
cout << strChar << ” xor “ << KeyChar << ” is “ << ch << endl;
}
if(key.size() == Pos)
{
cout << “key.size() == Pos” << endl;
Pos = 0;
}
Pos += 1;
}
jiemi = NewStr;
return jiemi;
}
void main(){
string key=“Your Key”;
string pass=“Your DB Pass”;
string data=Decode(pass,key);
cout<<data<<endl;
}
|
（CMD下的）生成的图就不截了，自行编译测试。：）
相关参考：
1) http://www.cnblogs.com/Yahong111/archive/2007/08/15/857140.html
1) http://blog.chinaunix.net/uid-26573264-id-3051184.html
源码作者Madman.in
本文由网络安全攻防研究室（www.91ri.org）信息安全小组原创，转载请注明出处。
Copyright © hongdaChiaki. All Rights Reserved. 鸿大千秋 版权所有
联系方式：
地址: 深圳市南山区招商街道沿山社区沿山路43号创业壹号大楼A栋107室
邮箱：service@hongdaqianqiu.com
备案号：粤ICP备15078875号
