From 1ed8b8beb543be917c74fef9b7e8d72d7ccc61b0 Mon Sep 17 00:00:00 2001 From: Tyler Perkins Date: Tue, 2 Nov 2021 17:15:01 -0400 Subject: [PATCH] Update for 02-11-21 17:15 --- math/congruences.wiki | 12 ++++++++++++ math/gcd.wiki | 4 ++++ math/index.wiki | 2 ++ math/relative_prime.wiki | 5 +++++ tech/security.wiki | 4 ++++ 5 files changed, 27 insertions(+) create mode 100644 math/congruences.wiki create mode 100644 math/gcd.wiki create mode 100644 math/relative_prime.wiki diff --git a/math/congruences.wiki b/math/congruences.wiki new file mode 100644 index 0000000..cb156a5 --- /dev/null +++ b/math/congruences.wiki @@ -0,0 +1,12 @@ += Congrucences = + +A Congruence + +{{{ + ax = 1 (mod m) + }}} + +has a solution x, if and only if a and m are [[relative_prime]]s. The solution +in the range of 1 to m-1 is denoted a^-1 or a^-1 (mod m), called the +multiplicative inverse of a modulo m. + diff --git a/math/gcd.wiki b/math/gcd.wiki new file mode 100644 index 0000000..020300b --- /dev/null +++ b/math/gcd.wiki @@ -0,0 +1,4 @@ += Greatest Common Denominator = + +A greatest common denominator or GCD is the largest number that two numbers can +both divide into diff --git a/math/index.wiki b/math/index.wiki index e550303..4d76bb2 100644 --- a/math/index.wiki +++ b/math/index.wiki @@ -9,3 +9,5 @@ The purest study of them all === Number Theory === * [[prime]] +* [[relative_prime]] +* diff --git a/math/relative_prime.wiki b/math/relative_prime.wiki new file mode 100644 index 0000000..41555bf --- /dev/null +++ b/math/relative_prime.wiki @@ -0,0 +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 + diff --git a/tech/security.wiki b/tech/security.wiki index 1b6373b..9d98b1b 100644 --- a/tech/security.wiki +++ b/tech/security.wiki @@ -10,6 +10,10 @@ Hiding information * [[substitution|Substitution]] +=== Math for Crypto === + +* [[../math/congruences]] + == Reconnaissance == * [[nmap|nmap]] - port scanner