Modular Exponentiation

y = x^e mod n

main executing reference usage:
usage_modularExponentiation : Example not using binary exponent
usage_modularExponentiation_binaryExponent : Example using binary exponent
fast_ToyBinaryExponentiation_Example : Miscellaneous stand-alone sample runs
modularExponentiation_binaryExponent_typeI : right to left
modularExponentiation_binaryExponent_typeIIA : left to right
modularExponentiation_binaryExponent_typeIIB : left to right
modularExponentiation_binaryExponent_ML_typeII : left to right (Montgomery Ladder)
modularExponentiation_binaryExponent_ML_typeI : right to left (Montgomery Ladder)
modularExponentiation_binaryExponent_Quaternary : right to left (Quaternary method: scanning the bits of e, 2 at a time)
modularExponentiation_binaryExponent_Octal : right to left (Octal method: scanning the bits of e, 3 at a time)
modularExponentiation_binaryExponent_slidingWindow: Constant length nonzero Windows
This demo gives an insight to computing y = x^e mod n.

Caveat: For reference purposes.