xor

plural xors

1. The logic function exclusive OR (as opposed to inclusive OR), whose output is true only when exactly one of its inputs is true.

1. rareOr (but not both).

   The argument leads to the conclusion that an omnipotent being could rationally be able to do one xor the other and still be omnipotent.

   2002, Rob Janssen, “The rock argument”, in alt.atheism (Usenet)

   Synonyms: either ... or, eor

plural XORs

1. human sciencesThe connective "exclusive or". One way to state its meaning in plain English is "if either A or B, but not if both."

   The XOR of (0,0) is 0; (0,1) is 1; (1,0) is 1; and (1,1) is 0.

   1 more example

   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).

   2025 August 30, “Logic Gates - Definition, Types, Uses”, in GeeksforGeeks, archived from the original on 11 Sep 2025

2. businessA logic gate that implements "exclusive or".
3. computingThe symbolic representation that implements "exclusive or".

   XOR can be used to add bits without carrying.

present singular third person XORs · participle present XORing · participle past XORed · past XORed

1. transitivecomputingTo perform the XOR function upon.

   The XORed sequence has the same period as the sequence that is not XORed.

   1989, IEEE Communications Society, Conference Record

   2 more examples

   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.

   1998, Stafford Tavares, Henk Meijer, Selected Areas in Cryptography

   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).

   2007, Reinhard Wobst, “Life After DES: New Methods, New Attacks”, in Angelika Shafir, transl., Cryptology Unlocked, John Wiley & Sons, Ltd, →ISBN, section 3 (IDEA: A Special-Class Algoritmh), subsection 5 (Cryptanalyzing IDEA), page 239

   Synonyms: ⊻