The criteria for calling a RNG "cryptographically secure" are incompatible with the game design goals here.
replyThe game needs a RNG that's stable when seeded, for reproducible runs. I look for the same kind of qualities when doing generative art.
In comparison, a CSPRNG should be safe from oracle attacks, which is essentially the opposite goal.
CSPRNGs are absolutely seedable deterministic functions that will result in entirety reprodible runs.
replyThe only difference is that if you don't know the seed it is computationally difficult to predict the next value given the previous ones. But that's not something any game dev is ever going to want to do (or waste time trying to do)
Can you describe what you mean by "oracle attack" here? CSPRNG APIs (at least the ones I've used) usually expose ways to set a specific seed and serialize the RNG state. In fact, arguably the simplest possible CSPRNG, where you just run a (suitably strong) block cipher in counter mode, would seem to meet the requirements for game dev in a straightforward manner.
replyI would expect all RNG algorithms to be deterministic and stable with their seed,
but the cryptographically secure ones to have some additional properties like making it unfeasible to reverse the seed from the output, having a very long period or strong guarantees on the distribution of the output.
It's just that using a 'secure' algorithm is often overkill for a game when you don't really need those extra guarantees.
reply