[14793] in cryptography@c2.net mail archive
Re: Are there...one-way encryption algorithms
daemon@ATHENA.MIT.EDU (David Wagner)
Fri Nov 21 14:05:57 2003
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
To: cryptography@metzdowd.com
From: daw@taverner.cs.berkeley.edu (David Wagner)
Date: Thu, 20 Nov 2003 23:30:53 +0000 (UTC)
Reply-To: daw-usenet@taverner.cs.berkeley.edu (David Wagner)
X-Complaints-To: usenet@abraham.cs.berkeley.edu
Anton Stiglic wrote:
>"David Wagner" <daw@taverner.cs.berkeley.edu> wrote:
>> martin f krafft wrote:
>> > - Bob encrypts A(M) with key B and sends it to Alice
>> > - Alice decrypts B(A(M)) with key A, leaving B(M), sends it to Bob
>> > - Bob decrypts B(M) with key B leaving him with M.
>> >
>> >Are there algorithms for this already? What's the scheme called?
>>
>> It's called Pollig-Hellman.
>
>If I'm not mistaken you are wrong.
You're right. The above protocol is essentially Shamir's 3-pass
protocol, not Pohlig-Hellman.
Pohlig-Hellman is the encryption scheme A(M) = M^A mod p. If you
instantiate Krafft's proposal with the Pohlig-Hellman encryption scheme,
you get a working (and secure) instance of Shamir's 3-pass protocol.
Thank you for correcting my error!
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
