big modulo function

Computes modulo for large numbers.

Description

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)

Acknowledgements

The author wishes to acknowledge the following in the creation of this submission:
big x^y modulo function

• MATLAB release: MATLAB 7 (R14)

[saahil kumar]

this one is really great it works....however i need decoding code also plz help using big modulo...plzz help me asap

[Pontus Nelldal]

 

[DJD k;j]

 

[krishkr]

Easier this way->

a=java.math.BigInteger('4448780');
b=java.math.BigInteger('91884097');
c=java.math.BigInteger('961');
a.modPow(b,c)

A wrapper class is all that is needed to make them good looking :)