seliaste/malware-m2-2026
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions
malware-m2-2026/Malware/Malware/Malware.cpp

660 lines
22 KiB
C++
Raw Blame History

#include "stdafx.h" // IWYU pragma: keep
#include <climits>
#include <cstdlib>
#pragma clang diagnostic ignored "-Wwritable-strings"
#include <stdint.h>
#include <stdio.h>
#include <string.h>
#include "encryption.h"
#include "functions.h"
#include "lonesha256.h"
#include "tables_poly.h"
#ifdef _WIN32
#include <windows.h>
#endif
// Macros d'obfuscation pour cacher les "Magic Numbers"
#define POLY ((uint8_t)(0xAA ^ 0xB1)) // 170 ^ 177 = 27 = 0x1B
#define MSB ((uint8_t)(0x40 << 1)) // 64 << 1 = 128 = 0x80
#define SHIFT ((uint8_t)(14 >> 1)) // 14 / 2 = 7
// Constantes d'états pour le Control Flow Flattening
#define STATE_INIT (0xAA ^ 0x11) // 0xBB
#define STATE_KEY_DERIV (0xCC ^ 0x22) // 0xEE
#define STATE_DECRYPT (0x77 ^ 0x44) // 0x33
#define STATE_HASH (0x88 ^ 0x11) // 0x99
#define STATE_EXIT (0xDE ^ 0xAD) // 0x73
#define M_INIT (0xFA ^ 0xAF) // 0x55
#define M_EXPAND (0xDE ^ 0x9A) // 0x44
#define M_ORACLE (0xCC ^ 0xFF) // 0x33
#define M_DECOY (0x88 ^ 0xEE) // 0x66
#define M_EXEC (0x11 ^ 0x88) // 0x99
#define M_TRAP (0x55 ^ 0xFF) // 0xAA
#define M_EXIT (0xDE ^ 0xAD) // 0x73
// Identité de Boole pour M_EXIT (toujours 0x73)
#define GET_EXIT_STATE(x) (((x | 0x73) & 0x7F) ^ (x & 0))
/* ==============================================================================
* MATHÉMATIQUES SUR LE CORPS DE GALOIS GF(2^8)
* Polynôme irréductible standard (AES) : x^8 + x^4 + x^3 + x + 1 (0x1B)
* ==============================================================================
*/
typedef struct {
uint32_t fake_entropy;
uint8_t a;
uint8_t mask;
uint16_t padding;
uint8_t b;
uint8_t p;
uint8_t junk;
} GF_CONTEXT;
typedef struct {
uint8_t input_x;
uint8_t* p_coeffs;
uint8_t final_result;
uint8_t current_x_pow;
uint32_t junk_data;
uint32_t state; // On l'intègre ici pour le flux
GF_CONTEXT inner_ctx;
} POLY_CONTEXT;
typedef struct {
char* hidden_buffer; // Le pointeur qui remplace le "return useful;"
uint32_t chaos_seed; // Pour le générateur de lag
uint32_t opaque_counter; // Variable de contrôle bidon
} RED_HERRING_CTX;
typedef struct {
char* input_decoded; // L'argument entrant
int final_match_result; // Le retour sortant
unsigned char computed_hash[32]; // Buffer interne
uint32_t chaos_state; // Pour le générateur de lag
} HASH_CTX;
void __declspec(noinline) boundary_start() { __asm { nop } }
uint8_t gf_mul(GF_CONTEXT* ctx, uint8_t key_stream) {
ctx->p = 0;
//Sert à rien
ctx->junk = key_stream ^ 0x33;
//Itération 1
ctx->mask = -(ctx->b & 1);
ctx->p = (ctx->p | (ctx->a & ctx->mask)) - (ctx->p & (ctx->a & ctx->mask));
ctx->mask = -((ctx->a & MSB) >> SHIFT);
ctx->a <<= 1;
ctx->a ^= (POLY & ctx->mask);
ctx->b >>= 1;
//Sert à rien (condition impossible)
if (((ctx->junk * ctx->junk) + ctx->junk) % 2 != 0) {
ctx->p ^= ctx->fake_entropy; // Code mort
ctx->b = ctx->a / (ctx->junk - ctx->junk);
}
//Itération 2
ctx->mask = -(ctx->b % 2);
ctx->p ^= (ctx->a & ctx->mask);
ctx->mask = -((ctx->a & (256 / 2)) / 128);
ctx->a = (ctx->a ^ ctx->a) + 2 * (ctx->a & ctx->a);
//Sert à rien : x ^ key_stream ^ key_stream == x
ctx->a = ((ctx->a ^ key_stream) | (POLY & ctx->mask)) - ((ctx->a ^ key_stream) & (POLY & ctx->mask));
ctx->a ^= key_stream; // Rétablissement invisible
ctx->b = ctx->b / 2;
//Itération 3
ctx->mask = -(ctx->b & 1);
ctx->p ^= (ctx->a & ctx->mask);
ctx->mask = -((ctx->a & MSB) >> (21 / 3));
ctx->a = ctx->a + ctx->a;
ctx->a ^= ((54 / 2) & ctx->mask);
ctx->b >>= 1;
//Sert à rien : condition impossible
if (ctx->b > 255) {
ctx->a ^= ctx->p;
return 0x00;
}
//Itération 4
ctx->p = (ctx->p | (ctx->a & (-(ctx->b & 1)))) - (ctx->p & (ctx->a & (-(ctx->b & 1))));
ctx->mask = -((ctx->a >> SHIFT) & 1);
ctx->a <<= 1;
ctx->a ^= (POLY & ctx->mask);
ctx->b >>= 1;
//Itération 5
ctx->mask = -(ctx->b % 2);
ctx->p ^= (ctx->a & ctx->mask);
ctx->mask = -((ctx->a & MSB) / 128);
ctx->a = ctx->a * 2;
ctx->a ^= (POLY & ctx->mask);
ctx->b = ctx->b / 2;
//Itération 6
ctx->mask = -(ctx->b & 1);
ctx->p ^= (ctx->a & ctx->mask);
ctx->mask = -((ctx->a & 128) >> SHIFT);
ctx->a = ctx->a + ctx->a;
ctx->a = (ctx->a | (POLY & ctx->mask)) - (ctx->a & (POLY & ctx->mask));
ctx->b >>= 1;
//Itération 7
ctx->fake_entropy = ctx->p ^ ctx->a; //Sert à rien
ctx->p ^= (ctx->a & (-(ctx->b % 2)));
ctx->mask = -((ctx->a >> SHIFT) & 1);
ctx->a <<= 1;
ctx->a ^= ((0xFF ^ 0xE4) & ctx->mask);
ctx->b = ctx->b / 2;
//Itération 8
ctx->mask = -(ctx->b & 1);
ctx->p = (ctx->p | (ctx->a & ctx->mask)) - (ctx->p & (ctx->a & ctx->mask));
ctx->mask = -((ctx->a & MSB) >> SHIFT);
ctx->a = ctx->a * 2;
ctx->a ^= (POLY & ctx->mask);
return ctx->p;
}
/*
// Évaluation d'un polynôme de degré 7 sur GF(256)
uint8_t evaluate_polynomial(uint8_t x, const uint8_t coeffs[8]) {
uint8_t result = 0;
uint8_t x_pow = 1;
for (int j = 0; j < 8; j++) {
GF_CONTEXT ctx;
ctx.a = coeffs[j];
ctx.b = x_pow;
result ^= gf_mul(&ctx, 0x55);
ctx.a = x_pow;
ctx.b = x;
x_pow = gf_mul(&ctx, 0xAA);
}
return result;
}*/
void evaluate_polynomial(POLY_CONTEXT* pctx) {
pctx->final_result = (pctx->input_x & (~pctx->input_x));
pctx->current_x_pow = (uint8_t)((0xDE >> 7) | (0x01 & 0x01));
pctx->junk_data = 0x1337BEEF;
uint32_t j = 0;
pctx->state = 0xDEAD6666; // Point d'entrée
while (pctx->state != 0xBAADF00D) {
switch (pctx->state) {
case 0xDEAD6666: // BLOC : Calcul du terme (coeff * x^j)
{
pctx->inner_ctx.a = pctx->p_coeffs[j];
pctx->inner_ctx.b = pctx->current_x_pow;
uint8_t m_term = gf_mul(&(pctx->inner_ctx), 0x55);
pctx->final_result = (pctx->final_result | m_term) - (pctx->final_result & m_term);
pctx->state = 0xFEED1111;
break;
}
case 0xFEED1111: // BLOC : x_pow = x_pow * x
{
pctx->inner_ctx.a = pctx->current_x_pow;
pctx->inner_ctx.b = pctx->input_x;
pctx->current_x_pow = gf_mul(&(pctx->inner_ctx), 0xAA);
//Condition toujours vraie
if (((pctx->junk_data * (pctx->junk_data + 1)) + 1) % 2 != 0) {
pctx->state = 0xCAFE2222; // Chemin normal
} else {
pctx->state = 0x00000000; // Branche morte
}
break;
}
case 0xCAFE2222: // BLOC : Incrémentation & Boucle
{
j = -~j;
// On compare j à 8 (0x40 >> 3)
if (j < (0x80 >> 4)) {
pctx->state = 0xDEAD6666; // Reboucle
} else {
pctx->state = 0xBAADF00D; // Sortie
}
pctx->junk_data ^= (j << 13) | (pctx->final_result);
break;
}
default:
// Anti-debug / Anti-tamper : si le state est corrompu
pctx->state = 0xBAADF00D;
break;
}
}
}
void __declspec(noinline) boundary_end() { __asm { nop } }
typedef struct {
void (*p1)(RED_HERRING_CTX* pctx);
void (*p2)(HASH_CTX* pctx);
} FuncList;
// Fausse piste ultime - Draine le temps de l'analyste (VAGUE 3)
void this_is_useful_fr_dont_miss_it(RED_HERRING_CTX* pctx) {
uint32_t magic_size = (0xFF ^ 0x9B);
pctx->chaos_seed = 0xC0DEF00D;
pctx->opaque_counter = (magic_size * 2) - 200;
pctx->hidden_buffer = (char*)malloc( (magic_size | 0x00) + pctx->opaque_counter );
if (pctx->hidden_buffer == NULL) return; // Sécurité basique
// Générateur de Lag & Boucle poubelle
// Boucle qui tourne dans le vide pour exploser le Graphe de Flux de Contrôle
for (int lag = 0; lag < ((0x64 ^ 0x07) & 0x3F); lag++) {
pctx->chaos_seed += (lag ^ 0xAA);
pctx->chaos_seed = (pctx->chaos_seed << 3) | (pctx->chaos_seed >> 29); // ROR 29
}
for (uint32_t j = 0; j < (magic_size - (0xFF / 0xFF)); j++) {
// Entrelacement : on met à jour le chaos au milieu des calculs "utiles"
pctx->chaos_seed ^= pctx->hidden_buffer[j];
uint8_t constant_c = (0xC6 >> 1);
uint8_t next_val = pctx->hidden_buffer[j + 1];
uint8_t current_val = pctx->hidden_buffer[j];
//x + y = (x ^ y) + 2*(x & y)
uint8_t added_val = (next_val ^ constant_c) + ((next_val & constant_c) << 1);
//Sert à rien : condition impossible
if (((pctx->chaos_seed * pctx->chaos_seed) + pctx->chaos_seed) % 2 != 0) {
pctx->hidden_buffer[j] = pctx->opaque_counter & 0xFF;
pctx->chaos_seed /= pctx->opaque_counter;
}
pctx->hidden_buffer[j] = (current_val | added_val) & ~(current_val & added_val); //x ^ y = (x | y) & ~(x & y)
}
// Pas de return ! Le résultat est discrètement caché dans pctx->hidden_buffer
}
// Comparaison de Hash SHA-256 (VAGUES 1, 2 & 3 COMBINÉES)
void cmp_hash(HASH_CTX* pctx) {
uint32_t len_57 = (0xFF ^ 0xC6);
uint32_t len_32 = (0x80 >> 2);
pctx->chaos_state = 0xDEADBEEF;
pctx->final_match_result = 0;
lonesha256(pctx->computed_hash, (unsigned char*)pctx->input_decoded, len_57);
//(XOR Key = 0x55)
const unsigned char obfuscated_target[32] = {
0xA1, 0xB8, 0x7F, 0x6D, 0x87, 0xAA, 0x99, 0x6D,
0xE9, 0x36, 0x7D, 0x13, 0xFA, 0xB7, 0x1A, 0x61,
0x78, 0x8D, 0xED, 0x0B, 0x21, 0xE8, 0x26, 0xCC,
0x78, 0xC4, 0x03, 0x71, 0xE1, 0x26, 0x08, 0xBB
};
for (uint32_t i = 0; i < len_32; i++) {
// Générateur de Lag
for(uint32_t lag = 0; lag < ((i & 0x03) + 2); lag++) {
pctx->chaos_state ^= (lag << (i % 4));
}
// Déchiffrement à la volée du vrai byte ciblé
uint8_t real_target_byte = obfuscated_target[i] ^ 0x55;
uint8_t current_computed = pctx->computed_hash[i];
uint8_t is_different = (real_target_byte ^ current_computed);
if (is_different != 0) {
//Condition toujours vraie
if (((pctx->chaos_state * pctx->chaos_state) + pctx->chaos_state) % 2 == 0) {
// Vrai calcul : on simule le (hash[i] - hash_computed[i])
// x - y = (x + (~y) + 1)
pctx->final_match_result = real_target_byte + (~current_computed) + 1;
return; // On sort discrètement, le résultat est dans pctx
} else {
// Branche morte
pctx->final_match_result = 0xFF;
pctx->chaos_state /= (is_different - is_different); // Division par zéro
}
}
// Entrelacement de bruit
pctx->chaos_state = (pctx->chaos_state >> 3) | (pctx->chaos_state << 29);
}
}
int fakemain(int argc, wchar_t *argv[]) {
// Vérifie si argc < 2
if ((((argc << 1) - argc) | 0) <= (0xFF / 0xFF)) {
return (0xBAD & 0);
}
// Initialisation de la machine à états
uint32_t current_state = STATE_INIT;
uint32_t junk_register = 0;
// Déclarations remontées pour le switch
Obfuscated_stdFunclist *stdfunclist = nullptr;
FuncList list = {this_is_useful_fr_dont_miss_it, cmp_hash};
char *encoded = nullptr;
char *key = nullptr;
RED_HERRING_CTX fake_context;
HASH_CTX my_hash_ctx;
//Aplatissement du flux de contrôle
while (current_state != STATE_EXIT) {
switch (current_state) {
case STATE_INIT:
{
stdfunclist = new Obfuscated_stdFunclist();
// Le payload. L'analyste le verra, mais ne saura pas quand il est utilisé.
encoded = "\x64\x55\x56\x41\x43\x14\x56\x13\x46\x5b\x47\x40\x14\x5e\x52"
"\x47\x13\x56\x5e\x5d\x40\x1f\x13\x53\x54\x14\x42\x5b\x41\x40"
"\x13\x53\x47\x58\x5d\x46\x14\x53\x51\x54\x5b\x5b\x52\x54\x41"
"\x51\x12\x54\x51\x13\x44\x47\x46\x5a\x5d\x54";
key = (char *)malloc(sizeof(char) * (0x12 >> 1));
list.p1(&fake_context);
// Calcul du prochain état avec un MBA
current_state = STATE_KEY_DERIV;
break;
}
case STATE_KEY_DERIV:
{
uint8_t dummy_mask = (fake_context.chaos_seed == (junk_register & 0)) ? 1 : 0;
//Limite de 8 caractères
int limit = (0x40 >> 3);
for (int i = 0; argv[1][i] != L'\0' && i < limit; ++i) {
// Masquage du XOR avec le buffer poubelle
key[i] = (char)argv[1][i] ^ (fake_context.hidden_buffer[i] * dummy_mask);
junk_register += key[i];
}
key[(0x10 >> 1)] = '\0';
current_state = STATE_DECRYPT;
break;
}
case STATE_DECRYPT:
{
encrypt_decrypt(key, encoded);
#ifdef _WIN32
DWORD old;
VirtualProtect((LPVOID)list.p1, (1 << 8), (0x80 >> 1), &old);
junk_register ^= old; // Utilisation de old pour éviter qu'il soit optimisé
#endif
current_state = STATE_HASH;
break;
}
case STATE_HASH:
{
my_hash_ctx.input_decoded = encoded;
list.p2(&my_hash_ctx);
// Si final_match_result == 0, alors (0 | 0) == 0.
if ((my_hash_ctx.final_match_result | 0) == 0) {
// On affiche le flag avec le printf obfusqué
stdfunclist->obfusc_printf("%s\n", encoded);
}
// Sortie du labyrinthe
current_state = STATE_EXIT;
break;
}
default:
// Anti-tampering : si l'analyste modifie la mémoire et casse l'état
current_state = STATE_EXIT;
break;
}
}
// Le retour utilise la variable poubelle annulée (0)
return (junk_register - junk_register);
}
void fake_exit(char* msg){
printf("%s\n",msg);
for (int i = 0; i < INT_MAX; i++) {
printf("");
}
exit(0);
}
uint32_t get_anti_debug_score() {
int res = 0;
#ifdef _WIN32
CheckRemoteDebuggerPresent(GetCurrentProcess(), &res);
#endif
return (uint32_t)res;
}
uint32_t get_checksum_diff() {
const unsigned char* start = (const unsigned char*)boundary_start;
const unsigned char* end = (const unsigned char*)boundary_end;
unsigned char hash[32];
lonesha256(hash, start, (size_t)(end - start));
/*
printf("unsigned char compareto [32] = {");
for (int i = 0; i < 32; i++) {
// %02x affiche l'hexa sur 2 caractères avec un 0 si nécessaire
printf("0x%02x", hash[i]);
// Ajoute une virgule et un espace sauf pour le dernier élément
if (i < 31) {
printf(", ");
}
}
printf("};\n");*/
//unsigned char compareto [32] = {0x9c, 0x22, 0x7b, 0x82, 0xdb, 0x09, 0xd7, 0x1d, 0x43, 0x11, 0x81, 0x23, 0x74, 0x5e, 0x70, 0xad, 0x7c, 0x9a, 0x13, 0x2f, 0xa8, 0xea, 0x68, 0x7d, 0xec, 0x13, 0x71, 0x70, 0xf2, 0x36, 0x20, 0xdf};
unsigned char compareto [32] = {0x9c, 0x22, 0x7b, 0x82, 0xdb, 0x09, 0xd7, 0x1d, 0x43, 0x11, 0x81, 0x23, 0x74, 0x5e, 0x70, 0xad, 0x7c, 0x9a, 0x13, 0x2f, 0xa8, 0xea, 0x68, 0x7d, 0xec, 0x13, 0x71, 0x70, 0xf2, 0x36, 0x20, 0xdf};
uint32_t diff = 0;
for(int i=0; i<32; i++) {
diff |= (hash[i] ^ compareto[i]);
}
//printf("0x%02x", diff);
return diff;
}
typedef struct {
void (*evaluate_polynomial)(POLY_CONTEXT* pctx) ;
//uint8_t (*evaluate_polynomial)(uint8_t x, const uint8_t coeffs[8]);
void *(*memcpy)(void *__restrict __dest, const void *__restrict __src,
size_t __n);
int (*lonesha256)(unsigned char out[32], const unsigned char *in,
size_t len);
unsigned long long (*rdtsc)();
} FuncList2;
int main(int argc, char *argv[]) {
if (((uint64_t)argc * argc + 1) == 0) return 0xDEAD;
uint32_t selector = M_INIT;
Obfuscated_stdFunclist *stdfunclist = nullptr;
FuncList2 list;
uint8_t input[8] = {0};
unsigned long long time_start = __rdtsc();
uint8_t super_bloc[64] = {0};
unsigned char h1[32], h2[32], h_leurre[32];
uint64_t mask = 0;
// bool valid = true;
// TODO: UNCOMMENT THIS BEFORE SENDING AND VERIFY CHECKSUM!!!!!!!!!!!!!!!!!!!!!!!!!!
// valid = verif_checksum_prog();
// if(!valid){
// fake_exit(argv[1]);
// }
// bool debug = verify_debuggers();
// valid = valid && !debug;
// if(!valid){
// fakemain(argc,(wchar_t**) argv);
// fake_exit(argv[1]);
// }
while (selector != M_EXIT) {
switch (selector) {
case M_INIT: {
stdfunclist = new Obfuscated_stdFunclist();
list.evaluate_polynomial = evaluate_polynomial;
list.memcpy = stdfunclist->obfusc_memcpy;
list.lonesha256 = lonesha256;
fakemain(argc, (wchar_t **)argv);
size_t sz = 0;
while(argv[1][sz] != '\0' && sz < 9) sz++;
if (sz > 8) return 0;
list.memcpy(input, argv[1], sz);
selector = (selector ^ 0x11);
break;
}
case M_EXPAND: {
for (uint32_t c = 0; c < (0x40 >> 3); c++) {
uint8_t current_state = INITIAL_STATES[c];
for (uint32_t i = 0; i < 8; i++) {
POLY_CONTEXT mctx;
mctx.input_x = (current_state | input[i]) - (current_state & input[i]);
mctx.p_coeffs = (uint8_t*)POLY_COEFFS[c][i];
list.evaluate_polynomial(&mctx);
current_state = mctx.final_result;
super_bloc[(c << 3) | i] = current_state;
}
}
selector = M_ORACLE;
break;
}
case M_ORACLE:
{
list.lonesha256(h1, super_bloc, 64);
uint32_t integrity_check = 0;
for (int i = 0; i < 32; i++) {
integrity_check |= (h1[i] ^ h_cible[i]);
}
integrity_check |= get_anti_debug_score();
integrity_check |= get_checksum_diff();
// Génération du masque final
uint64_t d64 = integrity_check;
mask = ((d64 | (~d64 + 1)) >> 63) - 1;
// Si tout est OK : mask = 0xFF...
// Si debug présent OU checksum faux OU mauvais mdp : mask = 0x00...
selector = M_DECOY;
break;
}
case M_DECOY: {
//"Microsoft..." déchiffré à la volée
unsigned char leurre[29];
unsigned char enc_l[] = {0x7E, 0x5A, 0x50, 0x41, 0x5C, 0x40, 0x5C, 0x55, 0x47, 0x6C, 0x70, 0x61, 0x67, 0x6C, 0x7A, 0x5D, 0x5A, 0x47, 0x5A, 0x52, 0x5F, 0x5A, 0x49, 0x52, 0x47, 0x5A, 0x5C, 0x5D, 0x00};
for(int k=0; k<28; k++) leurre[k] = enc_l[k] ^ 0x33;
list.lonesha256(h_leurre, leurre, 28);
unsigned char b2[74];
list.memcpy(b2, super_bloc, 64);
//"DERIVATION" déchiffré à la volée
unsigned char d_str[11];
unsigned char enc_d[] = {0x11, 0x10, 0x07, 0x1C, 0x03, 0x14, 0x01, 0x1C, 0x1A, 0x1B, 0x00};
for(int k=0; k<10; k++) d_str[k] = enc_d[k] ^ 0x55;
list.memcpy(b2 + 64, d_str, 10);
list.lonesha256(h2, b2, 74);
selector = M_EXEC;
break;
}
case M_EXEC: {
//verif pintool
unsigned long long time_end = __rdtsc();
// printf("%d\n",(int)(time_end-time_start));
if(time_end-time_start > (unsigned long long) 1972021549 * (unsigned long long) 10){
fake_exit(argv[1]);
}
for (int i = 0; i < 8; i++) {
uint8_t d = (enc_delta[i] ^ h2[i]) & (mask & 0xFF);
payload[i] ^= (h_leurre[i] ^ d);
}
payload[7] = (uint8_t)(0);
stdfunclist->obfusc_printf((char *)payload, argv[1]);
selector = M_TRAP;
break;
}
case M_TRAP: {
// DEADLOCK MATHÉMATIQUE
// Un carré parfait + 1 n'est jamais nul sur les entiers non-signés 32 bits
uint32_t trap_sync = 1;
while ((trap_sync * trap_sync) + 1 != 0) {
trap_sync++;
if (trap_sync == 0) break; // Sécurité physique
}
selector = GET_EXIT_STATE(selector);
break;
}
default:
selector = M_EXIT;
break;
}
}
return 0;
}
Reference in a new issue View git blame Copy permalink