-
-
Notifications
You must be signed in to change notification settings - Fork 623
/
utils.cpp
383 lines (315 loc) · 10.9 KB
/
utils.cpp
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
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
/* Copyright 2017 - 2021 R. Thomas
* Copyright 2017 - 2021 Quarkslab
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <algorithm>
#include <fstream>
#include <iterator>
#include <exception>
#include <string>
#include <numeric>
#include <iomanip>
#include <sstream>
#include <string>
#include "logging.hpp"
#include "mbedtls/md5.h"
#include "LIEF/exception.hpp"
#include "LIEF/PE/utils.hpp"
#include "LIEF/PE/Structures.hpp"
#include "LIEF/PE/Binary.hpp"
#include "LIEF/PE/Import.hpp"
#include "LIEF/PE/ImportEntry.hpp"
#include "LIEF/BinaryStream/VectorStream.hpp"
#include "LIEF/utils.hpp"
#include "utils/ordinals_lookup_tables/libraries_table.hpp"
#include "utils/ordinals_lookup_tables_std/libraries_table.hpp"
#include "hash_stream.hpp"
namespace LIEF {
namespace PE {
inline std::string to_lower(std::string str) {
std::string lower = str;
std::transform(std::begin(str), std::end(str),
std::begin(lower), ::tolower);
return lower;
}
bool is_pe(const std::string& file) {
std::ifstream binary(file, std::ios::in | std::ios::binary);
if (not binary) {
LIEF_ERR("Unable to open the file!");
return false;
}
uint64_t file_size;
binary.unsetf(std::ios::skipws);
binary.seekg(0, std::ios::end);
file_size = binary.tellg();
binary.seekg(0, std::ios::beg);
if (file_size < sizeof(pe_dos_header)) {
LIEF_ERR("File too small");
return false;
}
char magic[2];
pe_dos_header dos_header;
binary.read(magic, sizeof(magic));
if (magic[0] != 'M' or magic[1] != 'Z') {
return false;
}
binary.seekg(0, std::ios::beg);
binary.read(reinterpret_cast<char*>(&dos_header), sizeof(pe_dos_header));
if (dos_header.AddressOfNewExeHeader >= file_size) {
return false;
}
char signature[sizeof(PE_Magic)];
binary.seekg(dos_header.AddressOfNewExeHeader, std::ios::beg);
binary.read(signature, sizeof(PE_Magic));
return std::equal(std::begin(signature), std::end(signature), std::begin(PE_Magic));
}
bool is_pe(const std::vector<uint8_t>& raw) {
if (raw.size() < sizeof(pe_dos_header)) {
return false;
}
const pe_dos_header* dos_header = reinterpret_cast<const pe_dos_header*>(raw.data());
if (raw[0] != 'M' or raw[1] != 'Z') {
return false;
}
if ((dos_header->AddressOfNewExeHeader + sizeof(pe_header)) >= raw.size()) {
return false;
}
VectorStream raw_stream(raw);
raw_stream.setpos(dos_header->AddressOfNewExeHeader);
auto signature = raw_stream.read_array<char>(sizeof(PE_Magic), /* check bounds */ true);
return std::equal(signature, signature + sizeof(PE_Magic), std::begin(PE_Magic));
}
result<PE_TYPE> get_type_from_stream(BinaryStream& stream) {
const uint64_t cpos = stream.pos();
stream.setpos(0);
const pe_dos_header& dos_hdr = stream.read<pe_dos_header>();
stream.setpos(dos_hdr.AddressOfNewExeHeader + sizeof(pe_header));
const pe32_optional_header& opt_hdr = stream.read<pe32_optional_header>();
const auto type = static_cast<PE_TYPE>(opt_hdr.Magic);
stream.setpos(cpos);
if (type == PE_TYPE::PE32 or type == PE_TYPE::PE32_PLUS) {
return type;
}
return make_error_code(lief_errors::read_error);
}
PE_TYPE get_type(const std::string& file) {
if (not is_pe(file)) {
throw LIEF::bad_format("This file is not a PE binary");
}
std::ifstream binary(file, std::ios::in | std::ios::binary);
if (not binary) {
throw LIEF::bad_file("Unable to open the file");
}
pe_dos_header dos_header;
pe32_optional_header optional_header;
binary.seekg(0, std::ios::beg);
binary.read(reinterpret_cast<char*>(&dos_header), sizeof(pe_dos_header));
binary.seekg(dos_header.AddressOfNewExeHeader + sizeof(pe_header), std::ios::beg);
binary.read(reinterpret_cast<char*>(&optional_header), sizeof(pe32_optional_header));
PE_TYPE type = static_cast<PE_TYPE>(optional_header.Magic);
if (type == PE_TYPE::PE32 or type == PE_TYPE::PE32_PLUS) {
return type;
} else {
throw LIEF::bad_format("This file is not PE32 or PE32+");
}
}
PE_TYPE get_type(const std::vector<uint8_t>& raw) {
if (not is_pe(raw)) {
throw LIEF::bad_format("This file is not a PE binary");
}
VectorStream raw_stream = VectorStream(raw);
const pe_dos_header* dos_header = &raw_stream.read<pe_dos_header>();
raw_stream.setpos(dos_header->AddressOfNewExeHeader + sizeof(pe_header));
const pe32_optional_header* optional_header = &raw_stream.read<pe32_optional_header>();
PE_TYPE type = static_cast<PE_TYPE>(optional_header->Magic);
if (type == PE_TYPE::PE32 or type == PE_TYPE::PE32_PLUS) {
return type;
} else {
throw LIEF::bad_format("This file is not PE32 or PE32+");
}
}
std::string get_imphash_std(const Binary& binary) {
static const std::set<std::string> ALLOWED_EXT = {"dll", "ocx", "sys"};
std::vector<uint8_t> md5_buffer(16);
if (not binary.has_imports()) {
return "";
}
std::string lstr;
bool first_entry = true;
hashstream hs(hashstream::HASH::MD5);
for (const Import& imp : binary.imports()) {
std::string libname = imp.name();
Import resolved = resolve_ordinals(imp, /* strict */ false, /* use_std */ true);
size_t ext_idx = resolved.name().find_last_of(".");
std::string name = resolved.name();
std::string ext;
if (ext_idx != std::string::npos) {
ext = to_lower(resolved.name().substr(ext_idx + 1));
}
if (ALLOWED_EXT.find(ext) != std::end(ALLOWED_EXT)) {
name = name.substr(0, ext_idx);
}
std::string entries_string;
for (const ImportEntry& e : resolved.entries()) {
std::string funcname;
if (e.is_ordinal()) {
funcname = "ord" + std::to_string(e.ordinal());
} else {
funcname = e.name();
}
if (not entries_string.empty()) {
entries_string += ",";
}
entries_string += name + "." + funcname;
}
if (not first_entry) {
lstr += ",";
} else {
first_entry = false;
}
lstr += to_lower(entries_string);
// use write(uint8_t*, size_t) instead of write(const std::string&) to avoid null char
hs.write(reinterpret_cast<const uint8_t*>(lstr.data()), lstr.size());
lstr.clear();
}
return hex_dump(hs.raw(), "");
}
std::string get_imphash_lief(const Binary& binary) {
std::vector<uint8_t> md5_buffer(16);
if (not binary.has_imports()) {
return std::to_string(0);
}
it_const_imports imports = binary.imports();
std::string import_list;
for (const Import& imp : imports) {
Import resolved = resolve_ordinals(imp);
size_t ext_idx = resolved.name().find_last_of(".");
std::string name_without_ext = resolved.name();
if (ext_idx != std::string::npos) {
name_without_ext = name_without_ext.substr(0, ext_idx);
}
std::string entries_string;
for (const ImportEntry& e : resolved.entries()) {
if (e.is_ordinal()) {
entries_string += name_without_ext + ".#" + std::to_string(e.ordinal());
} else {
entries_string += name_without_ext + "." + e.name();
}
}
import_list += to_lower(entries_string);
}
std::sort(
std::begin(import_list),
std::end(import_list),
std::less<char>());
mbedtls_md5(
reinterpret_cast<const uint8_t*>(import_list.data()),
import_list.size(),
md5_buffer.data());
return hex_dump(md5_buffer, "");
}
std::string get_imphash(const Binary& binary, IMPHASH_MODE mode) {
switch (mode) {
case IMPHASH_MODE::LIEF:
{
return get_imphash_lief(binary);
}
case IMPHASH_MODE::PEFILE:
{
return get_imphash_std(binary);
}
}
return "";
}
Import resolve_ordinals(const Import& import, bool strict, bool use_std) {
using ordinal_resolver_t = const char*(*)(uint32_t);
it_const_import_entries entries = import.entries();
if (std::all_of(
std::begin(entries),
std::end(entries),
[] (const ImportEntry& entry) {
return not entry.is_ordinal();
})) {
LIEF_DEBUG("All imports use name. No ordinal!");
return import;
}
std::string name = to_lower(import.name());
ordinal_resolver_t ordinal_resolver = nullptr;
if (use_std) {
auto it = imphashstd::ordinals_library_tables.find(name);
if (it != std::end(imphashstd::ordinals_library_tables)) {
ordinal_resolver = it->second;
}
} else {
auto it = ordinals_library_tables.find(name);
if (it != std::end(ordinals_library_tables)) {
ordinal_resolver = it->second;
}
}
if (ordinal_resolver == nullptr) {
std::string msg = "Ordinal lookup table for '" + name + "' not implemented";
if (strict) {
throw not_found(msg);
}
LIEF_DEBUG("{}", msg);
return import;
}
Import resolved_import = import;
for (ImportEntry& entry : resolved_import.entries()) {
if (entry.is_ordinal()) {
LIEF_DEBUG("Dealing with: {}", entry);
const char* entry_name = ordinal_resolver(static_cast<uint32_t>(entry.ordinal()));
if (entry_name == nullptr) {
if (strict) {
throw not_found("Unable to resolve ordinal: " + std::to_string(entry.ordinal()));
}
LIEF_DEBUG("Unable to resolve ordinal: #{:d}", entry.ordinal());
continue;
}
entry.data(0);
entry.name(entry_name);
}
}
return resolved_import;
}
ALGORITHMS algo_from_oid(const std::string& oid) {
static const std::unordered_map<std::string, ALGORITHMS> OID_MAP = {
{ "2.16.840.1.101.3.4.2.3", ALGORITHMS::SHA_512 },
{ "2.16.840.1.101.3.4.2.2", ALGORITHMS::SHA_384 },
{ "2.16.840.1.101.3.4.2.1", ALGORITHMS::SHA_256 },
{ "1.3.14.3.2.26", ALGORITHMS::SHA_1 },
{ "1.2.840.113549.2.5", ALGORITHMS::MD5 },
{ "1.2.840.113549.2.4", ALGORITHMS::MD4 },
{ "1.2.840.113549.2.2", ALGORITHMS::MD2 },
{ "1.2.840.113549.1.1.1", ALGORITHMS::RSA },
{ "1.2.840.10045.2.1", ALGORITHMS::EC },
{ "1.2.840.113549.1.1.4", ALGORITHMS::MD5_RSA },
{ "1.2.840.10040.4.3", ALGORITHMS::SHA1_DSA },
{ "1.2.840.113549.1.1.5", ALGORITHMS::SHA1_RSA },
{ "1.2.840.113549.1.1.11", ALGORITHMS::SHA_256_RSA },
{ "1.2.840.113549.1.1.12", ALGORITHMS::SHA_384_RSA },
{ "1.2.840.113549.1.1.13", ALGORITHMS::SHA_512_RSA },
{ "1.2.840.10045.4.1", ALGORITHMS::SHA1_ECDSA },
{ "1.2.840.10045.4.3.2", ALGORITHMS::SHA_256_ECDSA },
{ "1.2.840.10045.4.3.3", ALGORITHMS::SHA_384_ECDSA },
{ "1.2.840.10045.4.3.4", ALGORITHMS::SHA_512_ECDSA },
};
const auto& it = OID_MAP.find(oid.c_str());
if (it == std::end(OID_MAP)) {
return ALGORITHMS::UNKNOWN;
}
return it->second;
}
}
}