缓冲区溢出与 Shellcode
探索缓冲区溢出漏洞的工作机制，以及如何利用它们注入并执行恶意 Shellcode。
缓冲区溢出与 Shellcode 是 CoddyKit 上的免费 Assembly Language & x86 Low-Level Systems Programming 课时。 这是第 3 节课，共 4 节。 你可以在下方免费阅读本课时的完整内容 — 然后在浏览器中使用内置代码编辑器和全天候 AI 导师进行实践。 这是 Assembly Language & x86 Low-Level Systems Programming 学习路径的一部分，你的进度在网页和 CoddyKit 应用中同步。 Assembly Language & x86 Low-Level Systems Programming 课程共包含 4 节课。
本课时的部分内容尚未翻译，以英文显示。
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.,
\x90in 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.
常见问题解答
「缓冲区溢出与 Shellcode」课时是免费的吗？
是的 — 「缓冲区溢出与 Shellcode」的完整文本可在网页上免费阅读。要进行交互式练习（内置代码编辑器和全天候 AI 导师）并解锁 Assembly Language & x86 Low-Level Systems Programming 课程的其余内容，请升级到 CoddyKit PRO。 Assembly Language & x86 Low-Level Systems Programming 课程共包含 4 节课。
「缓冲区溢出与 Shellcode」这节课中我会学到什么？
探索缓冲区溢出漏洞的工作机制，以及如何利用它们注入并执行恶意 Shellcode。 你通过在浏览器中直接运行的动手代码来练习 Assembly Language & x86 Low-Level Systems Programming，全天候 AI 导师会在你学习这节课的过程中回答你的问题。
学习 Assembly Language & x86 Low-Level Systems Programming 需要有经验吗？
无需任何先前经验。CoddyKit 上的 Assembly Language & x86 Low-Level Systems Programming 课程适合初学者到高级学习者，你可以从这里开始或从头开始，按照自己的节奏学习。 这是第 3 节课，共 4 节。
「缓冲区溢出与 Shellcode」课时需要多长时间？
大多数 CoddyKit 课程大约需要 5–10 分钟。每节课都很精短且互动，所以你能稳步进步，并在网页和应用中从离开的地方继续。
我能在这节 Assembly Language & x86 Low-Level Systems Programming 课中编写并运行代码吗？
能。每节 Assembly Language & x86 Low-Level Systems Programming 课都包含内置代码编辑器，你可以在浏览器中直接编写并运行真实代码，并获得即时 AI 反馈 — 无需本地设置。