![]() |
|
Puzzle - Printable Version +- Hack Forums (https://hackforums.net) +-- Forum: Hacks, Exploits, and Various Discussions (https://hackforums.net/forumdisplay.php?fid=45) +--- Forum: Blackhat • Red Team • Offensive Security (https://hackforums.net/forumdisplay.php?fid=447) +---- Forum: Cryptography, Encryption, and Decryption (https://hackforums.net/forumdisplay.php?fid=126) +---- Thread: Puzzle (/showthread.php?tid=5957661) |
Puzzle - LoopTurn_ - Apr 6, 2019 I was doing a ctf and I found a file called secure.txt. It has this in it but I have no clue what I am supposed to do. secret code is below ZZZZZZZZZZ,mZmZZZmZZZZZZZmZZZZZZZZZZkkkk\.mmmZZZZZZZZZZZZZ]\\\\\\\\\\\]\\\\\\\]ZZZZZZZZZZZZ]mZZZZZZZZZZZZZZZZZZZZZZZ]\\\\\\\\\\\\\\]ZZZZZZZZZZZZ]kZZZZZZZZZZZZZZZZZZZZZ]m\\\\\\\]k\]ZZZZZZZZ]m\\\\]k]mZZZZZ]k\\\]mZZ]k\\\]]kZZZZZZZZZZZZZZZZZZZZZ]mZ]mZZZZZZZZ] my favorite number is 47 RE: Puzzle - dillpickle - Apr 7, 2019 (Apr 6, 2019 04:55 PM)LoopTurn_ Wrote: I was doing a ctf and I found a file called secure.txt. It has this in it but I have no clue what I am supposed to do. Something I noticed: If you imagine the chacacter ']' as a delimiter, the last few instances have the pattern {character}{repeated_number_of_characters}] Since the character is alternating between m and k it makes me think that it could be 1's and 0's and their corresponding frequency. i.e. mZZZZZ]k\\\]mZZ] = 1111100011 or 0000011100 This kind of scheme is similar to a compression algorithm known as Huffman encoding. I dont know if this helps but hopefully it gets the juices flowin |