Re: [Cfrg] Suggestion for open competition on PAKE -> Was Re: Dragonfly has advantages

On Sat, Jan 4, 2014 at 4:47 PM, David Jacobson <dmjacobson@sbcglobal.net> wrote:
> On 1/4/14 9:18 AM, Trevor Perrin wrote:
>>
>> Another important issue, particularly for EC protocols, is to distinguish
>> operations with a fixed base (or fixed point) from operations with a random
>> base / point. The fixed operations can be optimized to be several times
>> faster (perhaps ~4x is a rule of thumb I've heard).
>
> This seems strange to me, and I've implemented ECC several times over the
> last decade.   I think you might have meant that implementations using
> special modulii that can be written as  the sum of  +/- 1 at selected word
> boundaries or as 2^n - k for some small k are several times faster than
> implementations written to support arbitrary moduli.

This isn't that strange: you simply use a larger, precomputed table
for a higher-radix or sliding window method.
>
>     --David
>
>
>
> _______________________________________________
> Cfrg mailing list
> Cfrg@irtf.org
> http://www.irtf.org/mailman/listinfo/cfrg


-- 
"Those who would give up Essential Liberty to purchase a little
Temporary Safety deserve neither  Liberty nor Safety."
-- Benjamin Franklin