On Nov 16, 2003, at 12:24 PM, lrk wrote:
Stupid crypto, probably. Unless I'm missing something, this only
works
if A(A(M)) = M. Symetric crypto, not just symetric keys.
NEVER willingly give the cryptanalyst the same message encrypted with
the same system using two different keys.
For the simple
(this is a resend, apologies for duplicates)
As David Wagner points out, encryption with a public key (for which the
private key has been discarded) would seem to work.
I think there is a bit more to be said about requirements though.
For a one-way encryption algorithm to be injective will also
At 03:00 PM 11/16/03, peter gutmann wrote:
Bill Frantz [EMAIL PROTECTED] writes:
I usually travel with zipper closed duffel bags. I fasten the zipper
closed
with a screw link. Anyone can unscrew the link and get into the bag,
but it
does effectively keep the zipper closed in transit. I suppose
As David Wagner points out, encryption with a public key (for which the
private key has been discarded) would seem to work.
I think there is a bit more to be said about requirements though.
For a one-way encryption algorithm to be injective will also require that
the output (nee ciphertext) be
In message [EMAIL PROTECTED], Perry E.Metzger writes:
Hmm. You need a cipher such that given B(A(M)) and A you can get
B(M). I know of only one with that property -- XOR style stream
ciphers. Unfortunately that makes for a big flaw, so I'm not sure we
should throw out our Diffie-Hellman
martin f krafft wrote:
it came up lately in a discussion, and I couldn't put a name to it:
a means to use symmetric crypto without exchanging keys:
- Alice encrypts M with key A and sends it to Bob
- Bob encrypts A(M) with key B and sends it to Alice
- Alice decrypts B(A(M)) with key A,
This is what GUIDs/UUIDs were designed for, and they're used broadly.
They're standardized in ISO 11578 [1], although there's a very similar
public description in an expired Internet Draft [2]. Microsoft also
publishes a description of how they generate their GUIDs, but I can't find
it right
Amir and others,
First, I'd like to thank all who have taken time to reply, either on- or
off-list.
All suggestions so far are related to public-key algorithms; I had myself
thought about simply raising a generator g to the plaintext, or to a
suitable injective function of the plaintext, in a
