[129655] in cryptography@c2.net mail archive
Randomness testing Was: On the "randomness" of DNS
daemon@ATHENA.MIT.EDU (Alexander Klimov)
Mon Aug 4 17:18:40 2008
Date: Sun, 3 Aug 2008 14:54:54 +0300 (IDT)
From: Alexander Klimov <alserkli@inbox.ru>
To: cryptography@metzdowd.com
In-Reply-To: <6cb897b30807301622t6881b97n1848b5fd7efef53b@mail.gmail.com>
On Thu, 31 Jul 2008, Pierre-Evariste Dagand wrote:
> Just by curiosity, I ran the Diehard tests[...]
>
> Sum-up for /dev/random:
> "Abnormally" high value: 0.993189 [1]
> "Abnormally" low value: 0.010507 [1]
> Total: 2
>
> Sum up for Sha1(n):
> "Abnormally" high values: 0.938376, 0.927501 [2]
> "Abnormally" low values: 0.087107, 0.091750, 0.060212, 0.050921 [4]
> Total: 6
>
> So, I would say that Sha1(n) does not pass DieHard (while
> /dev/random does). But this would require further examination, in
> particular to understand why some tests failed. And, in fact, I have
> no clue why they failed...
See <http://en.wikipedia.org/wiki/P-value>.
Since p-value is supposed to be uniform on the interval [0,1]
for a truly random source, it is no wonder that with so many
p-values some of them are close to 0 and some are close to 1.
If your p-value is smaller than the significance level (say, 1%)
you should repeat the test with different data and see if the
test persistently fails or it was just a fluke.
--
Regards,
ASK
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
