exclusive-OR

{
  "id": "MLC-T-CYB-001613",
  "term": "exclusive-OR",
  "field": "Cybersecurity",
  "definition": "1. The bitwise addition, modulo 2, of two bit strings of equal length.\n\n2. Bitwise logical “exclusive-or”, where 0⊕ 0 = 0, 0⊕ 1 = 1, 1⊕ 0 = 1, and 1⊕ 1 = 0. For example: 01101⊕ 11010 = 10111.\n\n3. Bit-wise exclusive-or. A mathematical operation that is defined as:\n0⊕ 0 = 0\n0⊕ 1 = 1\n1⊕ 0 = 1 , and\n1⊕ 1 = 0\n\n4. A bitwise logical operation such that 1⊕ 1 = 0, 1⊕ 0 = 1, 0⊕ 0 = 0, and 0⊕ 1 = 1. For example, given a string A = 10 and a string B = 11, then A⊕ B = (1⊕ 1) || (0⊕ 1) = 01.\n\n5. A XOR B is equivalent to A ⊕ B. See the definition of the bitwise logical operation ⊕ above.\n\n6. The bit-by-bit modulo 2 addition of binary vectors of equal length.\n\n7. Exclusive-OR.\n\n8. A mathematical operation; the symbol⊕, defined as: 0⊕ 0 = 0 1⊕ 0 = 1 0⊕ 1 = 1 1⊕ 1 = 0 Equivalent to binary addition without carry.\n\n9. Bit-wise exclusive-or. A mathematical operation that is defined as: 0 ⊕ 0 = 0, 0 ⊕ 1 = 1, 1 ⊕ 0 = 1, and 1 ⊕ 1 = 0\n\n10. Exclusive-Or (XOR) operator, defined as bit-wise modulo 2 arithmetic with no carry.",
  "abbreviation": "⊕",
  "synonyms": [
    "eXclusive OR",
    "XOR"
  ],
  "references": [
    "NIST IR 8459; NIST SP 800-38A; NIST SP 800-38B; NIST SP 800-38C; NIST SP 800-38D; NIST SP 800-38F",
    "NIST SP 800-106",
    "NIST SP 800-133 [Superseded]",
    "NIST SP 800-135 Rev. 1",
    "NIST SP 800-20; NIST SP 800-67 Rev. 2; NIST SP 800-67 Rev. 1 [Superseded]",
    "NIST SP 800-38D",
    "NIST SP 800-90A Rev. 1",
    "NIST SP 800-133 Rev.1 [Superseded]; NIST SP 800-133 Rev. 2",
    "NIST SP 800-56B Rev. 1 [Superseded]; NIST SP 800-56B Rev. 2",
    "NIST CSRC Glossary"
  ],
  "url": "https://mlchart.com/terminology/cybersecurity/exclusive-or/"
}