On Mon, 1 Apr 2002, Nick Johnson wrote: > - You can decrypt in a 'nested' fashion - eg, if E(M,x) means encrypting M > with key x and D(M,x) means decrypt M with key x, then the algorithm should > satisfy D(E(E(M,a),b),a) == E(M,b)
Yes if a = b :-) Just kidding. Perhaps you should look at Shamir's no-key protocol. This does exactly what you want. Try looking at page 500 in Handbook of Applied Cryptography (http://www.cacr.math.uwaterloo.ca/hac/) (you should really read chapter 12 of this book if you're interessed in Key Establishment Protocols). This protocol is similar to Diffie-Hellman but exchanges 3 messages. That's why Diffie-Hellman is preferred. Dries -- Dries Schellekens email: [EMAIL PROTECTED] _______________________________________________ freenet-tech mailing list [EMAIL PROTECTED] http://lists.freenetproject.org/mailman/listinfo/tech
