Re: ECC template library

> That said there are fast ways of doing GF(2) mults despite the lack of
> a good multiplier. Even with these "awkward" multipliers you can get
> binary ECC faster than prime ECC and RSA.

Beating RSA I can understand, but I'd like to see an example of GF(2)
code that can beat an optimized GF(p) implementation with hardware
multiplies and divides. There's probably a neat trick I'm not aware of
for multiplication in GF(2), unless you can use SSE or equivalent to
massively speed it up.

   Ben
Received on Mon May 1 02:01:41 2006