[16824] in cryptography@c2.net mail archive
Re: Is 3DES Broken?
daemon@ATHENA.MIT.EDU (Jack Lloyd)
Sun Feb 6 09:49:22 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Sun, 6 Feb 2005 01:08:34 -0700
From: Jack Lloyd <lloyd@randombit.net>
To: Cryptography <cryptography@metzdowd.com>
Cc: Ian G <iang@systemics.com>
Mail-Followup-To: Cryptography <cryptography@metzdowd.com>,
Ian G <iang@systemics.com>
In-Reply-To: <4203D11F.70202@systemics.com>
On Fri, Feb 04, 2005 at 07:46:39PM +0000, Ian G wrote:
> It seems that the block size of an algorithm then
> is a severe limiting factor. Is there anyway to
> expand the effective block size of an (old 8byte)
> algorithm, in a manner akin to the TDES trick,
> and get an updated 16byte composite that neuters
> the birthday trick?
>
> Hypothetically, by say having 2 keys and running
> 2 machines in parallel to generate a 2x blocksize.
[...]
That would make for a pretty poor cipher, considering that flipping a plaintext
bit would only change one half of the ciphertext block (assuming I'm not
misinterpreting your suggestion).
Something along the lines of DEAL should suffice for this, using the block
ciphers as round functions in a Feistel cipher. A bit slow, but it seems like a
plausible solution.
-Jack
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
