On Thu, 15 Aug 2002, Adam L. Beberg wrote:
Thus we are what Alton Brown tells us we are.

from localhost (localhost [127.0.0.1])
	by phobos.labs.netnoteinc.com (Postfix) with ESMTP id C03BB43C60
	for <jm@localhost>; Fri, 16 Aug 2002 06:18:09 -0400 (EDT)
from phobos [127.0.0.1]
	by localhost with IMAP (fetchmail-5.9.0)
	for jm@localhost (single-drop); Fri, 16 Aug 2002 11:18:09 +0100 (IST)
from xent.com ([64.161.22.236]) by dogma.slashnull.org
    (8.11.6/8.11.6) with ESMTP id g7GAHBa12609 for <jm@jmason.org>;
    Fri, 16 Aug 2002 11:17:11 +0100
from lair.xent.com (localhost [127.0.0.1]) by xent.com (Postfix)
    with ESMTP id A799E29409A; Fri, 16 Aug 2002 03:15:07 -0700 (PDT)
from venus.phpwebhosting.com (venus.phpwebhosting.com
    [64.29.16.27]) by xent.com (Postfix) with SMTP id 968ED294098 for
    <fork@xent.com>; Fri, 16 Aug 2002 03:14:18 -0700 (PDT)
from unknown (HELO hydrogen.leitl.org) (62.226.149.118) by
    venus.phpwebhosting.com with SMTP; 16 Aug 2002 10:15:37 -0000
from localhost (eugen@localhost) by hydrogen.leitl.org
    (8.11.6/8.11.6) with ESMTP id g7GAFYb30560 for <fork@xent.com>;
    Fri, 16 Aug 2002 12:15:35 +0200
employment market for applied cryptographers? (fwd)
From fork-admin@xent.com  Fri Aug 16 11:48:38 2002

from localhost (localhost [127.0.0.1])
	by phobos.labs.netnoteinc.com (Postfix) with ESMTP id 0453D441A1
	for <jm@localhost>; Mon, 19 Aug 2002 05:54:47 -0400 (EDT)
from phobos [127.0.0.1]
	by localhost with IMAP (fetchmail-5.9.0)
	for jm@localhost (single-drop); Mon, 19 Aug 2002 10:54:48 +0100 (IST)
from lair.xent.com (localhost [127.0.0.1]) by xent.com (Postfix)
    with ESMTP id 555CF2940B5; Fri, 16 Aug 2002 15:20:08 -0700 (PDT)
from relay.pair.com (relay1.pair.com [209.68.1.20]) by xent.com
    (Postfix) with SMTP id A4A45294098 for <fork@xent.com>; Fri,
    16 Aug 2002 15:19:32 -0700 (PDT)
Re: Elliptic Curve Point Counting, made easy
From fork-admin@xent.com  Mon Aug 19 11:03:26 2002

Robert Harley writes:
> Here are some numbers with the new algorithm for counting points on
> elliptic curves (over fields of characteristic 2).
>
> In 1998, Reynald Lercier set a record at 1663 bits in 330 days of CPU
> on 266 MHz Alphas.  In 1999, Frederik Vercauteren set a record at 1999
> bits in 65 days of CPU on 400 MHz PCs.
>
> I've been working on the problem since then.  These were measured just
> now on Rajit's 750 MHz Alpha:
>
>   1009 bits:
>     Lift:  4.8 s + 0.64 s precomputation.
>     Norm:  2.6 s + 0.31 s precomputation.
>
>   1663 bits:
>     Lift: 18.5 s + 2.1 s precomputation.
>     Norm:  7.0 s + 1.9 s precomputation.
>
>   1999 bits:
>     Lift: 29.4 s + 3.6 s precomputation.
>     Norm: 16.6 s + 3.4 s precomputation.
>
>   15013 bits:
>     Lift: 1 h 39 m + 13 m precomputation
>     Norm: 39 m + 1 h 41 m precomputation
Not knowing one whit about elliptic curve math, can you provide
some expert interpretation of these results?
It looks like the old record for, say, 199 bits, has been
blown out of the water by a factor of ~100,000.
Does this mean that Eliptic Curve encryption is
now easily breakable? Or faster than before with
no loss in strength? Or stronger?
Raw bits are OK, cooked bits are better.
- Gordon
http://xent.com/mailman/listinfo/fork