Re: Generating a large sequence of unique, random numbers
From: Jean-Luc Cooke (jlcooke_at_lager.engsoc.carleton.ca)
Date: 05/28/03
- Next message: Tom St Denis: "Re: question about 4.2 Multiplication in AES document(FIPS 197)"
- Previous message: Nigel Wetters: "Re: List comparisons with minimum disclosure"
- In reply to: Benjamin Goldberg: "Re: Generating a large sequence of unique, random numbers"
- Next in thread: Jean-Luc Cooke: "Re: Generating a large sequence of unique, random numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: 28 May 2003 13:41:43 GMT
Benjamin Goldberg <ben.goldberg@hotpop.com> wrote:
> Here's another method: Mail the author of the Hasty Pudding Cipher, and
> ask him for the source of his algorithm. Use that to encrypt the
> counter directly.
:) Those Harvard cryptographers are a riot arn't they? "Operates on 64bit words or bits, or half bits"
JLC
- Next message: Tom St Denis: "Re: question about 4.2 Multiplication in AES document(FIPS 197)"
- Previous message: Nigel Wetters: "Re: List comparisons with minimum disclosure"
- In reply to: Benjamin Goldberg: "Re: Generating a large sequence of unique, random numbers"
- Next in thread: Jean-Luc Cooke: "Re: Generating a large sequence of unique, random numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|