Anonymous user
Montgomery reduction: Difference between revisions
no edit summary
mNo edit summary |
No edit summary |
||
Line 4:
Montgomery reduction calculates T*(R^-1) mod m, without having to divide by m
R is usually chosen as b^n, where b = base (radix) in which the numbers in the calculation as represented in [b = 10 in our normal paper arithmetics, b = 2 for computer implementations] and n = number of bits in modulus m
the numbers m(n digits long), T (2n digits long), R, b, n
Algorithm:
| |||