[14814] in cryptography@c2.net mail archive
Re: Are there...one-way encryption algorithms
daemon@ATHENA.MIT.EDU (Peter Fairbrother)
Wed Nov 26 17:31:57 2003
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 26 Nov 2003 20:47:01 +0000
From: Peter Fairbrother <zenadsl6186@zen.co.uk>
To: Bodo Moeller <moeller@cdc.informatik.tu-darmstadt.de>,
Anton Stiglic <astiglic@okiok.com>
Cc: David Wagner <daw-usenet@taverner.cs.berkeley.edu>,
<cryptography@metzdowd.com>
In-Reply-To: <20031120144211.GB25570@tau.CS.Berkeley.EDU>
Bodo Moeller wrote:
> The Pohlig-Hellman cipher is the modular scheme that you describe, but
> observe there is a connection to the protocol above: that protocol
> works only if encryption and decryption has a certain commutativity
> property (decrypting B(A(M)) with key A must leave B(M), not
> just some A^-1(B(A(M))) that might look entirely different), and
> the Pohlig-Hellman cipher has this property.
A useful property for all sorts of things. I'm using P-H to improve Golle et
al's universal encryption methods,
http://www.zenadsl6186.zen.co.uk/ICURpaper3.pdf but it's a pity that
Pohlig-Hellman is still slow, and that there isn't a faster algorithm with
similar properties.
There's lots of potential uses for one of those :)
--
Peter Fairbrother
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
