Montgomery reduction: Difference between revisions
Content deleted Content added
m fix link |
m link |
||
| Line 5: | Line 5: | ||
* 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<sup>-1</sup> mod b is precomputed. |
* 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<sup>-1</sup> mod b is precomputed. |
||
Wikipedia link: [[ |
Wikipedia link: [[wp:Montgomery reduction|Montgomery reduction]]. |
||
See Handbook of Applied Cryptography for brief introduction to theory and numerical example in radix 10. |
See Handbook of Applied Cryptography for brief introduction to theory and numerical example in radix 10. |
||