XOR cipher
In cryptography, the simple XOR cipher is a type of additive cipher, an encryption algorithm that operates according to the principles: A ⊕ {\displaystyle \oplus } 0 = A, A ⊕ {\displaystyle \oplus } A = 0, A ⊕ {\displaystyle \oplus } B = B ⊕ {\displaystyle \oplus } A, (A ⊕ {\displaystyle \oplus } B) ⊕ {\displaystyle \oplus } C = A ⊕ {\displaystyle \oplus } (B ⊕ {\displaystyle \oplus } C), (B ⊕ {\displaystyle \oplus } A) ⊕ {\displaystyle \oplus } A = B ⊕ {\displaystyle \oplus } 0 = B For example where ⊕ {\displaystyle \oplus } denotes the exclusive disjunction (XOR) operation. This operation is sometimes called modulus 2 addition (or subtraction, which is identical).