You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Use this function if you need to compute modulo for large numbers (eg. RSA). This function is faster then the recursive one.
Tested in matlab's profiler on:
4448780^91884097(mod 961)
results:
- recursive function: 2.578 s
- this function: 0.016 s.
algorythm source:
http://www.disappearing-inc.com/ciphers/rsa.html
(this page does not exist any longer, but I saved it at that time and you'll find it in the zip file)
Cite As
bennyboss (2026). big modulo function (https://www.mathworks.com/matlabcentral/fileexchange/7908-big-modulo-function), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: big x^y modulo function
General Information
- Version 1.2.0.0 (1.49 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
