Anonymous user
Montgomery reduction: Difference between revisions
no edit summary
m (Format list.) |
No edit summary |
||
Line 5:
* 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 are known entities, a number m' (represented m_dash in code) = -m^-1 mod b is precomputed
Wikipedia link for Montgomery Reduction
[http://en.wikipedia.org/wiki/Montgomery_reduction]
See Handbook of Applied Cryptography for brief introduction to theory and numerical example in radix 10
Algorithm:
| |||