ASIS CTF Quals 2018: Fifty Dollars Write-up

Solved by sherl0ck I found this challenge the best challenge in this CTF and used the House of Orange to solve it. I dunno whether there is an easier way to solve this. Anyway, the binary that was provided was 64-bit non stripped and dynamically linked one. Here are the mitigations that were imposed on the binary... Continue Reading →

Advertisements

0ctf quals: babyheap Writeup

Solved by sherl0ck For this challenge, we were given a 64-bit stripped and dynamically linked binary. The given libc was version 2.24, that has some checks that its predecessors did not have. Let's start by looking at the mitigation's enforced on the binary - gdb-peda$ checksec CANARY : ENABLED FORTIFY : disabled NX : ENABLED... Continue Reading →

BackdoorCTF 2018: bookkeeping Write-up

Solved by sherl0ck This was my first challenge that involved the shared memory object concept and I found it pretty interesting to solve. The provided binary began to segfault after an initial run and I contacted the admins who promptly addressed the issue and released an update for this challenge. The shared object was not... Continue Reading →

N1CTF 2018: vote Writeup

Solved by sherl0ck Firstly, kudos to the organizers for conducting such a quality CTF. Coming to this particular challenge, we were given the libc and the binary. The following were the mitigation's enforced on the binary- gdb-peda$ checksec CANARY : ENABLED FORTIFY : disabled NX : ENABLED PIE : disabled RELRO : Partial Reversing this... Continue Reading →

InCTF 2017: stupidrop Writeup

Challenge Author: sherl0ck This challenge was originally meant to be solved using srop (SigReturn Oriented Programming). But it ended up having a bug with which it was possible to directly invoke the execve syscall. This write-up will be focusing on solving the challenge using srop. As usual, let's start off by checking the permissions of the given binary.... Continue Reading →

InCTF 2017- GiantXOR Writeup

Author: s0rc3r3r Points: 250 Standard Encryption but can you break it? Intended Solution This challenge is a little bit tricky as compared to other crypto tasks. The text is encrypted using Repeating Key XOR, but instead of encrypting the normal plaintext, the function first encodes the message in base64 and then encrypts using Repeated Key... Continue Reading →

Create a free website or blog at WordPress.com.

Up ↑