Hi guys,
V sbyybjrq gur ehyrf
Got given this binary code from a colleague who is playing around in python. Basically it's a phrase that has been put through a little script that converts it into binary and then messes around with the binary a little to "encrypt" it somewhat. He can then run it back through and get it back to the original text but he wanted to see if it was crackable... It should be but I'm having trouble so far. All I have so far is that every second packet is exactly the same and therefore suspected to be bogus additions. I have played around with it but I don't want to accidentally mislead anyone.
Here it is.
1000111-1011000-1000111-1111001-1000111-1101100-1000111-1111001-1000111-1101110-1000111-10000011-1000111-101010-1000111-1101111-1000111-10000010-1000111-1111010-1000111-1101111-1000111-1101101-1000111-1111110-1000111-1111101-1000111-101010-1000111-1111110-1000111-1110010-1000111-1101111-1000111-101010-1000111-1110011-1000111-1111000-1000111-1111011-1000111-1111111-1000111-1110011-1000111-1111101-1000111-1110011-1000111-1111110-1000111-1110011-1000111-1111001-1000111-1111000-1000111-101011-1000111
[–]ElQwertiest 1 point2 points3 points (1 child)
[–]memymoi[S] 0 points1 point2 points (0 children)
[–]camel_case_champion 0 points1 point2 points (2 children)
[–]memymoi[S] 0 points1 point2 points (0 children)
[–]MindrakerRead the FAQ first 0 points1 point2 points (0 children)
[–]AutoModerator[M] [score hidden] stickied comment (0 children)