Here is something that is pretty well documented, but I would like to take another look at it because it is so useful. I ran across a little problem during my RSA project. Implementing the RSA equation is pretty simple… except for taking large numbers to a large power. Sure generating large prime values for p&q is somewhat easy, but without some level of care they can slow down any implementation. Thanks to my professors, Dr. Reed and Dr. Mertens, for introducing me to the powermod method, or what is commonly referred to as Modular Exponentiation.