Improve knowledge baseHEADmaster

1 files changed, 9 insertions, 7 deletions

diff --git a/source/know/concept/diffie-hellman-key-exchange/index.md b/source/know/concept/diffie-hellman-key-exchange/index.md
index 3525881..a6e0894 100644
--- a/source/know/concept/diffie-hellman-key-exchange/index.md
+++ b/source/know/concept/diffie-hellman-key-exchange/index.md
@@ -32,19 +32,22 @@ there is no efficient algorithm to recover $$n$$.
 
 Suppose that Alice and Bob want to exchange encrypted data in the future,
 so they need to agree on an encryption key to use.
-However, they can only exchange messages with each other over
+However, they can only exchange messages over
 an insecure channel, which is being eavesdropped.
 
 After they publicly agree on the values of $$g$$ and $$p$$,
-Alice and Bob each choose a secret number from $$\{0, ..., p \!-\! 2\}$$, respectively $$a$$ and $$b$$,
+Alice and Bob each choose a secret number from $$\{0, ..., p \!-\! 2\}$$,
+respectively $$a$$ and $$b$$,
 and then privately calculate $$A$$ and $$B$$ as follows:
 
 $$\begin{aligned}
     A
-    \equiv g^a \bmod p
-    \qquad \qquad
+    &\equiv f(a)
+    = g^a \bmod p
+    \\
     B
-    \equiv g^b \bmod p
+    &\equiv f(b)
+    = g^b \bmod p
 \end{aligned}$$
 
 Finally, they transmit these numbers $$A$$ and $$B$$
@@ -69,8 +72,7 @@ but cannot recover $$a$$ or $$b$$.
 This assumption is just that: an assumption.
 So far, nobody has been able to prove or disprove it
 for classical computation.
-However, for quantum computers,
-it has already been *dis*proven!
+However, for quantum computers, it has already been *dis*proven!
 In this case, another method must be used,
 for example the [BB84 protocol](/know/concept/bb84-protocol/).