From 7996d3b4a7f71e4186f84adc288afeeb8c5d2022 Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Wed, 23 Mar 2022 12:15:01 -0400
Subject: [PATCH] Update for 23-03-22 12:15

---
 tech/RSA.wiki | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/tech/RSA.wiki b/tech/RSA.wiki
index 25a7e39..d384055 100644
--- a/tech/RSA.wiki
+++ b/tech/RSA.wiki
@@ -11,20 +11,20 @@ large prime numbers.
 2) T = (p-1)(q-1)
    * known as eulers totient
 3) choose 2 values e and d
+   * where 1 < e < T
    * where (e * d) mod T = 1
-   * where e < T
-   * [[relative_prime]] with T and N
+   * where e and T are [[relative_prime]]s, or coprime
 4) we now have our keys
    * n and e are public keys
    * n and d are private keys
 
 === encryption ===
 
-`(plaintext value)^e mod N = ciphertext value`
+`(plaintext value)^e mod n = ciphertext value`
 
 === decryption ===
 
-`(ciphertext value)^d mod N = plaintext vlaue`
+`(ciphertext value)^d mod n = plaintext vlaue`
 
 === example ===
 
@@ -38,7 +38,7 @@ 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
+For example then, choose 11 as d
 
 Private key `(11,14)` and public key `(5,14)`