Pronunciations (2)
-
/ˈɛks ˈɔɹ/
-
/ˈzɔɹ/
Noun
The connective "exclusive or". One way to state its meaning in plain English is "if either A or B, but not if both."
- Examples
-
The XOR of (0,0) is 0; (0,1) is 1; (1,0) is 1; and (1,1) is 0.
More examples (1)
The XOR gate can take only two inputs at a time and give an output. The output of the XOR gate is high (1) only when its two inputs are dissimilar i.e., if one of them is low (0) then other one will be high (1).
A logic gate that implements "exclusive or".
The symbolic representation that implements "exclusive or".
- Examples
-
XOR can be used to add bits without carrying.
Verb
To perform the XOR function upon.
Usage- Transitive
- Examples
-
The XORed sequence has the same period as the sequence that is not XORed.
XORing different constants into the four s-boxes in such a cipher has exactly the same effect as XORing a single constant into each round function output.
More examples (1)
There are weak keys in the sense that their use by foisting chosen plaintexts can be proved, which could be interesting for chip cards with a ‘burnt-in key’. First of all, however, these keys can be easily avoided—one only needs to XOR all subkeys with the hexadecimal number 0x0dae—and second, the probability that such a key can be caught is 2⁻⁹⁶; that is about one out of 10²⁹ randomly selected keys (this number even has a name: 100 quadrilliards).