I'm doing this Princeton challenge and I encountered a line I don't understand on the following page http://www.cs.princeton.edu/courses/archive/fall10/cos126/assignments/lfsr.html, the line is just below the first picture of the pipe.
For each pixel (x, y), in the order (0, 0), (0, 1), (0, 2), ..., extract the red, green, and blue components of the color (each component is an integer between 0 and 255).
Then, xor the red component with 8 newly generated bits. Do the same for the green (using another 8 newly generated bits) and, finally, the blue.
Create a new color using the result of the xor operations, and set the pixel to that color.
I'm not quite sure how a new color can be created after 3 xor operations, since an xor operation would only yield a true or false value.