Update for 31-01-22 14:30

math/relative_prime.wiki

@@ -1,5 +1,5 @@
 = Relative Prime =
 
 Two numbers are Relative Primes if they have not common prime factors.
-Equivalently, a and b are relatively prime if their [[gcd]] is 1.:w
+Equivalently, a and b are relatively prime if their [[gcd]] is 1.
 

tech/RSA.wiki

@@ -1 +1,29 @@
 = RSA =
+
+RSA is an asymetric encryption algorithm based on the difficulty of factoring
+large prime numbers.
+
+== algoirthm ==
+
+1) choose some p and q
+   * where p and q are very large primes
+   * n = p * q
+2) T = (p-1)(q-1)
+   * known as eulers totient
+3) choose 2 values e and d
+   * where (e * d) mod T = 1
+   * where e < T
+   * [[../math/relative_prime]] with T and N
+4) we now have our keys
+   * n and e are public keys
+   * n and d are private keys
+
+=== example ===
+
+p = 2; q = 7
+
+therefore,
+
+n = 14; T = 6
+
+Due to restrictions, choose e = 5

tech/security.wiki

@@ -2,6 +2,8 @@
 
 Tools useful for security, either offensive or defensive
 
+-------------------
+
 == Cryptology ==
 
 Hiding information
@@ -10,7 +12,7 @@ Hiding information
 
 === Ciphers ===
 
-==== Symetric ciphers ====
+==== Symetric Ciphers ====
 
 * [[substitution|Substitution]]
 * [[Affine]]
@@ -33,6 +35,8 @@ Hiding information
 
 * [[../math/congruences]]
 
+-------------------
+
 == Reconnaissance ==
 
 * [[nmap|nmap]] - port scanner