On Fri, Aug 17, 2018 at 1:09 PM Sokolov Yura wrote:
> I'd recently made "practically secure rng":
https://github.com/funny-falcon/go-rando
>
> It uses SipHash permutation core (so it has 256 bit permuation stsate +
counters), but also constantly reseeded from 1024 bit "entropy pool" that
is frequ
I'd recently made "practically secure rng":
https://github.com/funny-falcon/go-rando
It uses SipHash permutation core (so it has 256 bit permuation stsate +
counters), but also constantly reseeded from 1024 bit "entropy pool" that is
frequently refsreshed from crypto/rand.
--
You received thi
On Thursday, August 16, 2018 at 12:51:19 AM UTC-4, Rob 'Commander' Pike
wrote:
>
> The math/rand package has 38848 bits of state. The seed value is only 64
> bits, yes, but that's a separate question. Is seeding what you are
> concerned with?
>
Oh, that is good news. I didn't see that in the
The math/rand package has 38848 bits of state. The seed value is only 64
bits, yes, but that's a separate question. Is seeding what you are
concerned with?
-rob
On Thu, Aug 16, 2018 at 1:19 PM, Pat Farrell wrote:
> I want to build a poker simulator. For this, I need a nice method to
> shuffle
I want to build a poker simulator. For this, I need a nice method to
shuffle cards. A bit of googling shows that a good basic approach is the
Fisher-Yates shuffle. Its O(n) and space efficient. But it depends on the
quality of the PRNG. I am specifically concerned that the math/rand is only
64
