Update for 15-12-21 15:45

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]]

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

tech/security.wiki

@@ -14,6 +14,7 @@ Hiding information
 === Misc ===
 
 * [[LFSR|Linear Feedback Shift Registers]]
+* [[modular_exponentiation|Modular Exponentiation]]
 
 === Math for Crypto ===