From 404f84f1786e9410765bd995bd02c859c202cfd6 Mon Sep 17 00:00:00 2001
From: Tyler Perkins <tperki17@kent.edu>
Date: Wed, 15 Dec 2021 15:45:01 -0500
Subject: [PATCH] Update for 15-12-21 15:45

---
 tech/algorithms.wiki             |  1 +
 tech/modular_exponentiation.wiki | 12 ++++++++++++
 tech/security.wiki               |  1 +
 3 files changed, 14 insertions(+)
 create mode 100644 tech/modular_exponentiation.wiki

diff --git a/tech/algorithms.wiki b/tech/algorithms.wiki
index 044c3c3..984221e 100644
--- a/tech/algorithms.wiki
+++ b/tech/algorithms.wiki
@@ -56,5 +56,6 @@ Different ways to store and operate on data, with differing efficiency
 == Common operations ==
 
 * [[gcd]] - Find the GCD of two numbers
+* [[modular_exponentiation|Modular Exponentiation]] - Solve a^b mod n
 
 [[index]]
diff --git a/tech/modular_exponentiation.wiki b/tech/modular_exponentiation.wiki
new file mode 100644
index 0000000..86d5984
--- /dev/null
+++ b/tech/modular_exponentiation.wiki
@@ -0,0 +1,12 @@
+= Modular Exponentiation =
+
+Modular Exponentation applies to problems of the format
+
+a^b mod n
+
+often when a^b becomes some very large number. This is a common problem to
+solve in computer science, espeically cryptography.
+
+Two things to keep in mind
+- (x^a)^s = x^2a
+- x^(a+b) = x^a * x^b
diff --git a/tech/security.wiki b/tech/security.wiki
index e3f45c1..d360678 100644
--- a/tech/security.wiki
+++ b/tech/security.wiki
@@ -14,6 +14,7 @@ Hiding information
 === Misc ===
 
 * [[LFSR|Linear Feedback Shift Registers]]
+* [[modular_exponentiation|Modular Exponentiation]]
 
 === Math for Crypto ===