--- a/handouts/ho05.tex	Sun Oct 15 21:23:16 2017 +0100
+++ b/handouts/ho05.tex	Mon Oct 16 19:11:47 2017 +0100
@@ -3,7 +3,7 @@
 \usepackage{../langs}
 
 \begin{document}
-\fnote{\copyright{} Christian Urban, King's College London, 2014, 2016}
+\fnote{\copyright{} Christian Urban, King's College London, 2014, 2016, 2017}
 
 %% the expectation is that anything encrypted today, will be
 %% decrypted in 20 years time
@@ -361,7 +361,7 @@
 talks to $B$. I leave you to argue that $B$ can be sure to
 talk to $A$. Of course these arguments will depend on the
 assumptions that only $A$ and $B$ know the key $K_{AB}$ and
-that nobody can break the encryption unless they have this key
+that nobody can break the encryption
 and that the nonces are fresh each time the protocol is run.
 
 The purpose of the nonces, the random numbers that are sent