Post Wed Feb 15, 2012 12:21 pm

Questions about the "Smashing the Stack for Fun And Profit" sample code

Hi guys,

I'm newbie in the security field and I've recently started to read the famous paper of Aleph One "Smashing the Stack for Fun And Profit".
I have some problems running the sample code that Aleph1 provides though.

I have managed to run all the examples until the exploit2.c which gives me a sigsegv.

The problem seems to be in this piece of code:

ptr = buff;
addr_ptr = (long *) ptr;
for (i = 0; i < bsize; i+=4)
  *(addr_ptr++) = addr; 

Does anyone know what might be responsible for the segmentation fault?

I have compiled it without the stack protector (-fno-stack-protector) and I have disabled aslr.

Thanks in advance :)