Update for 31-01-22 14:38

tech/Diffie_Helman.wiki

@@ -1 +1,6 @@
 = Diffie Helman =
+
+Diffie Helman is a secret sharing algorithm where a shared secret can be
+created between two parties via an unsecure channel.
+
+

tech/RSA.wiki

@@ -18,12 +18,34 @@ large prime numbers.
    * n and e are public keys
    * n and d are private keys
 
+=== encryption ===
+
+`(plaintext value)^e mod N = ciphertext value`
+
+=== decryption ===
+
+`(ciphertext value)^d mod N = plaintext vlaue`
+
 === example ===
 
-p = 2; q = 7
+`p = 2; q = 7`
 
 therefore,
 
-n = 14; T = 6
+`n = 14; T = 6`
 
 Due to restrictions, choose e = 5
+
+Then choose d from pool of canidiates satisfying `(e * d) mod T = 1`
+
+For example then, choose 14 as d
+
+Private key `(11,14)` and public key `(5,14)`
+
+For example Encrypt B
+
+`2^5 mod 14 = 4` or `D`
+
+Decrypt value
+
+`4^11 mod 14 = 2` or our original `B`