Solve this challenge to maybe win something. Due by next meeting (but you could always do it for fun).
Implement repeating-key XOR
What does that mean? In repeating-key XOR, you'll sequentially apply each byte of the key. Let's say our key is "ICE"; the first byte of plaintext will be XOR'd against I, the next C, the next E, then I again for the 4th byte, and so on. Here's an example:
Burning 'em, if you ain't quick and nimble I go crazy when I hear a cymbal
Should come out to:
0b3637272a2b2e63622c2e69692a23693a2a3c6324202d623d63343c2a26226324272765272 a282b2f20430a652e2c652a3124333a653e2b2027630c692b20283165286326302e27282f
To prove that you got something working, email your source code to "[email protected]" and let us test it ourselves. May the best hacker win.