Question

What is so special about defining OTP using the XOR operation? Suppose we use the bitwise-or operation (which we will write as ‘|’) and define a variant of OTP as follows:

Gen: a key k is chosen from {0,1}ⁿ according to the uniform distribution
Enc: c: = k|m where, m ∈ {0, 1}ⁿ

Answer 1

We use XOR operation for encryption because it allows you to encrypt and decrypt a string. XOR uses four NAND gates than more complicated operations which makes it good to implement in hardware when gate count is going to be important..

XOR is its own inverse which makes its good for applying key material like the same code can be used for both encryption and decryption.AND/OR are not much flexible because they are lightning fast instructions and they are difficult to implement some formulas.  

.XOR encryption is secure information,if the length of the key is same as the length of the input message.IT can be proven that input text and cipher text is distinguishable.

Hence, using XOR operation shows great results and data will be more secure.