---
# System prepended metadata

title: LA CFT Challenge
tags: [UCLA_CTF]

---

# LA CTF Challenge




## :triangular_flag_on_post: Flag Information

:::success
brief mention the CTF name and context
:::

:small_blue_diamond:Challenge Name: **rev/aplet321**  
:small_blue_diamond:Description: **Unlike Aplet123, Aplet321 might give you the flag if you beg him enough.**

## :triangular_flag_on_post:
:::success
screenshot of the Challenge
:::

![Screenshot 2024-03-10 at 1.41.06 PM](https://hackmd.io/_uploads/rJCyocoa6.png)




## :pencil: Getting the Solution
:::success
information needed for solving the problem
:::


:small_blue_diamond: Base Knowledge: **The initial work done towards this problem was understanding how to read the program on binary ninja cloud.**  
:small_blue_diamond: Research: **The next step is looking searching lines of code you may not understand.**




## :pencil: The actual solution

:::success
walkthrough of the steps to solve the challange
:::

:small_blue_diamond: step 1: **Download the aplet321**
:small_blue_diamond: step 2: **open up a new session on binary ninja cloud with the downloaded file and navigate to the main function of the program**
![Screenshot 2024-03-10 at 1.50.31 PM](https://hackmd.io/_uploads/ByYXp5sa6.png)

:small_blue_diamond: step 3: **Key details to notice is the code is looking for text pretty, please, and flag. to progress but this is not enough as the code will print "sorry, i'm not allowed to do that."**
:small_blue_diamond: step 4: **The key is the if statement below and when translated means you need to type pretty 15 times and please 39 times and flag"**

![Screenshot 2024-03-10 at 1.58.25 PM](https://hackmd.io/_uploads/HyClyisTT.png)


:small_blue_diamond: **Here is a demo of the program in action."**
![Screenshot 2024-03-10 at 2.15.04 PM](https://hackmd.io/_uploads/r1u1XooaT.png)
