-
Notifications
You must be signed in to change notification settings - Fork 22
/
util.hpp
276 lines (228 loc) · 9.42 KB
/
util.hpp
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
#ifndef PIG_SYSCALL_UTILS_HPP_
#define PIG_SYSCALL_UTILS_HPP_
#include <Windows.h>
#include <string>
#include <cstdint>
#include <stdexcept>
#define SEED 0xD8
namespace pigsyscall::utils {
template<typename... FormatArgs>
std::string FormatString(std::string_view string_template, FormatArgs... format_args) {
const size_t string_size = snprintf(nullptr, 0, string_template.data(), std::forward<FormatArgs>(format_args)...);
if (string_size <= 0) {
throw std::runtime_error("[pigsyscall::utils::FormatString] Formatted string size is negative or 0.");
}
auto formatted_string = new char[string_size + 1];
snprintf(formatted_string, string_size + 1, string_template.data(), std::forward<FormatArgs>(format_args)...);
return std::string(formatted_string);
}
//Permutative Encoding
inline byte mpbbCrypt[] =
{
65, 54, 19, 98, 168, 33, 110, 187,
244, 22, 204, 4, 127, 100, 232, 93,
30, 242, 203, 42, 116, 197, 94, 53,
210, 149, 71, 158, 150, 45, 154, 136,
76, 125, 132, 63, 219, 172, 49, 182,
72, 95, 246, 196, 216, 57, 139, 231,
35, 59, 56, 142, 200, 193, 223, 37,
177, 32, 165, 70, 96, 78, 156, 251,
170, 211, 86, 81, 69, 124, 85, 0,
7, 201, 43, 157, 133, 155, 9, 160,
143, 173, 179, 15, 99, 171, 137, 75,
215, 167, 21, 90, 113, 102, 66, 191,
38, 74, 107, 152, 250, 234, 119, 83,
178, 112, 5, 44, 253, 89, 58, 134,
126, 206, 6, 235, 130, 120, 87, 199,
141, 67, 175, 180, 28, 212, 91, 205,
226, 233, 39, 79, 195, 8, 114, 128,
207, 176, 239, 245, 40, 109, 190, 48,
77, 52, 146, 213, 14, 60, 34, 50,
229, 228, 249, 159, 194, 209, 10, 129,
18, 225, 238, 145, 131, 118, 227, 151,
230, 97, 138, 23, 121, 164, 183, 220,
144, 122, 92, 140, 2, 166, 202, 105,
222, 80, 26, 17, 147, 185, 82, 135,
88, 252, 237, 29, 55, 73, 27, 106,
224, 41, 51, 153, 189, 108, 217, 148,
243, 64, 84, 111, 240, 198, 115, 184,
214, 62, 101, 24, 68, 31, 221, 103,
16, 241, 12, 25, 236, 174, 3, 161,
20, 123, 169, 11, 255, 248, 163, 192,
162, 1, 247, 46, 188, 36, 104, 117,
13, 254, 186, 47, 181, 208, 218, 61,
20, 83, 15, 86, 179, 200, 122, 156,
235, 101, 72, 23, 22, 21, 159, 2,
204, 84, 124, 131, 0, 13, 12, 11,
162, 98, 168, 118, 219, 217, 237, 199,
197, 164, 220, 172, 133, 116, 214, 208,
167, 155, 174, 154, 150, 113, 102, 195,
99, 153, 184, 221, 115, 146, 142, 132,
125, 165, 94, 209, 93, 147, 177, 87,
81, 80, 128, 137, 82, 148, 79, 78,
10, 107, 188, 141, 127, 110, 71, 70,
65, 64, 68, 1, 17, 203, 3, 63,
247, 244, 225, 169, 143, 60, 58, 249,
251, 240, 25, 48, 130, 9, 46, 201,
157, 160, 134, 73, 238, 111, 77, 109,
196, 45, 129, 52, 37, 135, 27, 136,
170, 252, 6, 161, 18, 56, 253, 76,
66, 114, 100, 19, 55, 36, 106, 117,
119, 67, 255, 230, 180, 75, 54, 92,
228, 216, 53, 61, 69, 185, 44, 236,
183, 49, 43, 41, 7, 104, 163, 14,
105, 123, 24, 158, 33, 57, 190, 40,
26, 91, 120, 245, 35, 202, 42, 176,
175, 62, 254, 4, 140, 231, 229, 152,
50, 149, 211, 246, 74, 232, 166, 234,
233, 243, 213, 47, 112, 32, 242, 31,
5, 103, 173, 85, 16, 206, 205, 227,
39, 59, 218, 186, 215, 194, 38, 212,
145, 29, 210, 28, 34, 51, 248, 250,
241, 90, 239, 207, 144, 182, 139, 181,
189, 192, 191, 8, 151, 30, 108, 226,
97, 224, 198, 193, 89, 171, 187, 88,
222, 95, 223, 96, 121, 126, 178, 138,
71, 241, 180, 230, 11, 106, 114, 72,
133, 78, 158, 235, 226, 248, 148, 83,
224, 187, 160, 2, 232, 90, 9, 171,
219, 227, 186, 198, 124, 195, 16, 221,
57, 5, 150, 48, 245, 55, 96, 130,
140, 201, 19, 74, 107, 29, 243, 251,
143, 38, 151, 202, 145, 23, 1, 196,
50, 45, 110, 49, 149, 255, 217, 35,
209, 0, 94, 121, 220, 68, 59, 26,
40, 197, 97, 87, 32, 144, 61, 131,
185, 67, 190, 103, 210, 70, 66, 118,
192, 109, 91, 126, 178, 15, 22, 41,
60, 169, 3, 84, 13, 218, 93, 223,
246, 183, 199, 98, 205, 141, 6, 211,
105, 92, 134, 214, 20, 247, 165, 102,
117, 172, 177, 233, 69, 33, 112, 12,
135, 159, 116, 164, 34, 76, 111, 191,
31, 86, 170, 46, 179, 120, 51, 80,
176, 163, 146, 188, 207, 25, 28, 167,
99, 203, 30, 77, 62, 75, 27, 155,
79, 231, 240, 238, 173, 58, 181, 89,
4, 234, 64, 85, 37, 81, 229, 122,
137, 56, 104, 82, 123, 252, 39, 174,
215, 189, 250, 7, 244, 204, 142, 95,
239, 53, 156, 132, 43, 21, 213, 119,
52, 73, 182, 18, 10, 127, 113, 136,
253, 157, 24, 65, 125, 147, 216, 88,
44, 206, 254, 36, 175, 222, 184, 54,
200, 161, 128, 166, 153, 152, 168, 47,
14, 129, 101, 115, 228, 194, 162, 138,
212, 225, 17, 208, 8, 139, 42, 242,
237, 154, 100, 63, 193, 108, 249, 236
};
#define mpbbR (mpbbCrypt)
#define mpbbS (mpbbCrypt + 256)
#define mpbbI (mpbbCrypt + 512)
//从Exchange 邮件编码拿出来的，刚好可以简单编码一下stub
inline void CryptPermute(PVOID pv, int cb, BOOL fEncrypt)
{
byte* pb = (byte*)pv;
byte* pbTable = fEncrypt ? mpbbR : mpbbI;
const DWORD* pdw = (const DWORD*)pv;
DWORD dwCurr;
byte b;
if (cb >= sizeof(DWORD))
{
while (0 != (((DWORD_PTR)pb) % sizeof(DWORD)))
{
*pb = pbTable[*pb];
pb++;
cb--;
}
pdw = (const DWORD*)pb;
for (; cb >= 4; cb -= 4)
{
dwCurr = *pdw;
b = (byte)(dwCurr & 0xFF);
//*pb = pbTable[b];
WriteProcessMemory((HANDLE)-1, pb, (PVOID)&pbTable[b], (SIZE_T)1, (SIZE_T*)nullptr);
pb++;
dwCurr = dwCurr >> 8;
b = (byte)(dwCurr & 0xFF);
//*pb = pbTable[b];
WriteProcessMemory((HANDLE)-1, pb, (PVOID)&pbTable[b], (SIZE_T)1, (SIZE_T*)nullptr);
pb++;
dwCurr = dwCurr >> 8;
b = (byte)(dwCurr & 0xFF);
//*pb = pbTable[b];
WriteProcessMemory((HANDLE)-1, pb, (PVOID)&pbTable[b], (SIZE_T)1, (SIZE_T*)nullptr);
pb++;
dwCurr = dwCurr >> 8;
b = (byte)(dwCurr & 0xFF);
//*pb = pbTable[b];
WriteProcessMemory((HANDLE)-1, pb, (PVOID)&pbTable[b], (SIZE_T)1, (SIZE_T*)nullptr);
pb++;
pdw++;
}
pb = (byte*)pdw;
}
for (; --cb >= 0; ++pb)
//*pb = pbTable[*pb];
WriteProcessMemory((HANDLE)-1, pb, (PVOID)&pbTable[*pb], (SIZE_T)1, (SIZE_T*)nullptr);
}
// https://github.com/vxunderground/VX-API/blob/main/VX-API/StringLength.cpp
inline SIZE_T _StrlenA(LPCSTR String) {
LPCSTR String2;
for (String2 = String; *String2; ++String2);
return (String2 - String);
}
inline SIZE_T _StrlenW(LPCWSTR String) {
LPCWSTR String2;
for (String2 = String; *String2; ++String2);
return (String2 - String);
}
// https://github.com/rad9800/WTSRM/blob/master/WTSRM/entry.cpp#L500
inline PVOID _memcpy(void* dst, const void* src, SIZE_T count) {
for (volatile int i = 0; i < count; i++) {
((BYTE*)dst)[i] = ((BYTE*)src)[i];
}
return dst;
}
// https://github.com/Cracked5pider/KaynLdr/blob/main/KaynLdr/src/Win32.c#L39
inline UINT32 _CopyDotStr(PCHAR String) {
for (UINT32 i = 0; i < _StrlenA(String); i++)
{
if (String[i] == '.')
return i;
}
}
// https://github.com/vxunderground/VX-API/blob/main/VX-API/CharStringToWCharString.cpp
inline SIZE_T _CharToWchar(PWCHAR Destination, PCHAR Source, SIZE_T MaximumAllowed) {
INT Length = (INT)MaximumAllowed;
while (--Length >= 0) {
if (!(*Destination++ = *Source++))
return MaximumAllowed - Length - 1;
}
return MaximumAllowed - Length;
}
inline CHAR _ToUpper(CHAR c) {
if (c >= 'a' && c <= 'z') {
return c - 'a' + 'A';
}
return c;
}
// https://github.com/vxunderground/VX-API/blob/main/VX-API/HashStringRotr32.cpp
inline UINT32 _HashStringRotr32SubA(UINT32 Value, UINT Count) {
DWORD Mask = (CHAR_BIT * sizeof(Value) - 1);
Count &= Mask;
#pragma warning( push )
#pragma warning( disable : 4146)
return (Value >> Count) | (Value << ((-Count) & Mask));
#pragma warning( pop )
}
//拿来的Hash算法
//String HASH
inline DWORD _HashStringRotr32A(PCHAR String) {
DWORD Value = 0;
for (INT Index = 0; Index < _StrlenA(String); Index++)
Value = String[Index] + _HashStringRotr32SubA(Value, SEED);
return Value;
}
}//end namespase
#endif