Kizspy | Question: 5
(Choose 2 answers)
Suppose a message gets encrypted using a bit-by-bit XOR with a key, i.e., the key bit of one flips the message bit at the corresponding location. For example, if p=010, and k=110, then c=100. According to Kerckhoff's Principle, which of the following does the system designer assume that the attacker already knows?
A. Ciphertext c
B. Key k
C. The XOR-based encryption algorithm
D. Plaintext b
