From the [EMAIL PROTECTED] mailing list:
Date:Tue, 17 Apr 2001 22:52:56 -0400
From:Reynald LERCIER [EMAIL PROTECTED]
Subject: Discrete logarithms in GF(p)
Tuesday, April 17 2001.
We are very pleased to announce a new record for the general discrete
logarithm problem. We were able to
On Fri, 25 May 2001, Matt Blaze wrote:
That's it. I vaguely recall paper about a year or two ago by, I think,
Bart Preenel, that expanded on a similar idea. I don't think it cited
our MKCS tech report, so I presume he wasn't aware of it and took a slightly
different direction.
That is
On Fri, 25 May 2001, Enzo Michelangeli wrote:
On the Other Other Hand, I vaguely remember a neat paper by Matt Blaze
some years ago that shows that certain classes of back doors, like
good back doors in conventional crypto systems, are equivalent in
difficulty to building a public key
On Fri, 22 Jun 2001, Jeffrey I. Schiller wrote:
However, having said all this, Don has a point. There may be a class
of message where you want to prove that you originated it *only to the
original sender*. If he has a way to do that, it sounds like a good
thing.
One way to do this is
On Thu, 21 Mar 2002, McMeikan, Andrew wrote:
A question and a probe.
Question. Is it possible to have code that contains a private encryption
key safely? Every way I look at it the answer seems no, yet some degree of
safety might be possible by splitting an encrypting routine across
