-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
An implication of proposals like hashcash, MicroMint,
bit gold, etc. is that there is such a thing as intrapolynomial
cryptography. Three motivations for intrapolynomial
cryptography are (a) novel constructions such as MicroMint,
(b) more accurate e
[EMAIL PROTECTED] wrote:
>
> The authors have announced and fixed one bug...
Here's the details of that one:
http://www.securityfocus.com/templates/archive.pike?list=1&date=1999-08-1&[EMAIL PROTECTED]
-- Forwarded message --
Date: Sun, 01 Aug 1999 21:29:40 -0500
From: Irwan Am
At 7:43 AM -0700 on 8/24/99, NewsScan wrote:
> CLINTON ADMINISTRATION APPOINTS NEW E-COMMERCE ADVISOR
> The Clinton Administration has appointed Elizabeth Echols to a new White
> House post that will coordinate e-commerce issues. The Electronic Commerce
> Working Group, which will be headed up
> >The ecc discrete log problem is given points A and B, find integer x
> >such that xA=B if it exists. I assume that most crypto implementations
> >of ecc use finite fields; in a finite field can you assume that x
> >exists?
> x is just an integer in this case. Since there's no multiplication
x is just an integer in this case. Since there's no multiplication
operator (we hope) in the curves used for crypto, x is just an indicator of
how many times to square and multiply.
Now as to whether you always have an x such that xA=B exists, that depends
on the following:
Are A and B both poi
Hi Folks,
I would like to know if someone of you know the
existence of a version of Yarrow that doesn't use DLL ? Or maybe someone
of you that already modify it...
Thanks,
Best regards,
Hans...
