Re: Secure permutations on non-power-of-2 ranges?
From: Bodo Moeller (bmoeller_at_acm.org)
Date: 08/26/05
- Next message: bigzaphod_at_gmail.com: "Question about hashing algorithms"
- Previous message: tomstdenis_at_gmail.com: "Re: Nocona [Intel 64-bit cpu timing]"
- In reply to: David Wagner: "Re: Secure permutations on non-power-of-2 ranges?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Fri, 26 Aug 2005 19:23:06 +0000 (UTC)
David Wagner <daw@taverner.cs.berkeley.edu>:
>> Indeed, but we'd rather store a sequence number and a postion in the
>> series than about 235MB of shuffled numbers.
> That's surprising. 235MB of data is what, a few tens of cents worth of
> hard disk space these days?
Maybe, but that's only as long as one doesn't think one needs a
back-up concept. If they want to keep back-ups of their data, they
have to factor in additional media cost as well as the time required
for reading and writing the data when back-ups are made. 235 MB still
isn't an awful lot, but the total cost of having a 235 MB file is
more than that of the mere hard disk space.
- Next message: bigzaphod_at_gmail.com: "Question about hashing algorithms"
- Previous message: tomstdenis_at_gmail.com: "Re: Nocona [Intel 64-bit cpu timing]"
- In reply to: David Wagner: "Re: Secure permutations on non-power-of-2 ranges?"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]