I'm trying to understand the proof that the OTP is a perfect cipher.(adsbygoogle = window.adsbygoogle || []).push({});

I tried to understand the proof shown in http://web.mit.edu/6.857/OldStuff/Fall97/lectures/lecture2.pdf but I don't understand the part C = y and K = (x XOR y).

Could someone assist me in understanding the proof?

Thanks!

BiP

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Proof that OTP is a perfect cipher

Loading...

Similar Threads for Proof perfect cipher | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Cantor's decimal proof that (0,1) is uncountable | Sep 27, 2017 |

A A "Proof Formula" for all maths or formal logic? | Apr 19, 2017 |

I Regarding Cantor's diagonal proof. | Feb 28, 2017 |

How often are tests revised before being perfected? | Feb 2, 2011 |

**Physics Forums - The Fusion of Science and Community**