Dictionary

XOR en · NOUN

Pronunciation

• /ˈɛks ˈɔɹ/
• /ˈzɔɹ/

Etymology

Short for exclusive or.

Meanings

1. The connective "exclusive or". One way to state its meaning in plain English is "if either A or B, but not if both."
   • 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:
   • The XOR of (0,0) is 0; (0,1) is 1; (1,0) is 1; and (1,1) is 0.
2. A logic gate that implements "exclusive or".
3. The symbolic representation that implements "exclusive or".
   • XOR can be used to add bits without carrying.

Forms

Antonyms

XNOR (antonym(s) of “electrical engineering”)

Synonyms

XOR gate · NOT equivalence · ex-or · exclusive OR

Translations (16)

ca conexió llogica (logic: connective) · fi eri (logic: connective) · fi eksklusiivinen tai -portti (electrical engineering: logic gate) · et välistav VÕI (logic: connective) · fi eri-portti (electrical engineering: logic gate) · ro a realiza sau exclusiv (logic: connective) · fi ehdoton tai -portti (electrical engineering: logic gate) · fi eksklusiivinen tai (logic: connective) · fi poissulkeva tai (logic: connective) · fi poissulkeva tai -portti (electrical engineering: logic gate) · cmn 異或 /异或 (logic: connective) · fi ehdoton tai (logic: connective) · cmn 異或門 /异或门 (electrical engineering: logic gate) · fr ou exclusif (logic: connective) · ro poartă sau exclusiv (electrical engineering: logic gate) · hu kizáró vagy (logic: connective)

XOR en · VERB

Pronunciation

• /ˈɛks ˈɔɹ/
• /ˈzɔɹ/

Etymology

Short for exclusive or.

Meanings

1. (transitive) To perform the XOR function upon.
   • 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:
   • The XORed sequence has the same period as the sequence that is not XORed. 1989, IEEE Communications Society, Conference Record:
   • 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:

Forms

Relateds

NOR · AND · XNOR · NOT · NAND · OR

Synonyms

⊻