Single-byte XOR Things start to get a little bit interesting, but still nothing tricky, yet. Just like in the last challenge, we have to produce output from some hex input and some key. However, this time, the key is only one byte long.
Hex string:
1b37373331363f78151b7f2b783431333d78397828372d363c78373e783a393b3736
The xor key:
(there is no xor key) Did I mention we have to figure it out?
Now that we have some ready code from the previous challenge, which allows us to xor hex data, we’ll just modify it slightly, so that it will bruteforce the key.
In this series of articles, I am going to attempt to solve the cryptopals crypto challenges. These challenges provide a fun way to learn about cryptography. As mentioned on their website, the challenges are “derived from weaknesses in real-world systems and modern cryptographic constructions”. I will focus mainly on solving them in the Rust programming language, though I do not exclude the possibility of using another language at one point or another in this series.
Welcome to My Blog! I created this space to share and reinforce my knowledge, and perhaps entertain you along the way. I tend to keep things simple, though I will not miss any important details when needed. Hopefully, you will find at least something useful along the way. My posts will mostly cover topics like Linux, cryptography, cybersecurity, and of course there’s going to be at least a little bit of programming involved.