> For the complete documentation index, see [llms.txt](https://ncs2021.haydenhousen.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://ncs2021.haydenhousen.com/binary/be02.md).

# BE02 - 100pts

## Briefing

> Download the file and find a way to get the flag. Contents: rot13

Challenge Files:

* [be02.zip](https://github.com/HHousen/NCS-Competition/tree/e3a1ab990b675bd865fdddd9e5fa5cd7895b3b02/Binary/BE02/be02.zip)

## Solution

1. We could decompile the binary using Ghidra to understand how it works, but trial and error is faster for this challenge.
2. Sending a large number of characters as input (a >32 character string) causes a segmentation fault and prints the flag.
3. We can use 33 `a`'s as input to get the flag: `python -c "print('a'*33)" | ./rot13`.

### Flag

`luckyNumber13`