At 10:01 PM 5/14/01 -0700, Jonathan Wienke wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
One of the features of PGP is that when you encrypt a message, you
can specify any number of recipients (unique public keys) who can
read the message. The message is encrypted with a random session
On Tue, 15 May 2001, Ben Laurie wrote:
Ray Dillinger wrote:
Okay. Here is one way to do it. Encrypt the message using a symmetric
algorithm such as Twofish or AES or something. Now create a header that
snip
You just described PGP.
Yeah, I did. I've been looking at it. :-)
Note to
On Mon, May 14, 2001 at 06:13:20PM -0700, Ray Dillinger wrote:
This works, if it doesn't really matter that the users have separate
keys -- ie, if it won't cause a hash collision or something in some
other part of the system, or if you don't care that the users can
identify each other by
On Mon, 14 May 2001, Rafael Coninck Teigao wrote:
Hi, cypherpunks.
I'm looking for an algorithm similar to the LaGrange Interpolation
Scheme, by Adi-Shamir, for a Shared-Secret implementation, but I want to
be able to recover the secret using only one of the Keys, not a
combination,
At 02:28 PM 5/14/01 -0700, Robin Lee Powell wrote:
What the _hell_ is the point of a shared secret scheme where you can
reconstruct the secret with only one key??
Interesting question. There have been times when I've sent
email and not encrypted it to myself, and later wanted to
read it,
