[LoopTurn_]

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

[dillpickle]

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

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