Martin Geisler wrote:
[EMAIL PROTECTED] writes:
<snip comparison return value disagreement>
<snip '05 variation>
This does the same and avoids the conversion to GF(256), but may be
more expensive online (IIRC GF(256) computation is /really/ fast).
Well, that is easy to check. The timeit module says:
<snip timing data>
Like you, I had expected GF256 to be significantly faster.
I don't like the fixed input data in the timings.
The Zp elements chosen may be good or bad candidates, and computation on
random elements may be worse...
Regarding GF(256) this should not be a problem, as IIRC the
multiplication is a table lookup. However, you may avoid cache-misses
entirely, so those numbers should also be taken with a small grain of salt.
<snip old constant rounds solution>
The best one published that I know of is Tord's and mine from
ICITS07. This is reasonable to implement (complexity-wise), but
trust me, you don't want to :-)
Hmm... Rune says that I should consider this a challange... :-)
I wont really have time before I return from Switzerland in September
(I leave in a week), but can I find the article online? I found the
conference webpage, but it does not link to your article, and neither
does your own publication list.
My publication list is my fault. But the paper will be available in the
conference proceedings; to appear in LNCS I believe. I can dig out a
copy and mail it to you if you like.
Regards,
Tomas
_______________________________________________
viff-devel mailing list (http://viff.dk/)
[email protected]
http://lists.viff.dk/listinfo.cgi/viff-devel-viff.dk
