]> asedeno.scripts.mit.edu Git - PuTTY.git/commit
projects / PuTTY.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d9c3353) | patch
Implement the Montgomery technique for speeding up modular
authorSimon Tatham <anakin@pobox.com>
Fri, 18 Feb 2011 08:25:38 +0000 (08:25 +0000)
committerSimon Tatham <anakin@pobox.com>
Fri, 18 Feb 2011 08:25:38 +0000 (08:25 +0000)
commit61875b87e38604ab15ea27332ae19bd82abf35f2
tree7e45015a4aa9d41075c428b00e592a97c75d7779tree | snapshot
parentd9c3353176215ae4d2f0e470e439bca24c52e947commit | diff
Implement the Montgomery technique for speeding up modular
exponentiation by replacing the modulo operation by a cleverly chosen
multiplication. This was not worth doing in the previous state of the
code (because my multiply was about as slow as my modulo), but now
that multiplication has been sped up by the Karatsuba optimisation,
Montgomery becomes worthwhile.

[originally from svn r9094]
sshbn.c diff | blob | history
local copy of git://git.tartarus.org/simon/putty.git