From 53d40a515f914fbb4ef0289462725b4613d6dde9 Mon Sep 17 00:00:00 2001
From: Aaron Kaplan
Date: Mon, 20 Oct 2014 23:59:56 +0200
Subject: [PATCH] okay, I think we are ready for the presentation tomorrow
---
presentations/HACK.LU-2014/presentation/agenda.md | 7 +++++--
1 file changed, 5 insertions(+), 2 deletions(-)
diff --git a/presentations/HACK.LU-2014/presentation/agenda.md b/presentations/HACK.LU-2014/presentation/agenda.md
index c543d3f..33a07fb 100644
--- a/presentations/HACK.LU-2014/presentation/agenda.md
+++ b/presentations/HACK.LU-2014/presentation/agenda.md
@@ -271,8 +271,7 @@ Let g be a primitive root mod p. p is a Prime.
Alice to Bob: \[ X = g^x \mod p \]
Bob to Alice: \[ Y = g^y \mod p \]
Alice calculates: \[ k_1 = Y^x \mod p \]
-Bob calculates: \[ k_2 = X^y \mod p
-\text{. Therefore, } k_1 = k_2 \]
+Bob calculates: \[ k_2 = X^y \mod p . \text{. Therefore, } k_1 = k_2 \]
Proof:
\[ k_1 = Y^x = (g^y)^x = g^{(x*y)} = (g^x)^y = X^y = k_2 \mod p \qed \]
@@ -399,6 +398,7 @@ Only clients which support TLS1.2 are covered by these cipher suites (Chrome 30,
_WISHLIST_:
+ * Section on generating CSRs (\texttt{-sha256} etc)
* Mail: Exchange, Sendmail
* SIP
* RDP
@@ -525,6 +525,9 @@ Accept that your commit might be under quite some scrutiny, that's the game.
* **E**ngineering and
* **R**esearch
+
+
+
# Links
* Website: www.bettercrypto.org
--
2.20.1