This is the mail archive of the
mailing list for the glibc project.
Re: hardware accelerated random()
- From: Yann Droneaud <yann at droneaud dot fr>
- To: OndÅej BÃlka <neleai at seznam dot cz>
- Cc: libc-help at sourceware dot org
- Date: Sun, 09 Dec 2012 22:19:44 +0100
- Subject: Re: hardware accelerated random()
- References: <20121209204101.GA22284@domone>
Le dimanche 09 dÃcembre 2012 Ã 21:41 +0100, OndÅej BÃlka a Ãcrit :
> I wrote random generator that uses aes-ni. I generate random numbers in
> groups of 16 and then use them.
> On my i5 test program spend about 6.4 cycles per call.
> I put sample implementation on
> I am not cryptographer so I do not know if this ways causes significant
> statistical weakness.
Without going to the crypto strength PRNG, which are not required for
libc, do you have so demonstration of the quality of this random
Check those pages for some tools to validate a PRNG:
PS: you may find some background information in the following article
"LCE: Don't play dice with random numbers" by Michael Kerrisk, based on
a talk by H. Peter Anvin https://lwn.net/Articles/525459/