Mike Rosing (eresrch@msn.fullfeed.com)
Thu, 30 Jul 1998 22:38:19 -0500 (CDT)
On Thu, 30 Jul 1998, Paulo Barreto wrote:
> Understanding the ECC counterparts of conventional DL algorithms is indeed
> not harder than understanding the conventional ones. I guess the
> perplexity people often shows regarding EC is caused by the (surprising)
> fact that elliptic curves do present their properties. The truly difficult
> part is perhaps the point counting algorithms (the underlying theory is
> really, really heavy).
Yeah, but I bet it all boils down to shifts, ands, and xors. I have yet
to read Lercier and Morain's papers enough times to understand them, but
I intend to understand them eventually :-)
Patience, persistence, truth,
Dr. mike
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:21:03 ADT