Ulf M�ller wrote:
>
> > > BN_mod_mult_montgomery() first does a full multiplication, then a
> > > Montgomery reduction. Would the speedup for RSA etc be significant
> > > if we changed that?
> >
> > I think you are misinterpreting the code!
>
> Hm, I haven't read the paper cited in the source, but if you have a
> look at Algorithm 14.36 in the Handbook of Applied Cryptography,
> that combined algorithm should be faster than multiplying everything
> first and reducing later. And that clearly is what OpenSSL does
> (I don't think I'm misinterpreting that):
Ah, OK, I misunderstood what you were saying!
I guess the only way to find out is to try it.
Cheers,
Ben.
--
SECURE HOSTING AT THE BUNKER! http://www.thebunker.net/hosting.htm
http://www.apache-ssl.org/ben.html
Y19100 no-prize winner!
http://www.ntk.net/index.cgi?back=2000/now0121.txt
______________________________________________________________________
OpenSSL Project http://www.openssl.org
Development Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
