[19236] in cryptography@c2.net mail archive
Re: another feature RNGs could provide
daemon@ATHENA.MIT.EDU (Jason Holt)
Tue Dec 13 10:08:19 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Tue, 13 Dec 2005 08:01:35 +0000 (UTC)
From: Jason Holt <jason@lunkwill.org>
To: "Travis H." <solinym@gmail.com>
Cc: cryptography@metzdowd.com
In-Reply-To: <d4f1333a0512112220o7bde3de8v9163eeb71a746984@mail.gmail.com>
On Mon, 12 Dec 2005, Travis H. wrote:
> One thing I haven't seen from a PRNG or HWRNG library or device is an
> unpredictable sequence which does not repeat; in other words, a
> [cryptographically strong?] permutation. This could be useful in all
Rich Schroeppel tells me his "Hasty Pudding" cipher can be used to create PRPs
(pseudorandom permutations) of arbitrary size. It even has the ability to let
you define external functions to help define set membership (for sets which
aren't just composed of the natural numbers).
http://scholar.google.com/scholar?q=schroeppel+hasty&ie=UTF-8&oe=UTF-8&hl=en&btnG=Search
-J
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
