Re: LibTomMath forked [SSE2 addons]
From: Tom St Denis (tom_at_securescience.net)
Date: 06/30/04
- Next message: Bryan Olson: "Re: Manual hashing"
- Previous message: Bessel: "2 rings with a special property"
- In reply to: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Next in thread: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Reply: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 30 Jun 2004 03:19:12 GMT
Updated the patches a bit more...
http://math.libtomcrypt.org/files/patch-0.30/ltmsse_patches3.zip
On my P4 2.8C I managed 1170 512-bit exptmods per second [roughly 2.4M
cycles each, down from 2.5M cycles in the previous patch set]. Roughly
speaking this is around 2.4x faster than OpenSSL.
The zip file has the patches [you can apply against LTM 0.30] as well as a
"mpi.c" file you can drop into LibTomCrypt [or use on it's own I
guess ;-)]. As per the previous you have to define LTMSSE to get the SSE2
optimizations.
As I understand it the AMD K8 processor has SSE2 as well. I was wondering
if anyone with access to one could apply the patches and run the timing
demo? [e.g. make timing ; ./ltmtest] and gimme the exptmod outputs. Would
be interesting to get the cycle count for a 512-bit exptmod so I can
compare them ;-)
Tom
- Next message: Bryan Olson: "Re: Manual hashing"
- Previous message: Bessel: "2 rings with a special property"
- In reply to: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Next in thread: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Reply: Tom St Denis: "Re: LibTomMath forked [SSE2 addons]"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|