Jit linker, mapper, obfuscator, and mutator

Go to file

_xeroxz be947aba63 - fixed .bss symbols not being 0 in memory... - fixed relocations to sections which dont have symbols and thus the sections were not being mapped into memory. a section is create when you statically initialize a variable in c++. no symbol is made to this data... - every .rdata/.data section now gets mapped all at once... this is not much different then how it was before since each string is in its own section. - fixed jump table issues, (-Xclang -fno-jump-tables) must be used. - fixed thread local storage not being supported. (/Zc:threadSafeInit-) - removed clang from the project since there is no need for it, the clang installed by visual studios has mcmodel=large... brutal.... lol....		4 years ago
demos	- fixed .bss symbols not being 0 in memory...	4 years ago
dependencies	- fixed .bss symbols not being 0 in memory...	4 years ago
include	added Zydis source, asmjit source...	4 years ago
resources/imgs	- fixed .bss symbols not being 0 in memory...	4 years ago
src/Theodosius	- fixed .bss symbols not being 0 in memory...	4 years ago
LICENSE	Add LICENSE	4 years ago
README.md	Update README.md	4 years ago

README.md

Theodosius - Jit linker, Mapper, Mutator, and Obfuscator

Theodosius (Theo for short) is a jit linker created entirely for obfuscation and mutation of both code, and code flow. The project is extremely modular in design and supports both kernel and usermode projects. Since Theo inherits HMDM (highly modular driver mapper), any vulnerable driver that exposes arbitrary MSR writes, or physical memory read/write can be used with this framework to map unsigned code into the kernel. This is possible since HMDM inherits VDM (vulnerable driver manipulation), and MSREXEC (elevation of arbitrary MSR writes to kernel execution).

Since Theo is a jit linker, unexported symbols can be jit linked. Resolving such symbols is open ended and allows the programmer of this framework to handle how they want to resolve symbols. More on this later (check out example projects).

Credit And Dependencies

BTBD - Huge thanks for providing suggestions and bouncing ideas back and forth.
- SMAP - scatter mapper, this project is heavily influenced by SMAP.
Zydis - used to decompile obfuscated routines and find JCC's.
asmjit - used to generate link-time code (mutated routines).

Linking - Dynamic And Static

What Is A Linker

A linker is a program which takes object files produces by a compiler and generates a final executable native to the operating system. A linker interfaces with not only object files but also static libraries, "lib" files. What is a "lib" file? Well a lib file is just an archive of obj's. You can invision it as a zip/rar without any compression, just concatination of said object files.

Theo is a jit linker, which means it will link objs together and map them into memory all at once. For usability however, instead of handling object files, Theo can parse entire lib files and extract the objects out of the lib.

Object Files

If you define a c++ file called "main.cpp" the compiler will generate an object file by the name of "main.obj". When you refer to data or code defined in another c/c++ file, the linker uses a symbol table to resolve the address of said code/data. In this situation I am the linker and I resolve all of your symbols :).

Static Linking

Static linking is when the linker links entire routines not created by you, into your code. Say memcpy (if its not inlined), will be staticlly linked with the CRT. Static linking also allows for your code to be more independant as all the code you need you bring with you. However, with Theo, you cannot link static libraries which are not compiled with mcmodel=large. Theo supports actual static linking, in other words, using multiple static libraries at the same time.

Dynamic Linking

Dynamic linking is when external symbols are resolved at runtime. This is done by imports and exports in DLL's (dynamiclly linked libraries). Theo supports "dynamic linking", or in better terms, linking against exported routines. You can see examples of this inside of both usermode and kernelmode examples.

Usage - Using Theodosius

Integrating Clang

For integration with visual studios please open "Visual Studio Installer" --> Click "Modify" on your visual studios version --> Then select the "Individual Components" tab. Search for "clang" --> Select all options ---> Click "Modify" on the bottom right.

Once you have clang-cl installed for visual studios, navigate to the location in which it is installed. The location is (%VCINSTALLDIR%\Tools\Llvm\bin\ and %VCINSTALLDIR%\Tools\Llvm\x64\bin\). Drag and drop all clang files from clang.zip into these directories.

Requirements

No SEH support, do not add __try/__except in your code.
No CFG (control flow guard) support. Please disable this in C/C++ ---> Code Generation ---> Control Flow Guard
No Stack Security Check Support. Please disablel this in C/C++ ---> Code Generation ---> Security Check (/GS-)
Your project must be set to produce a .lib file.
Your project must not link with other static libraries which are not compiled with clang-cl -mcmodel-large.

Lambdas For Explicit Constructor

Theodosius uses the same class structure as HMDM does. Its a highly modular format which allows for extreme usage, supporting almost every idea one might have. In order to use Theo, you must first define three lambdas, theo::memcpy_t a method of copying memory, theo::malloc_t a method to allocate executable memory, and lastely theo::resolve_symbol_t a lamdba to resolve external symbols.

`theo::memcpy_t` - copy memory lambda

This is used to write memory, it is never used to read memory. An example of this lambda using VDM could be:

theo::memcpy_t _kmemcpy =
[&](void* dest, const void* src, std::size_t size) -> void*
{
	static const auto kmemcpy =
		reinterpret_cast<void*>(
			utils::kmodule::get_export(
				"ntoskrnl.exe", "memcpy"));

	return vdm.syscall<decltype(&memcpy)>(kmemcpy, dest, src, size);
};

This uses VDM to syscall into memcpy exported by ntoskrnl... If you want to do something in usermode you can proxy memcpy to WriteProcessMemory or any other method of writing memory.

theo::memcpy_t _memcpy =
[&](void* dest, const void* src, std::size_t size) -> void*
{
	SIZE_T bytes_handled;
	if (!WriteProcessMemory(phandle, dest, src, size, &bytes_handled))
	{
		std::printf("[!] failed to write process memory...\n");
		exit(-1);
	}
	return dest;
};

`theo::malloc_t` - allocate executable memory

This lambda is used to allocate executable memory. Any method will do as long as the memcpy lambda can write to the allocated memory. An MSREXEC example for this lambda is defined below.

theo::malloc_t _kalloc = [&](std::size_t size) -> void*
{
	void* alloc_base;
	msrexec.exec
	(
		[&](void* krnl_base, get_system_routine_t get_kroutine) -> void
		{
			using ex_alloc_pool_t =
				void* (*)(std::uint32_t, std::size_t);

			const auto ex_alloc_pool =
				reinterpret_cast<ex_alloc_pool_t>(
					get_kroutine(krnl_base, "ExAllocatePool"));

			alloc_base = ex_alloc_pool(NULL, size);
		}
	);
	return alloc_base;
};

This lambda uses MSREXEC to allocate kernel memory via ExAllocatePool. However this is completely open ended on how you want to do it, you can allocate your memory into discarded sections, you can allocate your memory in another address space, etc... Its extremely modular.

Another, yet simple, usermode example for this lambda is defined below.

theo::malloc_t _alloc = [&](std::size_t size) -> void*
{
	return VirtualAllocEx
	(
		phandle,
		nullptr,
		size,
		MEM_COMMIT | MEM_RESERVE,
		PAGE_EXECUTE_READWRITE
	);
};

`theo::resolve_symbol_t` - resolve external symbol

This lambda will try and resolve external symbols. Symbols which are not defined inside of any object files. For example PiddbCacheTable, an unexported ntoskrnl symbol, which normally people sig scan for, can now be jit linked. This is possible by parsing a MAP file, however you can recode this to support PDB's, etc. Again its completely opened ended on how you want to resolve symbols.

theo::resolve_symbol_t resolve_symbol =
[&, &extern_symbols = extern_symbols](const char* symbol_name) -> std::uintptr_t
{
	std::uintptr_t result = 0u;
	for (auto& [drv_name, drv_symbols] : extern_symbols)
	{
		// each kernel module... find a driver with a matching map file name...
		// I.E ntoskrnl.exe.map == ntoskrnl.exe...
		utils::kmodule::each_module
		(
			[&, &drv_name = drv_name, &drv_symbols = drv_symbols]
		(PRTL_PROCESS_MODULE_INFORMATION drv_info, const char* drv_path) -> bool
			{
				const auto _drv_name =
					reinterpret_cast<const char*>(
						drv_info->OffsetToFileName + drv_info->FullPathName);

				// if this is the driver, load it, loop over its sections
				// calc the absolute virtual address of the symbol...
				if (!strcmp(_drv_name, drv_name.c_str()))
				{
					const auto drv_load_addr =
						reinterpret_cast<std::uintptr_t>(
							LoadLibraryExA(drv_path, NULL, DONT_RESOLVE_DLL_REFERENCES));

					std::uint32_t section_count = 1u;
					utils::pe::each_section
					(
						[&, &drv_symbols = drv_symbols]
					(PIMAGE_SECTION_HEADER section_header, std::uintptr_t img_base) -> bool
						{
							if (section_count == drv_symbols[symbol_name].first)
							{
								result = reinterpret_cast<std::uintptr_t>(drv_info->ImageBase) +
									section_header->VirtualAddress + drv_symbols[symbol_name].second;

								// we found the symbol...
								return false;
							}

							++section_count;
							// keep going over sections...
							return true;
						}, drv_load_addr
						);
				}

				// keep looping over modules until we resolve the symbol...
				return !result;
			}
		);
	}

	// if the symbol was not resolved in any of the map files then try 
	// to see if its an export from any other drivers...
	if (!result)
	{
		utils::kmodule::each_module
		(
			[&](PRTL_PROCESS_MODULE_INFORMATION drv_info, const char* drv_path) -> bool
			{
				const auto drv_name =
					reinterpret_cast<const char*>(
						drv_info->OffsetToFileName + drv_info->FullPathName);

				// false if we found the symbol...
				return (!(result = utils::kmodule::get_export(drv_name, symbol_name)));
			}
		);
	}

	return result;
};

Another example of this lambda can be viewed in the usermode examples. This routine simply loops over every single module mapped into the specific process you want to map/link with.

theo::resolve_symbol_t _resolver =
    [&, &extern_symbols = extern_symbols](const char* symbol_name) -> std::uintptr_t
{
	auto loaded_modules = std::make_unique<HMODULE[]>(64);
	std::uintptr_t result = 0u, loaded_module_sz = 0u;

	if (!EnumProcessModules(phandle,
		loaded_modules.get(), 512, (PDWORD)&loaded_module_sz))
		return {};

	for (auto i = 0u; i < loaded_module_sz / 8u; i++)
	{
		wchar_t file_name[MAX_PATH] = L"";
		if (!GetModuleFileNameExW(phandle,
			loaded_modules.get()[i], file_name, _countof(file_name)))
			continue;

		if ((result = reinterpret_cast<std::uintptr_t>(
			GetProcAddress(LoadLibrary(file_name), symbol_name))))
			break;
	}
	
	return result;
};

Creating Instance

Once all three lambdas are defined, you can then create a theo::hmm_ctx (highly modular mapper context). This class is like the one from HMDM however it requires an extra lambda to resolve external symbols.

theo::hmm_ctx drv_mapper({ _alloc, _memcpy, _resolver });

const auto drv_entry = 
	reinterpret_cast<LPTHREAD_START_ROUTINE>(
		drv_mapper.map_objs(image_objs));

Calling Entry

MSREXEC - Call Entry Example

The entry point of the mapped code is not invoked by hmm_ctx, but rather its left up to you to call. An example of calling the entry point can be seen below.

int result;
msrexec.exec([&result, drv_entry = drv_entry]
	(void* krnl_base, get_system_routine_t get_kroutine) -> void
{
	using drv_entry_t = int(*)();
	result = reinterpret_cast<drv_entry_t>(drv_entry)();
});

VDM - Call Entry Example

Another example, this one using VDM, can be seen below.

const auto entry_result =
	vdm.syscall<NTSTATUS(*)()>(
		reinterpret_cast<void*>(drv_entry));

WinAPI - Call Entry Example

Another example, this one using WinAPI's, can be seen below.

std::uint32_t tid = 0u;
CreateRemoteThread
(
    phandle, NULL, 
	NULL, drv_entry,
	NULL, NULL, 
	(LPDWORD)&tid
);

RIP Relative Addressing

In order to allow for a routine to be scattered throughout a 64bit address space, RIP relative addressing must not be used. In order to facilitate this, a very special version of clang-cl is used which can use mcmodel=large. This will generate instructions which do not use RIP relative addressing when referencing symbols outside of the routine in which the instruction itself resides. The only exception to this is JCC instructions, (besides call) also known as branching instructions. Take this c++ code for an example:

ObfuscateRoutine 
extern "C" int ModuleEntry()
{
	MessageBoxA(0, "Demo", "Hello From Obfuscated Routine!", 0);
	UsermodeMutateDemo();
	UsermodeNoObfuscation();
}

This c++ function, compiled by clang-cl with mcmodel=large, will generate a routine with the following instructions:

0x00:                               ; void UsermodeNoObfuscation(void)
0x00:                                               public ?UsermodeNoObfuscation@@YAXXZ
0x00:                               ?UsermodeNoObfuscation@@YAXXZ proc near ; CODE XREF: ModuleEntry+42↓p
0x00:                               var_4           = dword ptr -4
0x00: 48 83 EC 28                                   sub     rsp, 28h
0x04: C7 44 24 24 00 00 00 00                       mov     [rsp+28h+var_4], 0
0x0C:                               loc_C:
0x0C: 83 7C 24 24 05                                cmp     [rsp+28h+var_4], 5
0x11: 0F 83 38 00 00 00                             jnb     loc_4F
0x17: 31 C0                                         xor     eax, eax
0x19: 48 BA 28 01 00 00 00 00 00 00                 mov     rdx, offset ??_C@_04DKDMNOEB@Demo?$AA@ ; "Demo"
0x23: 49 B8 00 01 00 00 00 00 00 00                 mov     r8, offset ??_C@_0CD@JEJKPGNA@Hello?5... ; "Hello From Non-Obfuscated Routine!"
0x2D: 48 B8 A0 01 00 00 00 00 00 00                 mov     rax, offset MessageBoxA
0x37: 45 31 C9                                      xor     r9d, r9d        ; uType
0x3A: 44 89 C9                                      mov     ecx, r9d        ; hWnd
0x3D: FF D0                                         call    rax ; MessageBoxA
0x3F: 8B 44 24 24                                   mov     eax, [rsp+28h+var_4]
0x43: 83 C0 01                                      add     eax, 1
0x46: 89 44 24 24                                   mov     [rsp+28h+var_4], eax
0x4A: E9 BD FF FF FF                                jmp     loc_C
0x4F:                               loc_4F:
0x4F: 48 83 C4 28                                   add     rsp, 28h
0x53: C3                                            retn
0x53:                               ?UsermodeNoObfuscation@@YAXXZ endp

As you can see from the code above, (sorry for the terrible syntax highlighting), references to strings and calls to functions are done by first loading the address of the symbol into a register and then interfacing with the symbol.

0x2D: 48 B8 A0 01 00 00 00 00 00 00                 mov     rax, offset MessageBoxA
; ...
0x3D: FF D0                                         call    rax ; MessageBoxA

Each of these instructions can be anywhere in virtual memory and it would not effect code execution one bit. However this is not the case with routines which have conditional branches. Take the following c++ code for example.

JCC - RIP Relative

ObfuscateRoutine 
void LoopDemo()
{
    for (auto idx = 0u; idx < 10; ++idx)
		DbgPrint("> Loop Demo: %d\n", idx);
}

This c++ function, compiled by clang-cl with mcmodel=large, will generate a routine with the following instructions:

0x58                               ; void LoopDemo(void)
0x58                                               public ?LoopDemo@@YAXXZ
0x58                               ?LoopDemo@@YAXXZ proc near
0x58                               var_4           = dword ptr -4
0x58                               
0x58 48 83 EC 28                                   sub     rsp, 28h
0x5C C7 44 24 24 00 00 00 00                       mov     [rsp+28h+var_4], 0
0x64                               loc_64:
0x64 83 7C 24 24 0A                                cmp     [rsp+28h+var_4], 0Ah
0x69 0F 83 2A 00 00 00                             jnb     loc_99
0x6F 8B 54 24 24                                   mov     edx, [rsp+28h+var_4]
0x73 48 B9 60 01 00 00 00 00 00 00                 mov     rcx, offset ??_C@_0BB@HGKDPLMC@?$.... ; "> Loop Demo: %d\n"
0x7D 48 B8 38 02 00 00 00 00 00 00                 mov     rax, offset DbgPrint
0x87 FF D0                                         call    rax ; DbgPrint
0x89 8B 44 24 24                                   mov     eax, [rsp+28h+var_4]
0x8D 83 C0 01                                      add     eax, 1
0x90 89 44 24 24                                   mov     [rsp+28h+var_4], eax
0x94 E9 CB FF FF FF                                jmp     loc_64
0x99                               loc_99:
0x99 48 83 C4 28                                   add     rsp, 28h
0x9D C3                                            retn
0x9D                               ?LoopDemo@@YAXXZ endp

Uh oh, jnb loc_99?, thats RIP relative! In order to handle branching operations, a "jump table" is generated by obfuscation::obfuscate explicit default constructor. Instead of branching to the RIP relative code, it will instead branch to an inline jump (JMP [RIP+0x0]). As demonstrated below, the branching operation is altered to branch to an asbolute jump.

ffff998b`c5369e60 0f830e000000    jnb     ffff998b`c5369e74
ffff998b`c5369e66 ff2500000000    jmp     qword ptr [ffff998b`c5369e6c]
...
ffff998b`c5369e74 ff2500000000    jmp     qword ptr [ffff998b`c5369e7a]

The linker is able to get the address of the branching code by taking the rip relative virtual address of the branching operation, which is a signed number, and adding it to the current byte offset into the current routine, plus the size of the branching instruction. For example LoopDemo@17 + size of the branching instruction, which is six bytes, then adding the signed relative virtual address (0x2A). The result of this simple calculation gives us LoopDemo@65, which is correct, the branch goes to add rsp, 28h in the above example.

Obfuscation

The usage of the word obfuscation in this project is use to define any changes made to code, this includes code flow. obfuscation::obfuscate, a base class, which is inherited and expanded upon by obfuscation::mutation, obfuscates code flow by inserting JMP [RIP+0x0] instructions after every single instruction. This allows for a routine to be broken up into unique allocations of memory and thus provides more canvas room for creative ideas.

Obfuscate - Base Class

The base class, as described in the above section, contains a handful of util routines and a single explicit constructor which is the corner stone of the class. The constructor fixes JCC relative virtual addresses so that if the condition is met, instead of jumping instruction pointer relativitly, it will jump to an addition jmp (JMP [RIP+0x0]).

LEA's, nor CALL's are rip relative, even for symbols defined inside of the routine in which the instruction is compiled into. In other words JCC instructions are the only instruction pointer relative instructions that are generated.

instruction
jmp next instruction


instruction
jmp next instruction


instruction
jmp next instruction

Mutation - Inherts Obfuscation

This class inherits from obfuscate and adds additional code, or "mutation". This class is a small example of how to use inheritance with obfuscate base class. It generates a stack push/pop palindrome. The state of the stack is restored before the routines actual instruction is executed. The assembly will now look like this in memory:

push gp
push gp
push gp
...
pop gp
pop gp
pop gp
exec routine instruction
jmp next instruction

push gp
push gp
push gp
push gp
push gp
...
pop gp
pop gp
pop gp
pop gp
pop gp
exec routine instruction
jmp next instruction

push gp
push gp
push gp
...
pop gp
pop gp
pop gp
exec routine instruction
jmp next instruction

Again this is just a demo/POC on how you can inherit obfuscate. This also shows an example of how to use asmjit.

Examples

Kernel Example

This example uses MSREXEC and Theodosius to map unsigned code into the kernel. This example is inside of the "Examples" folder. I would also like to note that in this demo external unexported ntoskrnl symbols are resolved by using a MAP file. This map file looks like this:

 00000001:0000000000000F10       KiOpTwoByteTable
 00000001:0000000000001168       SeSubsystemName
 00000001:0000000000001180       PlugPlayHandlerTable
 00000001:00000000000013E0       PiDmAggregatedBooleanDefs
 00000001:0000000000001490       PiDmCachedDeviceKeys
 00000001:0000000000001580       PiDmCachedDeviceInterfaceKeys
 00000001:00000000000015F0       AllowedCachedObjectNames
 00000001:0000000000001640       EmptyUnicodeString

Mind the space at the beginning of each line. If you want to generate a file like this, put ntoskrnl.exe into IDA Pro and then click File ---> Produce File ---> Create MAP File, dont select "Segment Information", but do select "Demangled Names". After the MAP file is generate, please delete all of the garbage at the beginning of the file. I.E delete all spaces and "Address, Public By Value" stuff.



  Address         Publics by Value

 00000001:0000000000000000       VrpRegistryString
 ....

Once you have generated a map file for ntoskrnl.exe, or any other binary you want to link with, you can then use it to resolve external symbols. In the DemoDrv project, I reference two external symbols. One being PiddbCacheTable, and the other being a win32kfull.sys export.

// this is a demo of resolving non-exported symbols...
// win32kfull.sys export example...
extern "C" void NtUserRegisterShellPTPListener();
extern "C" void* PiDDBCacheTable;

These two symbols are simply printed out via DbgPrint.

MutateRoutine extern "C" void DrvEntry()
{
	DbgPrint("> Hello World!\n");

	// non-exported symbols being resolved by jit linker...
	DbgPrint("> PiDDBCacheTable = 0x%p\n", &PiDDBCacheTable);
	DbgPrint("> win32kfull!NtUserRegisterShellPTPListener = 0x%p\n", &NtUserRegisterShellPTPListener);

	// example of referencing itself...
	DbgPrint("> DrvEntry = 0x%p\n", &DrvEntry);

	// example of calling other obfuscated/non obfuscated routines...
	PrintCR3();
	LoopDemo();
}

Once compiled the assembly will look like this. Note that each reference to symbols is done via a relocation to an absolute address. This means strings can (and will) be mapped into their own allocation of memory.

0X0A8:                                               public DrvEntry
0X0A8:                               DrvEntry        proc near
0X0A8: 48 83 EC 28                                   sub     rsp, 28h
0X0AC: 48 B9 78 01 00 00 00 00 00 00                 mov     rcx, offset ??_C@_0BA@LBLNBFIC@?$D...; "> Hello World!\n"
0X0B6: 48 B8 38 02 00 00 00 00 00 00                 mov     rax, offset DbgPrint
0X0C0: FF D0                                         call    rax ; DbgPrint
0X0C2: 48 B9 88 01 00 00 00 00 00 00                 mov     rcx, offset ??_C@_0BK@PLIIADON...; "> PiDDBCacheTable = 0x%p\n"
0X0CC: 48 BA 40 02 00 00 00 00 00 00                 mov     rdx, offset PiDDBCacheTable
0X0D6: 48 B8 38 02 00 00 00 00 00 00                 mov     rax, offset DbgPrint
0X0E0: FF D0                                         call    rax ; DbgPrint
0X0E2: 48 B9 A8 01 00 00 00 00 00 00                 mov     rcx, offset ??_C@_0DE@FLODGMCP...; "> win32kfull!NtUserRegisterShellPTPList"...
0X0EC: 48 BA 48 02 00 00 00 00 00 00                 mov     rdx, offset NtUserRegisterShellPTPListener
0X0F6: 48 B8 38 02 00 00 00 00 00 00                 mov     rax, offset DbgPrint
0X100: FF D0                                         call    rax ; DbgPrint
0X102: 48 B9 E0 01 00 00 00 00 00 00                 mov     rcx, offset ??_C@_0BD@JGN... ; "> DrvEntry = 0x%p\n"
0X10C: 48 BA A8 00 00 00 00 00 00 00                 mov     rdx, offset DrvEntry
0X116: 48 B8 38 02 00 00 00 00 00 00                 mov     rax, offset DbgPrint
0X120: FF D0                                         call    rax ; DbgPrint
0X122: 48 B8 00 00 00 00 00 00 00 00                 mov     rax, offset ?PrintCR3@@YAXXZ ; PrintCR3(void)
0X12C: FF D0                                         call    rax ; PrintCR3(void) ; PrintCR3(void)
0X12E: 48 B8 58 00 00 00 00 00 00 00                 mov     rax, offset ?LoopDemo@@YAXXZ ; LoopDemo(void)
0X138: FF D0                                         call    rax ; LoopDemo(void) ; LoopDemo(void)
0X13A: 90                                            nop
0X13B: 48 83 C4 28                                   add     rsp, 28h               
0X13F: C3                                            retn
0X13F:                               DrvEntry        endp

Theo calculates the size of each symbol by subtracting the address of the next symbol (in the same section), from the address of the symbol itself. If the symbol is the last one in a section, the distance between the start of the symbol and the end of the section is used. Now lets take a look at what happens when we link/map this routine. Theo starts by allocating space for all non-obfuscated symbols.

[+] allocating space for symbols...
        > ??_C@_0BG@GFEIGDHO@?$DO?5Current?5CR3?5?$DN?50x?$CFp?6?$AA@ allocated at = 0xFFFF998BC5361FB0, size = 22
        > ??_C@_0BB@HGKDPLMC@?$DO?5Loop?5Demo?3?5?$CFd?6?$AA@ allocated at = 0xFFFF998BC5364FA0, size = 17
        > ??_C@_0BA@LBLNBFIC@?$DO?5Hello?5World?$CB?6?$AA@ allocated at = 0xFFFF998BC5365FA0, size = 16
        > ??_C@_0BK@PLIIADON@?$DO?5PiDDBCacheTable?5?$DN?50x?$CFp?6?$AA@ allocated at = 0xFFFF998BC5366EA0, size = 26
        > ??_C@_0DE@FLODGMCP@?$DO?5win32kfull?$CBNtUserRegisterShell@ allocated at = 0xFFFF998BC5366EE0, size = 52
        > ??_C@_0BD@JGNLDBEI@?$DO?5DrvEntry?5?$DN?50x?$CFp?6?$AA@ allocated at = 0xFFFF998BC5366F40, size = 19
        > ?PrintCR3@@YAXXZ allocated at = 0xFFFF998BC5366F80, size = 58

As you can see, each string gets its own pool, each global variable does too, and every non-obfuscated routine is mapped into its own pool. The memory however, has not been copied yet since there are relocations that need to happen before they are copied into memory (in PrintCr3).

The next thing Theo does is allocate space for obfuscated routines. In the DemoDrv, there is a demo for each type of obfuscation (just mutation and control flow obfuscation for now).

[+] allocating space for obfuscated symbols...
                > ?LoopDemo@@YAXXZ allocated = 0xFFFF998BC5369DA0, size = 18
                > ?LoopDemo@@YAXXZ@4 allocated = 0xFFFF998BC5369DE0, size = 22
                > ?LoopDemo@@YAXXZ@12 allocated = 0xFFFF998BC5369E20, size = 19
                        > fixing JCC rva...
                                > new rva = 0xe
                                > old rva = 0x2a
                > ?LoopDemo@@YAXXZ@17 allocated = 0xFFFF998BC5369E60, size = 34
                > ?LoopDemo@@YAXXZ@23 allocated = 0xFFFF998BC5369EB0, size = 18
                > ?LoopDemo@@YAXXZ@27 allocated = 0xFFFF998BC5369EF0, size = 24
                > ?LoopDemo@@YAXXZ@37 allocated = 0xFFFF998BC5369F30, size = 24
                > ?LoopDemo@@YAXXZ@47 allocated = 0xFFFF998BC5369F70, size = 16
                > ?LoopDemo@@YAXXZ@49 allocated = 0xFFFF998BC5369FA0, size = 18
                > ?LoopDemo@@YAXXZ@53 allocated = 0xFFFF998BC5368BA0, size = 17
                > ?LoopDemo@@YAXXZ@56 allocated = 0xFFFF998BC5368BE0, size = 18
                > ?LoopDemo@@YAXXZ@60 allocated = 0xFFFF998BC5368C20, size = 14
                > ?LoopDemo@@YAXXZ@65 allocated = 0xFFFF998BC5368C50, size = 18
                > ?LoopDemo@@YAXXZ@69 allocated = 0xFFFF998BC5368C90, size = 15

As you can see, Theo uses Zydis to go over all routines marked for obfuscation and generates new symbols for each instruction inside of the routine. The symbol goes by [RoutineName]@[Instruction Offset]. Note that JCC's are indeed rip relative, these need to be fixed.

> fixing JCC rva...
    > new rva = 0xe
    > old rva = 0x2a
> ?LoopDemo@@YAXXZ@17 allocated = 0xFFFF998BC5369E60, size = 34

Note that in DemoDrv there is a function called "LoopDemo" which is obfuscated. Instead of the JCC instruction branching to the conditional code, it instead branches to an inline jmp. If it doesnt branch, then it simply jumps to the next instruction like normal.

ffff998b`c5369e60 0f830e000000    jae     ffff998b`c5369e74
ffff998b`c5369e66 ff2500000000    jmp     qword ptr [ffff998b`c5369e6c]
ffff998b`c5369e74 ff2500000000    jmp     qword ptr [ffff998b`c5369e7a]

As you can see above, this is what Theo generates for JCC's. Also note that this clang compiler does not generate RIP relative LEA's or CALL's. The only RIP relative stuff Theo deals with are JCC's.

Memory View Of Obfuscation

The instructions for LoopDemo now look like this in memory:

ffff998b`c5369da0 4883ec28        sub     rsp,28h
ffff998b`c5369da4 ff2500000000    jmp     qword ptr [ffff998b`c5369daa]

...

ffff998b`c5369de0 c74424......    mov     dword ptr [rsp+24h],0
ffff998b`c5369de8 ff2500000000    jmp     qword ptr [ffff998b`c5369dee]

...

ffff998b`c5369e20 837c24240a      cmp     dword ptr [rsp+24h],0Ah
ffff998b`c5369e25 ff2500000000    jmp     qword ptr [ffff998b`c5369e2b]

...

ffff998b`c5369e60 0f830e000000    jae     ffff998b`c5369e74
ffff998b`c5369e66 ff2500000000    jmp     qword ptr [ffff998b`c5369e6c]
ffff998b`c5369e74 ff2500000000    jmp     qword ptr [ffff998b`c5369e7a]

...

ffff998b`c5369eb0 8b542424        mov     edx,dword ptr [rsp+24h]
ffff998b`c5369eb4 ff2500000000    jmp     qword ptr [ffff998b`c5369eba]

...

ffff998b`c5369ef0 48b9........    mov rcx,0FFFF998BC5364FA0h ; "> Loop Demo: %d\n"
ffff998b`c5369efa ff2500000000    jmp     qword ptr [ffff998b`c5369f00]

...

ffff998b`c5369f30 48b8........    mov rax,offset nt!DbgPrint (fffff803`6a750f60)
ffff998b`c5369f3a ff2500000000    jmp     qword ptr [ffff998b`c5369f40]

...

ffff998b`c5369f70 ffd0            call    rax
ffff998b`c5369f72 ff2500000000    jmp     qword ptr [ffff998b`c5369f78]

...

ffff998b`c5369fa0 8b442424        mov     eax,dword ptr [rsp+24h]
ffff998b`c5369fa4 ff2500000000    jmp     qword ptr [ffff998b`c5369faa]

...


ffff998b`c5368ba0 83c001          add     eax,1
ffff998b`c5368ba3 ff2500000000    jmp     qword ptr [ffff998b`c5368ba9]

...

ffff998b`c5368be0 89442424        mov     dword ptr [rsp+24h],eax
ffff998b`c5368be4 ff2500000000    jmp     qword ptr [ffff998b`c5368bea]

...

ffff998b`c5368c20 ff2500000000    jmp     qword ptr [ffff998b`c5368c26]

...

ffff998b`c5368c50 4883c428        add     rsp,28h
ffff998b`c5368c54 ff2500000000    jmp     qword ptr [ffff998b`c5368c5a]

...

ffff998b`c5368c90 c3              ret

Usermode Example

This example uses WinAPI's to allocate virtual memory in another process and also to copy virtual memory. Only exported routines from loaded DLL's in the target process can be resolved.

License - BSD 3-Clause

Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.