Recall the simple binary substitution $(``$XOR$\text{'}\text{'})$ cipher described in class, in which a binary digit in the plaintext is encrypted with a $0$ if it is the same as the corresponding binary digit in the keyword, and with a $1$ if not. This cipher is special in what respect?

Group of answer choices

It is a recipocal algorithm, meaning it uses a single method for both encryption and decryption.

The algorithm for decoding is the exact reverse of the algorithm for encoding.

It uses a one$-$way function to encrypt.

It can be used as either a transposition or substitution cipher.

It can operate on ASCII representations of either upper$-$case or lower$-$case letters.