For this challenge, you're given a zipfile called 50.zip
that is encrypted. We're told the password is pass
. What's interesting though is, there's a zipfile within a zipfile, and the password is the same for all the other zipfiles lulz. This makes the challenge relatively easy. And since the file is called 50, then the very last zip file should be 00.zip
.
Knowing that the password is the same for all the other zipfiles, i made a bash script to hammer that all the way.
Running this;
Easy!
We're given a txt file that has two base64 encoded text seperated by a space. I'll cut both the first and second section and base64 decode each.
So, the first section is encoded twice.
For the second section three times and we get the flag. I guess that's why the challenge is called triple.
Let's script this in python shall we!
When we run this…
Literally just googling the name and the very first result is from Reddit
. When you check that, you see his bio with some urlencoded text. Decoding that, you get the flag.
We're given a txt file with some rotated text and was seems to be the flag.
Then i used caesar
to loop through the 26 rotations and see if i can notice anything interesting.
What you notice here is, the flag is somehow arranged going backwards. The first character of the 12th rotation is f
, then the second character of the 11th rotation is l
, third character of the 10th rotation is a
, fourth character of the 9th rotation is g
and so on.
From here i made a list with the rotations sorted according to the flag format. And i did this, by instead using a range of 1 to 38 then using tac to reverse the output. Apparently a range in bash plays a little different from what's in python coz, the list is made of 38 lines instead of 37 in python. I then used tac to reverse the output so that it has the line with f
at the beginning.
Like so. So now with the list, i made a simple python script to hammer that and get the flag. It will basically grab the nth character of the nth line. That means if the line is marked as [0], it will grab the 1st character[0] of the line. If the line is marked as [1], it will grab the second character[1] of the line and then when it's done, it appends each character to form the flag.
Easy!
I feel like touching on one last one that didn't work out as i expected. And the same challenge was once in a ctf, was rated easy, and i still couldn't solve it lulz.
We're given a webpage.
We are supposed to kinda guess an 8-digit number, and it's 8 coz of the placeholder that we can see on the text box.
And if you check the page source, do some directory listing, there's nothing interesting there.
So, decided to build a script that loops through 10000000
to 99999999
and when it finds the string "Oh no!"
in the response, then it knows that's not the right number because that's what we get when we guess wrong.
That was it. After that stopped looping, i went to do something else lol!