On Jun 12, 2015, at 9:35 AM, Michael Titke <michael.tied...@o2online.de> wrote:
> On 12/06/2015 13:21, Konrad Hinsen wrote: >> Seeding is provided for two use cases: 1) Reproducibility, ... 2) "Real" >> randomization, by setting the seed from some unpredictable source, such as >> the system time. In both cases, the idea is to set the seed once at the >> beginning of a program run. > With your idea in #2 I would reliably produce known sequences depending on > only 256 original states. >> The statistical properties of the pseudo-random sequence hold only for an >> unperturbed sequence, i.e. without changing the seed. If you set the seed >> every time you ask for a random number, your random sequence becomes simply >> some complicated function of your input seed, whose statistical properties >> are hard to predict and most probably not what you want. > If you want to look at the system and do a black box test then the result > would be: > true randomness / noise -> Racket's randomness implementation with one > initial state -> one of 256 known sequences If you want one of 65536 known sequences, you can get 2 bytes of initial randomness to start though, right? And if you want one of 16777216 known sequences, you can use 3 bytes, and so on? Increase the seed space? > true randomness / noise -> GNU-Guile's randomness implementation -> noise > > BTW the basic formula of cryptography is: Message |+| Randomness -> Randomness > Now replace Randomness with Racket and try to ... -- You received this message because you are subscribed to the Google Groups "Racket Users" group. To unsubscribe from this group and stop receiving emails from it, send an email to racket-users+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/d/optout.
