0Pricing
Assembly Language & x86 Low-Level Systems Programming · Leçon

Dépassements de tampon et shellcode

Découvrez le fonctionnement des vulnérabilités de dépassement de tampon et la manière dont elles peuvent être exploitées pour injecter et exécuter du shellcode malveillant.

Dépassements de tampon et shellcode est une leçon Assembly Language & x86 Low-Level Systems Programming gratuite sur CoddyKit. Ceci est la leçon 3 sur 4. Tu peux lire la leçon complète ci-dessous gratuitement — puis la pratiquer en direct dans le navigateur avec un éditeur de code intégré et un tuteur IA 24/7. Elle fait partie du parcours d'apprentissage Assembly Language & x86 Low-Level Systems Programming, et ta progression se synchronise sur le web et l'application CoddyKit. Le cours Assembly Language & x86 Low-Level Systems Programming comprend 4 leçons au total.

Certaines parties de cette leçon n'ont pas encore été traduites et s'affichent en anglais.

Intro: Buffer Overflows

Welcome to a critical topic in low-level security: Buffer Overflows. These are a type of software vulnerability that can allow attackers to gain control over a program.

Essentially, a buffer overflow occurs when a program tries to write more data into a fixed-size memory buffer than it was designed to hold. This excess data 'overflows' into adjacent memory regions.

What's a Buffer?

In programming, especially in languages like C or assembly, a buffer is simply a block of memory reserved for storing data. Think of it like a container with a specific capacity.

  • Buffers are often used for temporary storage, like holding user input or network data.
  • They can be declared as arrays of characters (strings) or other data types.
  • For example, char username[32]; declares a buffer that can hold up to 31 characters plus a null terminator.

Code: A Vulnerable Buffer

Let's look at a simple C program with an intentional buffer overflow vulnerability. Pay close attention to the strcpy function.

strcpy copies a string from source to destination, but it does not check the destination buffer's size. This is a common source of overflows.

/* buffer_example.c */
#include <stdio.h>
#include <string.h>

// This function is intentionally vulnerable
void vulnerable_greet(char *name_input) {
  char buffer[16]; // A small buffer, 16 bytes
  
  // This is the vulnerability! strcpy doesn't check size.
  // If name_input is longer than 15 chars (+ null terminator),
  // it will overflow 'buffer'.
  strcpy(buffer, name_input); 
  
  printf("Hello, %s!\n", buffer);
}

int main() {
  // Let's call the vulnerable function with a safe input
  vulnerable_greet("CoddyKit User"); 
  
  printf("Program finished normally.\n");
  
  return 0;
}

The Stack Frame

To understand how overflows can be exploited, we need to revisit the call stack. When a function is called, a new stack frame is created.

This stack frame typically contains:

  • Local variables for the function.
  • The saved Base Pointer (EBP/RBP).
  • Most importantly: the Return Address, which tells the CPU where to resume execution after the function finishes.

Overwriting the Return Address

When a buffer overflow occurs on the stack, the excess data doesn't just corrupt adjacent local variables. If enough data is supplied, it can overwrite the saved EBP and then the return address itself.

By changing the return address, an attacker can trick the program into jumping to an arbitrary memory location instead of returning to the legitimate caller. This is the core mechanism for many buffer overflow exploits.

Introducing Shellcode

So, where does the attacker want the program to jump? Usually, to a piece of code they control, known as shellcode.

  • Shellcode is a small, self-contained piece of machine code.
  • Its primary purpose is often to execute a 'shell' (a command prompt) on the target system.
  • It can also perform other malicious actions, like creating new users, downloading files, or connecting to a remote server.

Anatomy of Simple Shellcode

Shellcode is typically written in assembly language to be as compact and efficient as possible. It avoids null bytes (\x00) because many string functions stop copying at the first null byte.

A common goal is to call the execve system call (on Linux) to launch /bin/sh.

; Example (conceptual) Linux x86 shellcode snippet: ; mov eax, 0x0b ; Syscall number for execve ; mov ebx, addr_of_sh ; Pointer to '/bin/sh' string ; mov ecx, 0 ; Arg 2 (argv) = NULL ; mov edx, 0 ; Arg 3 (envp) = NULL ; int 0x80 ; Invoke kernel (syscall)

Injecting Shellcode

How does the shellcode get into the program? The attacker includes it as part of the malicious input that causes the buffer overflow.

When the buffer overflows, the shellcode is written into the program's memory, usually on the stack, alongside the overwritten return address.

Exploit Structure: NOP Sled

Attackers often use a NOP sled (No Operation sled) to increase the reliability of their exploit.

  • A NOP sled is a sequence of 'No Operation' (NOP) instructions (e.g., \x90 in x86).
  • If the attacker overwrites the return address to point anywhere within the NOP sled, the CPU will simply execute NOPs until it 'slides' into the actual shellcode.
  • This compensates for slight inaccuracies in guessing the exact memory address of the shellcode.

Defenses & Mitigations

Operating systems and compilers have developed several defenses against buffer overflows:

  • ASLR (Address Space Layout Randomization): Randomizes memory addresses to make guessing the return address or shellcode location harder.
  • DEP/NX Bit (Data Execution Prevention/No-Execute): Marks memory regions (like the stack) as non-executable, preventing shellcode from running there.
  • Stack Canaries: Compiler-generated random values placed on the stack; if overwritten, the program detects tampering and aborts.
  • Safe Functions: Using functions like strncpy, snprintf, fgets, or C++ strings that perform bounds checking.

Check Your Understanding

A stack buffer overflow allows an attacker to write past the end of a buffer. What is the primary goal an attacker aims to achieve by carefully crafting input to overwrite the return address?

Recap: Overflows & Shellcode

In this lesson, we explored the dangerous world of buffer overflows. We learned that they occur when too much data is written into a fixed-size buffer, corrupting adjacent memory.

Crucially, if this overflow reaches the return address on the stack, an attacker can hijack program control. They achieve this by injecting shellcode—small, malicious machine code—and redirecting execution to it, often aided by a NOP sled. We also touched upon essential mitigation techniques like ASLR, DEP, and stack canaries.

Questions Fréquemment Posées

La leçon « Dépassements de tampon et shellcode » est-elle gratuite ?

Oui — le texte complet de « Dépassements de tampon et shellcode » est gratuit à lire ici sur le web. Pour la pratiquer de manière interactive (un éditeur de code intégré et un tuteur IA 24/7) et déverrouiller le reste du cours Assembly Language & x86 Low-Level Systems Programming, passe à CoddyKit PRO. Le cours Assembly Language & x86 Low-Level Systems Programming comprend 4 leçons au total.

Qu'est-ce que j'apprendrai dans « Dépassements de tampon et shellcode » ?

Découvrez le fonctionnement des vulnérabilités de dépassement de tampon et la manière dont elles peuvent être exploitées pour injecter et exécuter du shellcode malveillant. Tu pratiques Assembly Language & x86 Low-Level Systems Programming avec du code pratique que tu exécutes directement dans le navigateur, et un tuteur IA 24/7 répond à tes questions au fur et à mesure que tu avances dans la leçon.

Dois-je avoir de l'expérience pour commencer Assembly Language & x86 Low-Level Systems Programming ?

Aucune expérience préalable n'est requise. Assembly Language & x86 Low-Level Systems Programming sur CoddyKit est structuré pour les débutants jusqu'aux apprenants avancés, donc tu peux commencer ici ou depuis le début et avancer à ton rythme. Ceci est la leçon 3 sur 4.

Combien de temps prend la leçon « Dépassements de tampon et shellcode » ?

La plupart des leçons CoddyKit prennent environ 5–10 minutes. Chacune est courte et interactive, tu progresses régulièrement et tu repiques exactement où tu t'es arrêté sur le web et l'app.

Peux-tu écrire et exécuter du code dans cette leçon Assembly Language & x86 Low-Level Systems Programming ?

Oui. Chaque leçon Assembly Language & x86 Low-Level Systems Programming inclut un éditeur de code intégré, tu écris et exécutes du vrai code directement dans ton navigateur et tu reçois des retours IA instantanés — aucune configuration locale requise.

Toutes les leçons de ce cours

  1. Cohérence du cache et performances
  2. Optimiser manuellement les sections critiques
  3. Dépassements de tampon et shellcode
  4. Prédiction des branchements et exécution spéculative
← Retour à Assembly Language & x86 Low-Level Systems Programming