**Public Key Cryptography –** The RSA cryptosystem uses a public key and ,where is a product of two primes, and the private key which is the multiplicative inverse of . A message is encrypted by , and decrypted using , .

The RSA encryption system is practical since it doesn’t require messages to have their own communication line and computing with only and takes a very long time. Computing requires one to factor which can take a computer anywhere from decades to centuries and even millenniums.

**Computing –** Data structures such as stacks and hash tables can be created by using the modulo operation to reference indexes.

Other Applications can be found in number theory and abstract algebra.

- What is Modular Arithmetic?
- Basic Operations
- Multiplicative Inverse
- Fermat’s Little Theorem
- Euler’s Totient Function
- Applications

*Filed under : Crash Courses, Mathematics*

**Sources Used**

- Elementary Number Theory by James K. Strayer
- Data Abstraction and Problem Solving with C++, Walls and mirrors by Frank M. Carrano