Mike Rosing (eresrch@msn.fullfeed.com)
Sat, 11 Jul 1998 21:38:44 -0500 (CDT)
On Fri, 10 Jul 1998 staym@accessdata.com wrote:
> Sorry, typo: I meant info on the thing. I checked Next's site and they
> don't mention it anywhere. Searching for "Richard Crandall" and "Fast
> Elliptic Encryption" turns up several websites on Mersenne primes, but
> nothing on the algorithm.
>
> >>Mike Stay wrote:
> >>Anyone know where to get Richard Crandall's Fast Elliptic Encryption?
> >
I got the info from the IBM patent web site. It's patent number 5,159,632
dated Sep. 17, 1991. The basic idea is Diffie-Hellman over GF(p^n) with p
being a Mersenne or Fermat prime so the calculations are faster. Note
that the patent uses a different form for the curve than is given by the
summing and doubling formulas. Technically, since that section is not in
the "claims" it doesn't matter. But I suspect a good lawyer could
demolish the whole thing if they look hard enough
Personally I'd clasify it as "obsolete" technology, but that's just my
opinion.
Patience, persistence, truth,
Dr. mike
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:20:17 ADT