Past exam of the mathematics course of the University of Cambridge 2011 ii Paper 4 4G Solution Created 2026-09-24 Updated 2026-09-24
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 4 3I a Solution Created 2026-09-24 Updated 2026-09-29
A cipher has perfect secrecy when the conditional probability of every plaintext given a ciphertext equals its prior probability: whenever . Equivalently, the plaintext and ciphertext are independent random variables.
Fix a ciphertext that can occur. Perfect secrecy requires every possible plaintext to remain possible after observing . For a deterministic decryption rule, two different plaintexts producing require two different keys, so the key space has cardinality at least that of the message space.
In a one-time pad, the message and key belong to the same finite additive group, the key is uniform and independent of the message, and encryption is . For every there is exactly one key , soindependent of . Bayes theorem then gives , proving perfect secrecy.
Past exam of the mathematics course of the University of Cambridge 2021 ii Paper 2 15D a Solution Created 2026-09-24 Updated 2026-09-25
Alice and Bob need a uniformly random secret key known only to them. Alice publicly sends the one-time pad ciphertext , and Bob recovers . For every observed and possible message there is exactly one equally likely key , so is independent of and Eve learns nothing.
Past exam of the mathematics course of the University of Cambridge 2023 ii Paper 2 12I a Solution Created 2026-09-24 Updated 2026-10-03
A one-time pad over the finite additive group uses a key that is uniform on , independent of the plaintext , as long as the plaintext, and never reused. Encryption and decryption are
For independent random variables , conditioning reduces entropy and translation by a known element of the finite additive group preserves entropy, soInterchanging and gives , henceThis is the entropy of a sum of independent finite-group variables.
The result explains why adding independent pad symbols cannot reduce uncertainty. For a uniform pad, is itself uniform and is independent of , which is the perfect-secrecy property. Independence is necessary: if is nonconstant and , then is constant, so