This blogpost contains the solutions for Narnia series of challenges from overthewire, this category of challenges are aimed at beginners to binary exploitation.

Let’s take a look at the code of this program.The below C code is the source code for the first challenge in the Narnia series of challenges from Overthewire.

Narnia 0-1

From the code it’s clear we need to give val the value of 0xdeadbeef to get a shell as narnia1 user. By observing the code we can spot the issue from scanf() function. The scanf() is used to get the input for buffer buff. and this function have no bound checkings on input, buf variable is 20 bytes long but the scanf() reads in 24 bytes hence we can overwrite the variable “val” with any value we like.


Our target binary is an ELF 32-bit binary.ELF is Executable Linkable Format which consists of a symbol look-ups and relocatable table, that is, it can be loaded at any memory address by the kernel.


Let’s send some crafted input to the program and monitor


Great we have overwritten the val variable with 0x43434343 which is our 4 “C”. Now we know we can overite the val variable . We just need to replace “C” with 0xdeadbeef which is the correct value the program accept. Before that we need to convert 0xdeadbeef to little endian format as we are on little endian machine.

0xdeadbeef to little endian “\xef\xbe\xad\xde”.

Grabbing the flag:


Full exploit



Pwned! Nice and simple bufferoverflow challenge .Next challenge is Narnia1.