picoCTF 2022: forensics – Lookey here

Ulli Weichert/ April 5, 2022/ IT-Security, Write-Ups/ 0Kommentare

Lookey here Description Attackers have hidden information in a very large mass of data in the past, maybe they are still doing it. Download the data here. Solving Download File Cat File | grep picoCTF* You also can grep directly with grep -o "picoCTF{.*}" Feel free to use the getflag script. #!/bin/bash echo "Getting flag for you…" grep -o "picoCTF{.*}"

Weiterlesen

picoCTF 2022: binary-exploitation – RPS

Ulli Weichert/ April 5, 2022/ IT-Security, Write-Ups/ 0Kommentare

RPS Description Here’s a program that plays rock, paper, scissors against you. I hear something good happens if you win 5 times in a row. Connect to the program with netcat: nc saturn.picoctf.net 53296 The program’s source code with the flag redacted can be downloaded here. Solving Checking the code (as mentioned in the hint of the challenge) In the

Weiterlesen

picoCTF 2022: Crypto – substitution challenges

Ulli Weichert/ April 4, 2022/ IT-Security, Write-Ups/ 0Kommentare

Substitution Challenges Because this challenges are all very similar, we will not describe them in own articles 🙂 . Solving Substitutions cypher replace the 26 letters of an alphabet with other letters (one letter matches only one other). If you can find out which letter was replaced with which letter, then you can crack this cypher relatively easily. The best

Weiterlesen

picoCTF 2022: Crypto – rail-fence

Ulli Weichert/ April 3, 2022/ IT-Security, Write-Ups/ 0Kommentare

rail-fence Description A type of transposition cipher is the rail fence cipher, which is described here. Here is one such cipher encrypted using the rail fence with 4 rails. Can you decrypt it? Download the message here. Put the decoded message in the picoCTF flag format, picoCTF{decoded_message}. Solving So – there is everything we need to know in the challenge

Weiterlesen

picoCTF 2022: Crypto – Diffie Hellman

Ulli Weichert/ April 3, 2022/ IT-Security, Write-Ups/ 0Kommentare

diffie-hellman Description Alice and Bob wanted to exchange information secretly. The two of them agreed to use the Diffie-Hellman key exchange algorithm, using p = 13 and g = 5. They both chose numbers secretly where Alice chose 7 and Bob chose 3. Then, Alice sent Bob some encoded text (with both letters and digits) using the generated key as

Weiterlesen