> For the complete documentation index, see [llms.txt](https://alham-rizvi.gitbook.io/alhamrizvi/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://alham-rizvi.gitbook.io/alhamrizvi/binary-exp/04.-stack-overflow/challenge/easy/solution1.md).
# solution1
The binary presents a simple stack buffer overflow inside the `vulnerable()` function. A struct is used to control memory layout, where a 64-byte buffer `buf` is placed directly before an integer variable `magic`. The program reads user input using `gets()`, which does not enforce any bounds checking, allowing us to overflow past `buf` and overwrite adjacent memory.
At runtime, the binary even confirms the layout by printing the distance between `buf` and `magic`, which is 64 bytes. This tells us that after writing 64 bytes into the buffer, the next 4 bytes will overwrite the `magic` variable.
To avoid guessing offsets, a cyclic pattern was used. A 100-byte cyclic string was generated using pwntools and sent as input to the program. After execution, the program showed that `magic` had been overwritten with the value `0x61616171`. This value was passed into `cyclic_find()`, which returned an offset of 64, confirming the exact overwrite position.
The goal of the challenge is to set `magic` to `0xdeadbeef`. Since the system uses little-endian architecture, the value must be written in reverse byte order as `\xef\xbe\xad\xde`. With the offset known, the final payload consists of 64 bytes of padding followed by this 4-byte value.
The exploit is constructed by sending 64 bytes of junk data followed by the little-endian representation of `0xdeadbeef`. This successfully overwrites the `magic` variable with the required value, satisfying the condition in the program and triggering the flag.
The final payload is generated and sent using Python:
```
python3 -c "from pwn import *; print(b'A'*64 + p32(0xdeadbeef))" | ./v1
```
Upon execution, the program confirms that `magic` is now `0xdeadbeef` and prints the flag.
This challenge demonstrates a fundamental stack buffer overflow where control over adjacent variables is achieved through unchecked input. It reinforces key concepts such as offset calculation using cyclic patterns, understanding memory layout, and handling little-endian byte order for correct value injection.
---
# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.
## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.
Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:
```
GET https://alham-rizvi.gitbook.io/alhamrizvi/binary-exp/04.-stack-overflow/challenge/easy/solution1.md?ask=&goal=
```
`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.
Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.