2/5/2025
Cryptopals #2 - Fixed XOR
The second cryptopals challenge asks: 'Write a function that takes two equal-length buffers and produces their XOR combination.' This is relatively straightforward in Go.
An XOR (exclusive or) cipher gets applied bit-wise to plaintext. In Go, this comparison is simply a ^ b
.
You can see my solution here