Reverse Engineering & Binary Analysis Basics · Lesson

Exploit Primitives Overview

Understand basic exploit primitives and how they are used to gain control over a vulnerable program's execution.

Exploit Primitives Overview is a free Reverse Engineering & Binary Analysis Basics lesson on CoddyKit — lesson 3 of 4. You can read the complete lesson below for free — then practise it hands-on in the browser with a built-in code editor and a 24/7 AI tutor. It is part of the Reverse Engineering & Binary Analysis Basics learning path, one of 4 lessons in the course, and your progress syncs across the web and the CoddyKit app.

Exploit Primitives: The Toolkit

In vulnerability research, an exploit primitive is a fundamental capability an attacker gains over a vulnerable program. Think of them as special 'superpowers' that allow you to do things the program wasn't designed for.

These primitives are the building blocks. You often combine several simpler primitives to achieve a more powerful outcome, like running your own malicious code.

The Ultimate Goal: Code Execution

While there are many types of vulnerabilities, the ultimate goal for many attackers is arbitrary code execution. This means forcing the target program to run instructions of the attacker's choosing.

Achieving this often isn't a single step. Instead, it involves gaining one or more exploit primitives and then chaining them together strategically to take full control.

Arbitrary Read Primitive

An arbitrary read primitive allows an attacker to read data from any memory address within the program's address space. This is incredibly powerful!

It can be used to:

Leak sensitive information (e.g., passwords, encryption keys).
Bypass Address Space Layout Randomization (ASLR) by revealing library or stack addresses.
Understand program state to craft further exploit steps.

Try running this simple C code to see a conceptual example of reading beyond a buffer:

#include <stdio.h>
#include <string.h>

// A simple function to demonstrate reading past a buffer
void print_data(char* user_input) {
  char buffer[16]; // A small buffer
  strcpy(buffer, user_input); // Vulnerability: strcpy doesn't check bounds

  // In a real exploit, 'buffer[20]' might contain a secret or a useful address.
  // This illustrates reading an unintended memory location.
  printf("Value at buffer[20] (conceptually): %c\n", buffer[20]);
}

int main() {
  char input_too_long[] = "AAAAAAAAAAAAAAAAAAAAA"; // Longer than 16 bytes
  printf("--- Arbitrary Read Concept ---\n");
  print_data(input_too_long);
  printf("A real primitive would allow reading *any* address, not just nearby.\n");
  return 0;
}

Arbitrary Write Primitive

An arbitrary write primitive enables an attacker to write data to any memory address within the program's address space, with attacker-controlled content.

This is often considered one of the most dangerous primitives because it allows direct manipulation of program state. It can be used to:

Corrupt critical data structures.
Overwrite function pointers to redirect execution.
Modify return addresses on the stack to hijack control flow.

Here's a conceptual example of how a buffer overflow could overwrite data beyond its intended bounds:

#include <stdio.h>
#include <string.h>

int target_value = 0xDEADBEEF; // A value we might want to overwrite

void modify_buffer(char* user_input) {
  char buffer[16]; // A small buffer
  // Vulnerability: strcpy doesn't check bounds, allowing overflow
  strcpy(buffer, user_input);

  printf("Buffer content: %s\n", buffer);
  // If user_input is long enough, it could overwrite target_value
  printf("Target value after potential overflow: 0x%X\n", target_value);
}

int main() {
  char malicious_data[] = "AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBCCCCDDDD";
  printf("--- Arbitrary Write Concept ---\n");
  printf("Initial target_value: 0x%X\n", target_value);
  modify_buffer(malicious_data);
  printf("In a true arbitrary write, 'BBBBCCCCDDDD' would be carefully crafted to overwrite a specific address with desired data.\n");
  return 0;
}

Information Leak Primitive

The information leak primitive is a specific application of an arbitrary read. Its primary purpose is to disclose sensitive information that the program usually keeps private.

Common targets for information leaks include:

Stack addresses: To calculate offsets for return address overwrites.
Heap addresses: To locate specific data structures or objects.
Library base addresses: Essential for bypassing ASLR and finding ROP gadgets.
Sensitive data: Such as encryption keys, user credentials, or internal configuration.

This primitive is crucial for overcoming modern exploit mitigations.

Control Flow Hijacking

Control flow hijacking is the act of redirecting a program's execution path to an address chosen by the attacker. This is typically achieved using arbitrary write primitives.

Key targets for hijacking control flow include:

Return addresses: Overwriting the address on the stack where a function will return.
Function pointers: Modifying a pointer that determines which function is called.
Exception handlers: Redirecting what happens when an error occurs.

Once control flow is hijacked, the attacker can execute their own code or chain existing code.

Return-Oriented Programming (ROP)

When direct arbitrary code execution is prevented (e.g., by Data Execution Prevention - DEP), attackers turn to Return-Oriented Programming (ROP). ROP allows code execution by chaining together small snippets of existing code within the program or its loaded libraries.

These snippets are called ROP gadgets. Each gadget typically ends with a ret instruction, which pops an address from the stack and jumps to it. By controlling the stack, an attacker can control the sequence of gadgets executed.

Anatomy of a ROP Gadget

A ROP gadget is a sequence of one or more machine instructions that ends with a ret instruction. They are found by scanning the binary for specific instruction patterns.

For example, a common gadget might be pop rdi; ret. This gadget would pop a value from the stack into the rdi register (often used for the first argument in x64 function calls) and then return.

By arranging gadget addresses and their arguments on the stack, an attacker can build a custom 'program' using only existing code.

Chaining Primitives for Exploitation

A real-world exploit often involves multiple primitives working together:

An information leak to bypass ASLR and find base addresses of libraries.
An arbitrary write (via a buffer overflow, for example) to overwrite a return address on the stack.
The overwritten return address points to the start of a ROP chain.
The ROP chain uses gadgets to call functions (like system()) with attacker-controlled arguments (like "/bin/sh") to achieve arbitrary code execution.

This modular approach makes exploits powerful and adaptable.

Quick Check: Exploit Primitives

Which exploit primitive is most directly used to bypass Address Space Layout Randomization (ASLR)?

Recap: Exploit Primitives

Today, we've explored the fundamental building blocks of exploits: exploit primitives. We learned about:

Arbitrary Read: Reading any memory location.
Arbitrary Write: Writing to any memory location.
Information Leak: A specialized read for sensitive data, crucial for bypassing ASLR.
Control Flow Hijacking: Redirecting program execution.
Return-Oriented Programming (ROP): Chaining existing code gadgets to achieve execution when direct injection is prevented.

Understanding these primitives is key to both finding and preventing vulnerabilities.

Frequently asked questions

Is the “Exploit Primitives Overview” lesson free?

Yes — the full text of “Exploit Primitives Overview” is free to read here on the web, and the Reverse Engineering & Binary Analysis Basics course includes 4 lessons in total. To practise it interactively (a built-in code editor and a 24/7 AI tutor) and unlock the rest of the Reverse Engineering & Binary Analysis Basics course, upgrade to CoddyKit PRO.

What will I learn in “Exploit Primitives Overview”?

Understand basic exploit primitives and how they are used to gain control over a vulnerable program's execution. You practise Reverse Engineering & Binary Analysis Basics with hands-on code you run directly in the browser, and a 24/7 AI tutor answers your questions as you work through the lesson.

Do I need any experience to start Reverse Engineering & Binary Analysis Basics?

No prior experience is required. Reverse Engineering & Binary Analysis Basics on CoddyKit is structured for beginners through advanced learners; this is — lesson 3 of 4, so you can start here or from the beginning and move at your own pace.

How long does the “Exploit Primitives Overview” lesson take?

Most CoddyKit lessons take about 5–10 minutes. Each one is bite-sized and interactive, so you make steady progress and pick up exactly where you left off across the web and the app.

Can I write and run code in this Reverse Engineering & Binary Analysis Basics lesson?

Yes. Every Reverse Engineering & Binary Analysis Basics lesson includes a built-in code editor, so you write and run real code right in your browser and get instant AI feedback — no local setup required.

All lessons in this course

← Back to Reverse Engineering & Binary Analysis Basics