[19215] in cryptography@c2.net mail archive
Re: another feature RNGs could provide
daemon@ATHENA.MIT.EDU (Jack Lloyd)
Mon Dec 12 11:55:23 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Mon, 12 Dec 2005 10:54:23 -0500
From: Jack Lloyd <lloyd@randombit.net>
To: cryptography@metzdowd.com
Mail-Followup-To: cryptography@metzdowd.com
In-Reply-To: <d4f1333a0512112220o7bde3de8v9163eeb71a746984@mail.gmail.com>
On Mon, Dec 12, 2005 at 12:20:26AM -0600, Travis H. wrote:
> 2) While CTR mode with a random key is sufficient for creating a
> permutation of N-bit blocks for a fixed N, is there a general-purpose
> way to create a N-bit permutation, where N is a variable? How about
> picking a cryptographically strong permutation on N elements, where N
> is not necessarily a power of 2?
Use can use the Bear or Lion constructions to form 2^{arbitrary} bit block
ciphers quite easily.
-Jack
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
