improved Montgomery multiplication

[Geoff Thorpe]

On June 20, 2003 09:48 am, Paul Zimmermann wrote:
> did somebody out there implement Phil McLaughlin's new frameworks
> for Montgomery multiplication in gmp? It just appeared in Math of Comp
> <http://www.ams.org/journal-getitem?pii=S0025-5718-03-01543-6>.

Damn, pay-per-view research... <grumble>

Does anyone know if there exist any alternative explanations of these 
algorithm(s) that I can get to without subscribing up to the AMS? I'd be 
interested in looking at this from a couple of angles; GMP, OpenSSL, and 
the GMP plug-in *in* OpenSSL.

Cheers,
Geoff

-- 
Geoff Thorpe
geoff@geoffthorpe.net
http://www.geoffthorpe.net/