1. Lecture 1.

    • Memory Layout of C program.
    • ELF binaries.
    • Overview of stack during function call.
    • Assembly code for the function call and return.
    • Concept of $ebp and $esp.
    • Executable memory.
  2. Lecture 1.5.

    • How Linux finds the binaries utilis?
    • Simple exploit using Linux $PATH variable.
  3. Lecture 2.

    • What are stack overflows?
    • ASLR (basics), avoiding Stack protection.
    • Shellcodes
    • Buffer overflow:
      • Changing Control of the program to return to some other function
      • Shellcode injection in buffer and spawning the shell
  4. Lecture 3.

    • Shellcode injection with ASLR enabled.
      • Environment variables.
  5. Lecture 3.5

    • Return to Libc attacks.
    • Spawning shell in non executable stack
    • Stack organization in case ret2libc attack.
  6. Lecture 4.

    • This folder contains the set of questions to exploit binaries on the concept that we have learned so far.
  7. Lecture 5.

    • What is format string Vulnerability?
    • Seeing the content of stack.
    • Writing onto the stack.
    • Writing to arbitrary memory location.
  8. Lecture 6.

    • GOT
    • Overriding GOT entry.
    • Spawning shell with format string vuln.
  9. Lecture 7.

    • Heaps
    • Arena, Bins, Chunks.
    • Use after free exploit.
    • Double free exploit.
Rohit Sehgal
Rohit Sehgal
Travel, Code, Help and Excel

My research interests include Web Application security, Linux System security, Development and DevSecOps. And yes, I love nature, and nature photography.

comments powered by Disqus