The Xor Cipher: Parma's Challenge for the Bold and the Brave

Challenge Overview: In this challenge, you must decrypt the message using the Xor Cipher, a simple yet deceptively complex encryption algorithm. The key is 5 bits long, and the encryption function is: C(x) = x XOR 01101. Decrypt the message, and claim your prize!

Challenge Parameters: Message length: 16 bits. Key: 5 bits. Encryption function: C(x) = x XOR 01101.

Challenge Rules:

1. The message consists of 16 bits, represented as a binary string.

2. The key consists of 5 bits, also represented as a binary string.

3. To decrypt the message, you must apply the XOR operation with the key to each bit of the message, using the key as the right-hand operand.

4. If you succeed, you'll be rewarded with a special prize, hidden in the Prizes Subpage.

Challenge Example:

Suppose the encrypted message is: 11010010011001100. The key is: 01011. What is the decrypted message?

Using the XOR operation, we get: 11010010011001100 XOR 01011 = 10000111110000101.

The decrypted message is: 10000111 10000100.

Challenge Solution: