XOR

读音

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

释义

1. 異或

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

2. 異或門

   電機工程學

3. 實現「異或」的運算符

   XOR can be used to add bits without carrying.

读音

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

释义

1. 執行異或函數

   transitive

   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:

   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: