in reply to Upper limit to Mersenne Twister Algorithm?

hi,

as people above mentioned you have to know for what you need the generator for. my personal opinion is as far as the software type random number generator goes, all of them are a joke if meant to be used for some real cryptography. rand() function in perl is inhereted from libc that has a RAND_MAX from 2**15 - 2**31 which is also interesting because since perl doesn't handle big integers very well by default, you need to use bigint.

also i read somewhere that the authors of rand() function guarantee that the number you get is a random but they don't guarantee that more of them are random - which implies that there is a pattern within the whole system.

to me regular MT with a period of 2**k-1 , k = 19937, is more than enough for my simulations. but i can't say if it will satisfy your requests. my former coworker had this problem with MT and some other algorithms (the period wasn't enough for him), so he turned to QRBG. now, this is a machine based generator that is nothing like software generators and it guaranties the randomness of one number or more of them. so my advice is : start worrying when the problem emerges, until then use rand() build-in function.

cheers

  • Comment on Re: Upper limit to Mersenne Twister Algorithm?