Black Hat and DEF CON: Hacks and Fun
The great annual experience of Black Hat and DEF CON starts in just a few days, and we here at IOActive have a lot to share. This year we have several groundbreaking hacking talks and fun activities that you won’t want to miss! For Fun Join IOActive for an evening…
Black Hat and DEF CON: Hacks and Fun
The great annual experience of Black Hat and DEF CON starts in just a few days, and we here at IOActive have a lot to share. This year we have several groundbreaking hacking talks and fun activities that you won’t want to miss! For Fun Join IOActive for an evening…
Interview of ret2libc
Almost one month since our last article, time flees. This article is an interview of a new contributor, that greatly enhanced one of the most visually impressive feature of radare2, the one that our propaganda department contributors loves to show at conferences! Who are you ? Hi, I’m ret2libc, I…
PoliCTF RE350 – JOHN THE PACKER – PIN + Z3
The 32bit ELF is a self modyfing code. So I decided to use PIN for futher analysis. $ pin -t obj-ia32/exectrace.so -- ./re350 flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0}0x80488f8 : cmp eax, 0x210x80488f8 : [0x21] [0x21]$ ltrace -i ./re350 flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0}[0x80488f5] strlen("flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0"...) = 33Length of flag is 33 bytes Once the length is know, lets search…
PoliCTF RE350 – JOHN THE PACKER – PIN + Z3
The 32bit ELF is a self modyfing code. So I decided to use PIN for futher analysis. $ pin -t obj-ia32/exectrace.so -- ./re350 flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0}0x80488f8 : cmp eax, 0x210x80488f8 : [0x21] [0x21]$ ltrace -i ./re350 flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0}[0x80488f5] strlen("flag{ABCDEFGHIJKLMNOPQRTSUVWXYZ0"...) = 33Length of flag is 33 bytes Once the length is know, lets search…
PoliCTF RE200 – REVERSEMEPLZ
This is a 32 bit binary which validates a key. Removing the dead codes, this is what the algorithm looks like: for (size_t i = 0; i < 0xF; i++) { if (key[i] < 'a') key[i] = transform(key[1] & 1); if (key[i] > 'z') key[i] = transform(key[1] & 2); dec[i]…
PoliCTF RE200 – REVERSEMEPLZ
This is a 32 bit binary which validates a key. Removing the dead codes, this is what the algorithm looks like: for (size_t i = 0; i < 0xF; i++) { if (key[i] < 'a') key[i] = transform(key[1] & 1); if (key[i] > 'z') key[i] = transform(key[1] & 2); dec[i]…