Anonymous user
Talk:Montgomery reduction: Difference between revisions
no edit summary
(→Example numbers?: yes, yes.) |
No edit summary |
||
Line 37:
: (Go has a 1.0 release coming up soon. I've been coding for that and will begin using the works with template when Go 1 is out.) —[[User:Sonia|Sonia]] 17:54, 24 December 2011 (UTC)
:: Thank you for adding implementation and numerical example in another language. A solution for small numbers such as m=97 and R=100 while finding just the Montgomery Reduction of one number would probably only show that that given source code has correctly implemented the algorithm. The practical advantage of Montgomery reduction is that if there are a lot of multiplications to be done, it is more efficient to perform them on numbers that been reduced, and the final results can then be reconverted back to normal numbers (we do not need to actually divide by the modulus). And by the way how did you do numericals involving such large numbers? I don't know much about Go, is it possible to do such large number operations in Go as basic data types? Do you have any idea of doing this for large numbers in C or C++?--[[User:Mahaju|Mahaju]] 11:47, 25 December 2011 (UTC)
| |||