XOR Operation

From the thousands types of encryption, one of the ultimate shift cipher, such as one-time pad, is XOR bitwise operation. To be specific, there are three types of bitwise operation. The definition of the bitwise operation is an operation that is contrasted by byte-level operations which characterize the bitwise operators’ logical counterparts, the AND, OR, and XOR operators. It only deals with binary numbers (0 and 1), or individual bits. The AND operator is known as logical conjunction, and works just like multiplication. The OR operator is known as logical disjunction. The XOR operator outputs a 1 whenever the inputs do not match, which occurs one of the two inputs is exclusively true. To sum up, the XOR operator is the most randomness operator in bitwise operator. This is because the XOR operator has equal frequencies.

Since, XOR operation is one of the strong encryption technique, modern encryptions are relied on XOR operation. To be specific, in order to make unbreakable encryption, people use two or more operations for it’s complexity. The advantages of XOR operations are, first, it is very computable, especially with hard drive. Second, it never makes differences between right and left which led to be commutative. Third, it does not disturb by quantity or sequence of XOR values. Lastly, it is easy to understand and organize.