Re: linear congruential pseudorandom number generator question
From: David Wagner (daw_at_taverner.cs.berkeley.edu)
Date: 04/30/05
- Next message: pschax_at_gmail.com: "Re: leading digits of an LCG"
- Previous message: David Wagner: "Re: leading digits of an LCG"
- In reply to: Korejwa: "linear congruential pseudorandom number generator question"
- Next in thread: Korejwa: "Re: linear congruential pseudorandom number generator question"
- Reply: Korejwa: "Re: linear congruential pseudorandom number generator question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Sat, 30 Apr 2005 05:53:27 +0000 (UTC)
Korejwa wrote:
>If I have a sequence of numbers that I know were generated by a linear
>congruential pseudorandom number generator, how can I calculate the
>internal state of the generator?
>The pseudorandom number generator performs this function:
>
>Y = (A * X + C) MOD N
>return a value which reduces X to the range of a specified Min-Max value.
>
>A, C, and N are known constants. X is modified each time the function is
>called.
Given Y, it is trivial to learn X, since X = A^{-1} * (Y - C) mod N,
and inverses can be computed using the extended Euclidean algorithm.
- Next message: pschax_at_gmail.com: "Re: leading digits of an LCG"
- Previous message: David Wagner: "Re: leading digits of an LCG"
- In reply to: Korejwa: "linear congruential pseudorandom number generator question"
- Next in thread: Korejwa: "Re: linear congruential pseudorandom number generator question"
- Reply: Korejwa: "Re: linear congruential pseudorandom number generator question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|