Modular Exponentiation

y = x^e mod n
483 Downloads
Updated 23 Jul 2014

View License

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.

Cite As

Michael Chan (2024). Modular Exponentiation (https://www.mathworks.com/matlabcentral/fileexchange/47083-modular-exponentiation), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2013b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Data Acquisition Toolbox Supported Hardware in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes
1.2.0.0

Added Sliding Window Method (Constant length non zero windows)

1.1.0.0

Added Montgomery Ladder, Quaternary method, and Octal method.

1.0.0.0