What is so special about dening OTP using the xor operation? Suppose we use the

bitwise$-$and operation $($which we will write as $$&$)$ and dene a variant of OTP as follows:

KeyGen:

k $\{0,1\}$

$\backslash$lambda

return k

Enc$($k$,$m in $\{0,1\}$

$\backslash$lambda

$)$:

return k & m

Is this still a good choice for encryption? Why $/$ why not?