# HG changeset patch
# User Christian Urban <christian dot urban at kcl dot ac dot uk>
# Date 1483527726 -3600
# Node ID c7b690b17b1daacdf7e67d6d8273da7ff21658e7
# Parent  2e23d23933e625f38eed1cec6223ec00d0446b68
updated

diff -r 2e23d23933e6 -r c7b690b17b1d handouts/ho01.tex
--- a/handouts/ho01.tex	Thu Dec 15 16:27:06 2016 +0000
+++ b/handouts/ho01.tex	Wed Jan 04 12:02:06 2017 +0100
@@ -18,6 +18,11 @@
 % how to store passwords
 %https://nakedsecurity.sophos.com/2013/11/20/serious-security-how-to-store-your-users-passwords-safely/
 
+%hashes
+%http://web.archive.org/web/20071226014140/http://www.cits.rub.de/MD5Collisions/
+%https://blog.codinghorror.com/speed-hashing/
+%https://blogs.dropbox.com/tech/2016/09/how-dropbox-securely-stores-your-passwords/
+
 \section*{Handout 1 (Security Engineering)}
 
 
diff -r 2e23d23933e6 -r c7b690b17b1d hws/hw05.pdf
Binary file hws/hw05.pdf has changed
diff -r 2e23d23933e6 -r c7b690b17b1d hws/hw05.tex
--- a/hws/hw05.tex	Thu Dec 15 16:27:06 2016 +0000
+++ b/hws/hw05.tex	Wed Jan 04 12:02:06 2017 +0100
@@ -57,7 +57,7 @@
 
 \item Write down a protocol which establishes a secret key
 between $A$ and $B$ using a mutually trusted third party $S$.
-You can assume $A$ and $S$, respectfully $B$ and $S$, share 
+You can assume $A$ and $S$, respectively $B$ and $S$, share 
 secret keys.
 
 \item Consider the following protocol between a car and a