CTF Writeups
In this writeup we will see how you can use Turbo Intruder to win tight race conditions.
In this writeup we will see how to run and debug a mips binary and how to exploit a simple buffer overflow.
Today we will see how I used frida to memoize the computation of a recursive function to optimize a binary and get the flag.
In this writeup we will show how we reversed an implementation of Splay Trees, found an out of bound read, and used it to cause a double free and exploit the libc tcache to achieve code execution.
Today we will solve a simple crack me by avoiding the hard work of reversing the check function. We will use r2pipe to bruteforce this function after realizing each input character is checked independently.
This is a writeup explaining how I wrote a shellcode payload bypassing a size limit and avoiding repeated bytes.
I wasn’t able to solve this challenge during the CTF, but I decided read a writeup and try again! In this post I’ll share what I learned.
Today we will solve a simple pwnable challenge by inserting shellcode on the stack with a nop sled, and then jumping to it.
In this writeup I will share how I exploited my first ever pwn challenge on a CTF, which was a very small part of why we managed to qualify for the VolgaCTF finals in Samara, Russia! The exploit uses a format string vulnerability to leak the libc and the canary, and then we will use a stack buffer overflow to ROP and get code execution.