From 47a05238acd8a51d2b61dc4c4b3522d58dce8a1b Mon Sep 17 00:00:00 2001 From: Tyler Perkins Date: Mon, 31 Jan 2022 14:30:01 -0500 Subject: [PATCH] Update for 31-01-22 14:30 --- math/relative_prime.wiki | 2 +- tech/RSA.wiki | 28 ++++++++++++++++++++++++++++ tech/security.wiki | 6 +++++- 3 files changed, 34 insertions(+), 2 deletions(-) diff --git a/math/relative_prime.wiki b/math/relative_prime.wiki index 41555bf..96fbe19 100644 --- a/math/relative_prime.wiki +++ b/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. diff --git a/tech/RSA.wiki b/tech/RSA.wiki index 080d215..2bd9275 100644 --- a/tech/RSA.wiki +++ b/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 diff --git a/tech/security.wiki b/tech/security.wiki index c195bd0..ed6d076 100644 --- a/tech/security.wiki +++ b/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