vm-PRNG

PRNG算法

1 2 3 4 5 6

Xn+1 = (aXn + c) mod m where X is the sequence of pseudo-random values m, 0 < m - modulus a, 0 < a < m - multiplier c, 0 ≤ c < m - increment x0, 0 ≤ x0 < m - the seed or start value

参考

---

• ← Previous Post
• Next Post →