11 reputation
2
bio website edutoolbox.de
location
age
visits member for 1 year, 1 month
seen yesterday

entrepreneur, software developer (python, javascript, go, cpp), veterinary doctor, ngo/pol activist


1d
comment Advantages of combined PRNGs
Your first comment cited 'a large byte stream that has near equal frequencies for each byte is NOT what random behaves like'. Now you are talking about distribution assessment in small streams (i.e. from hash algorithms). Anyway, PRNGs should deliver equally distributed bits/bytes assessable on the long run. And even (cryptographic save) hash one way functions do so if using them to produce larger sequences as can be shown by analyzing iterative produced bitstreams (hash(hash(hash(..))).
2d
answered How do you test randomness?
2d
comment Advantages of combined PRNGs
@RichieFrame Reading bits to bytes from a (PRNG) random bitstream produces random bytes that are (near) equally distributed (see also: NIST statistic package csrc.nist.gov/groups/ST/toolkit/rng/documentation_software.html).
2d
answered Advantages of combined PRNGs
Sep
24
awarded  Autobiographer
Sep
14
comment Why does openssl BN_generate_prime return only a fraction of the safe primes within the given bit range?
@DW: i had a slightly different hypothesis (from dreaming tonight ;-): maybe openSSL does prime-generaton within 2^31<p<0.5*2^32 and then tests 2p+1 for primality. That would fit the resulted safe prime range and it would be consistent with your explanation of the coupon collectors problem (thanks for this in particular). And yes, there is a somehow strange distribution of the frequency of being chosen (chosen safe prime histogram remembers a 1/x graph). (By the way: i looked into openssl source but nearly lost my confidence)
Sep
14
awarded  Student
Sep
13
asked Why does openssl BN_generate_prime return only a fraction of the safe primes within the given bit range?