These are notes I took on Hamming Distance and some of the mathematical implications that can be used in applied cryptography from back when I was learning to program.
Notes on XOR
XOR = Exclusive Or. In a typical two-variable truth table, XOR outputs T for TF, FT, and F for TT, FF. In this construction, we set 1 to T and 0 to F.
Let's think through some of the implications.
XOR'ing identical strings return all 0s (#1 & #4)
XOR'ing against the same string twice is the same as XOR'ing against all 0s
XOR'ing against all 0s return the original string unchanged (#1 & #3 from 1st perspective, #1 & #2 from 2nd perspective)
XOR is commutative
Observe all four rows of the table above, and note what happens when there is an odd number of 1s and when there is an even number of 1s (where zero is even) in the 1st and 2nd bits. Note that when there is an odd number of 1s, the result is 1, when there is an even number of 1s, the result is 0. The order doesn't matter (i.e., it's commutative), just the total number of 1s matters.
The Hamming Distance between two strings is how many bits of difference exist between those two string. This can be discovered by doing an XOR and summing the 1s in the result.
Notes on Cipher Text
Cipher text (or ciphertext) is encrypted text. The original, unencrypted text is plain text (or plaintext). When the plaintext is encrypted it is XOR'd against a key. (The key text can be repeated until it matches the length of the plaintext, so that the plaintext can be fully XOR'd. You can think of plaintext as a secret message and the key as the password.)
Let's observe an interesting fact of ciphertexts. If two pieces of ciphertext were encrypted with the same key, then XOR'ing them will cancel out the keys due to some of the observations we made above. Let
C be the ciphertext,
P be the plaintext,
K be the key, and
x be the XOR operation.
C1 = P1xK C2 = P2xK C1xC2 = P1xKxP2xK = P1xP2xKxK (commutativity and KxK is all 0s, which returns the other string.) => C1xC2 = P1xP2
Notes on Unicode's UTF-8 & ASCII
English characters are encoded into bytes serially, meaning their bit representations are very similar. For example,
a b c = 01100001 01100010 01100011. From this observation alone, it is hopefully intuitive that XOR'ing two strings of bits that each represent encoded English words will result in a lot more total 0s in the resultant string than when XOR'ing two completely random strings of bits. In fact, doing the math, the probability of a 1 showing up when XOR'ing random bit sequences is around 50%, while the probability of a 1 showing up when XOR'ing two non-random bit sequences encoding English text is around 30%.