Sheet 5

General Information

Make sure you have read and understood everything in Exercise Requirements and Grading Guidelines!

Remember to put a block comment at the beginning of the solution file for each task, describing the vulnerability (including relevant addresses or instructions) and your general plan how to exploit it.

The deadline for this sheet is 2026-07-05 22:00:00 UTC

Task 17 – Simple Heap (8 Points)

This exercise uses a simple implementation for malloc and free which you can find in simple_heap.c.

Exploit the simple_heap binary to print the flag.

Edit the provided solution template and explain your approach with meaningful comments!

Your solution should execute like this:

1
2

./solution
FLAG{some letters here}

Task 18 – Simple Heap, but different (8 Points)

This exercise uses a simple implementation for malloc and free which you can find in simple_heap.c.

Exploit the simple_heap binary and print the flag!

Edit the provided solution template and explain your approach with meaningful comments!

Your solution should execute like this:

1
2

./solution
FLAG{some letters here}

Task 19 – An unlinkely secure binary (8 Points, individual Task)

Back to glibc, are you still able to to print the flag?

hint: How do we heap again?

Your solution should execute like this:

1
2

./solution
FLAG{some letters here}

Task 20 – Frankenstein (8 Points)

Behold, a text editor as unassuming as the ancient tomes of forgotten knowledge. Within its binary, the essence of the 1818 edition of Frankenstein is displayed. Yet, a cunning adventurer might perceive the fissures within its design. Dare you exploit this creation, and from the heart of the digital monster, extract the hidden flag?

Hints:

• How does the heap look after typing a bunch of characters?
• Figure out how to overflow, leak and subsequently rewrite the contents of the heap.

Thus shall your endeavor culminate in this manner:

1
2

./solution
FLAG{some letters here}