Exclusive OR

Exclusive-OR operation. 

See the following for detailed information: 
FIPS 197 under XOR. 
FIPS 197 under ⊕. 
 
Bitwise logical “exclusive-or”, where 0⊕ 0 = 0, 0⊕ 1 = 1, 1⊕ 0 = 1, and 1⊕ 1 = 0. For example: 01101⊕ 11010 = 10111. 

See NIST SP 800-106 under ⊕ for detailed information. 
 
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. 

See NIST SP 800-135 Rev. 1 under ⊕ for detailed information. 
 
An XOR B is equivalent to A ⊕ B. See the definition of the bitwise logical operation ⊕ above. 

See NIST SP 800-135 Rev. 1 under XOR for detailed information. 
 
The bit-by-bit modulo 2 addition of binary vectors of equal length. 

See the following under Exclusive-OR for detailed information: 
NIST SP 800-20.  
NIST SP 800-67 Rev. 2.  

The bitwise addition, modulo 2, of two bit strings of equal length. 

See the following under Exclusive-OR for detailed information: 
 
NIST SP 800-38A.  
NIST SP 800-38B.  
NIST SP 800-38C.  
NIST SP 800-38D. 
NIST SP 800-38F. 

Exclusive-OR. 

See NIST SP 800-38D under XOR for detailed information. 
 
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. 

See NIST SP 800-90A Rev. 1 under Exclusive-or for detailed information. 
 
Exclusive-Or (XOR) operation, defined as bit-wise modulo 2 arithmetic with no carry. 

See NIST SP 800-56B Rev. 2 under Ꚛ for detailed information. 
 
Bit-wise exclusive-or. A mathematical operation that is defined as: 0 ⊕ 0 = 0, 0 ⊕ 1 = 1, 1 ⊕ 0 = 1, and 1 ⊕ 1 = 0. 

See NIST SP 800-133 Rev. 2 under for detailed information.