Question: Suppose Alice designs a one - time pad variant: the plaintext is to no longer XOR, but bite - wise multiply the one - time

Suppose Alice designs a one-time pad variant: the plaintext is to no longer XOR, but
bite-wise multiply the one-time key that is generated uniformly at random. For example:
plaintext: 001101
key: 101110
ciphertext: 001100
Is Alices design good?
You should explain if P(M|C)= P(M) by using mathematical proof.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!