1
$\begingroup$

Suppose we have the following crypto system: $P = C = K = \{0, 1, . . . , n − 1\}$, $E_k(x) = (x + k) \bmod n$ and $D_k(y) = (y − k) \bmod n$. Prove that the crytosystem has perfect secrecy. Perfect secrecy means that the ciphertext does not leak any information about the plaintext (i.e., $P(X = x) = P(X = x \mid Y = y)$).

| improve this question | | | | |
$\endgroup$
  • 2
    $\begingroup$ I don't really see a question. Just a command. I.e., "prove this for me" instead of "how would I prove this". That said, I believe the latter has been explored on here at least once. $\endgroup$ – mikeazo Dec 17 '14 at 19:17
1
$\begingroup$

What you are describing is One-Time-Pad encryption, and yes it does have perfect secrecy.

Note that for any ciphertext $y$ there is exactly one key $k'$ for each possible plaintext $x'$ so that $E_k(x') = y$. So if you choose the key uniformly at random the ciphertext gives no information on the plaintext, because any plaintext is equally likely.

| improve this answer | | | | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.