PIE TIME picoCTF 2025 Solution

Published: April 2, 2025

Description

A PIE-protected binary leaks the address of main each time you connect. Use that leak to compute the absolute address of win and jump there instead of returning to main.

Fetch both the binary and its source so you can inspect the control flow (win simply prints the flag).

Confirm with checksec that PIE is on and a relevant function (win) is present in the symbol table.

Connect to nc rescued-float.picoctf.net <PORT_FROM_INSTANCE> and note the leaked address of main.

Use objdump or radare2 locally to record the offsets of main and win inside the binary.

bash
wget https://challenge-files.picoctf.net/c_rescued_float/2736a730340dbe9969fe3104da0cca0c60eddaf1fedb0e220b5df5a3f3cf015f/vuln.c
bash
wget https://challenge-files.picoctf.net/c_rescued_float/2736a730340dbe9969fe3104da0cca0c60eddaf1fedb0e220b5df5a3f3cf015f/vuln
bash
chmod +x vuln
bash
checksec --file=./vuln
bash
objdump -D vuln | grep -E "<win>|<main>"
bash
nm vuln | grep -E ' T (main|win)$'
Leak then redirect is the canonical PIE-defeat shape. The ASLR / PIE Bypass guide covers the math, and Pwntools for CTF shows the ELF + remote() idiom that automates the offset arithmetic.
  1. Step 1Derive the PIE base
    The binary literally hands you the leak: main itself contains a printf("main is at %p\n", main) call (visible in the source / decompilation), so connecting prints the runtime address before you send any input. Subtract the static main offset (0x133d) to recover the PIE base for that run. Because ASLR randomizes per-process, the leak and your subsequent input run in the same process, so the base stays valid for the whole connection.
    bash
    # Verify the static offsets in the binary first:
    objdump -d vuln | grep -E '<win>:|<main>:'
    
    # Sample output:
    #   00000000000012a7 <win>:
    #   000000000000133d <main>:
    
    pie_base = leaked_main - 0x133d
    Learn more

    Position Independent Executables (PIE) are binaries compiled with -fPIE -pie so that every instruction and data reference uses relative addressing. At load time, the OS kernel maps the binary to a random base address chosen by ASLR (Address Space Layout Randomization). Every subsequent address inside the binary is that base plus the static offset from the compiled binary, so main's runtime address equals pie_base + 0x133d.

    ASLR is per-process: each fresh exec gets a fresh random base. The leak you receive on connect is valid for that connection's exploit because the program prints it inside the same process that will read your input. Reconnecting (or hitting a forking server's sibling worker) will give you a different base, so do not mix leaks across runs.

    objdump -D disassembles all sections of the binary and prints symbol addresses as offsets from zero (since the binary isn't loaded yet). readelf -s and nm provide cleaner symbol table output. The key insight is that these offsets are fixed at compile time - ASLR only randomizes the base, not the relative layout.

  2. Step 2Compute the win address
    Add the static win offset (0x12a7) to the PIE base. Inline pwntools helper below: parse the leak with int(line, 16) and emit the target.
    python
    # Minimal helper - drop into a pwntools script:
    from pwn import *
    p = remote('rescued-float.picoctf.net', PORT)
    leak_line = p.recvline(timeout=2).decode()           # 'main is at 0x...'
    leaked_main = int(leak_line.strip().split()[-1], 16)
    win_address = leaked_main - 0x133d + 0x12a7
    log.info(f'leaked main = {hex(leaked_main)}')
    log.info(f'win address = {hex(win_address)}')
    Learn more

    The address arithmetic win_address = leaked_main - main_offset + win_offset is the fundamental formula for all PIE-defeat exploits. It generalizes to any two symbols in the binary: knowing one runtime address and both static offsets lets you compute any other runtime address. CTF players often write a small Python script using pwntools (from pwn import *) which automates connecting to the service, parsing the leaked address, computing the target address, and sending the exploit.

    Pwntools' ELF class can parse the binary automatically: elf = ELF('./vuln'); main_offset = elf.symbols['main']; win_offset = elf.symbols['win']. This avoids manual offset extraction from objdump and keeps the exploit script portable across different binary versions. The context.arch and context.log_level settings further simplify address packing and debugging output.

    Real-world exploitation frequently involves leaking a libc address (via a puts call or format string) rather than a binary address, computing the libc base, then jumping to system('/bin/sh') or using a ROP gadget chain. The arithmetic is identical - only the target binary (libc vs. the vuln binary) changes.

  3. Step 3Send the target address
    Reconnect (or keep the connection open), paste the computed 0x... value when prompted, and the binary jumps straight into win, printing the flag.
    Learn more

    The mechanism that lets you "send an address" and have the binary jump there is almost always a stack buffer overflow. The vulnerable program reads more input than the buffer can hold, overwriting the saved return address on the stack. When the current function executes its ret instruction, it pops your supplied address into the instruction pointer and execution continues from there.

    The win function pattern - a function that prints the flag but is never called by normal program flow - is a classic CTF teaching device. In real-world binary exploitation, there is no win function; attackers typically chain ROP gadgets to call execve('/bin/sh', NULL, NULL) or use a one-gadget (a single libc address that directly spawns a shell under the right register conditions).

    Keeping the connection alive (rather than reconnecting) is important because ASLR generates a new random base on each process execution. If the service forks (a common CTF server pattern), the child inherits the parent's address space layout, so the leak from one connection is valid for subsequent requests to the same child process. New connections that spawn new processes get fresh ASLR randomization.

Flag

picoCTF{b4s1c_p051t10n_1nd3p3nd3nc3_31cc...}

Keep one terminal open with nc to grab the current leak and a second to run the helper script so the values stay in sync.

How to prevent this

PIE only works if the binary does not hand out leaked addresses for free, and only if user input cannot redirect control flow. Both sides need fixing.

  • Don't print pointer values, return addresses, or anything from %p. Debug logs that leak addresses in error messages are a primary ASLR-bypass vector.
  • Bounds-check every input that lands on the stack. The challenge here only works because the program reads more bytes than the local buffer holds; fgets(buf, sizeof(buf), stdin) instead of gets(buf) closes the door even if a leak exists.
  • Don't accept arbitrary jump targets from untrusted input. If the program needs to dispatch to one of N functions, validate against an allowlist or a small enum before doing the indirect call - never feed user-supplied addresses into a void(*)().
  • Combine PIE with stack canaries (-fstack-protector-strong) and full RELRO (-Wl,-z,relro,-z,now). Even with a leak, the canary blocks the overflow and RELRO blocks GOT overwrites. For high-value services add -D_FORTIFY_SOURCE=2 and AddressSanitizer in early-deploy windows.

Want more picoCTF 2025 writeups?

Tools used in this challenge

Related reading

Do these first

What to try next