Letssplitturtles.part02.rar Official

This write-up covers the second part of the challenge from CSAW CTF, focusing on the exploitation of a recursive data structure to achieve code execution. Challenge Overview

The core of this stage involved crafting a precision payload that aligned with the program's expectations of the turtle structure while redirecting the instruction pointer. LetsSplitTurtles.part02.rar

The exploit was verified using to step through the turtle traversal logic. A critical finding during this phase was that the RBP (Base Pointer) register did not land at the expected offset, requiring a slight adjustment to the slack space to ensure the magic gadget was reached successfully. This write-up covers the second part of the

: By placing a magic_gadget address at a specific offset ( +0x60 ), the program was forced to execute the desired shellcode or function when it attempted to traverse to the "next" turtle. Execution & Debugging A critical finding during this phase was that

For a deep dive into the specific assembly and memory offsets used in this exploit, you can view the full technical breakdown on nickcano.com .

: A 64-byte ( 0x40 ) buffer of null bytes provided a safe landing zone for the program's internal processing.