3 * $Id: fipstest.c,v 1.4 2004/04/08 01:36:15 mdw Exp $
5 * FIPS140 randomness tests
7 * (c) 2000 Straylight/Edgeware
10 /*----- Licensing notice --------------------------------------------------*
12 * This file is part of Catacomb.
14 * Catacomb is free software; you can redistribute it and/or modify
15 * it under the terms of the GNU Library General Public License as
16 * published by the Free Software Foundation; either version 2 of the
17 * License, or (at your option) any later version.
19 * Catacomb is distributed in the hope that it will be useful,
20 * but WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
22 * GNU Library General Public License for more details.
24 * You should have received a copy of the GNU Library General Public
25 * License along with Catacomb; if not, write to the Free
26 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
30 /*----- Header files ------------------------------------------------------*/
32 #include <mLib/bits.h>
36 /*----- Main code ---------------------------------------------------------*/
38 /* --- @monobit@ --- *
40 * Arguments: @const octet *p@ = pointer to buffer
42 * Returns: Zero if OK, @FIPSTEST_MONOBIT@ on failure.
44 * Use: Performs the monobit test on a buffer of data. If %$n_1$% is
45 * the number of 1 bits in the buffer, then the monobit test is
46 * passed when %$9654 < n_1 < 10346$%.
49 static unsigned monobit(const octet
*p
)
54 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
56 for (j
= 0; j
< 8; j
++) {
63 if (9725 >= n1
|| n1
>= 10275)
64 return (FIPSTEST_MONOBIT
);
70 * Arguments: @const octet *p@ = pointer to buffer
72 * Returns: Zero if OK, @FIPSTEST_POKER@ on failure.
74 * Use: Performs the poker test on a buffer of data. The buffer is
75 * divided into 4-bit nibbles %$x_i$%. If
76 * %$f(x) = \sum_{x_i = x} 1$% is the frequency of each nibble,
77 * then the test is passed if
78 * %$2.16 < 16/5000 \sum_i f(i)^2 - 5000 < 46.17$%.
81 static unsigned poker(const octet
*p
)
83 unsigned long f
[16] = { 0 };
87 /* --- Compute the frequencies --- */
89 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
95 /* --- Now do the comparison --- *
97 * This can be simplified. Multiply through the inequality by 5000 and
98 * we get %$5150 < 16 \sum_i f(i)^2 - 5000^2 < 287000$%.
101 for (i
= 0; i
< 16; i
++)
104 q
-= 5000ul * 5000ul;
106 if (10800 >= q
|| q
>= 230850)
107 return (FIPSTEST_POKER
);
113 * Arguments: @const octet *p@ = pointer to buffer
115 * Returns: Zero for success, @FIPSTEST_RUNS@ or @FIPSTEST_LONGRUNS@ on
118 * Use: Performs the runs and long runs tests. The frequency of each
119 * `run', or sequence of equal bits, is counted and tested.
122 static unsigned runs(const octet
*p
)
128 unsigned f
[2][6] = { { 0 } };
130 /* --- Count the run lengths --- */
132 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
134 for (j
= 0; j
< 8; j
++) {
142 rc
|= FIPSTEST_LONGRUNS
;
154 rc
|= FIPSTEST_LONGRUNS
;
159 /* --- Check the results --- */
161 if (2343 > f
[0][0] || f
[0][0] > 2657 || 2343 > f
[1][0] || f
[1][0] > 2657 ||
162 1135 > f
[0][1] || f
[0][1] > 1365 || 1135 > f
[1][1] || f
[1][1] > 1365 ||
163 542 > f
[0][2] || f
[0][2] > 708 || 542 > f
[1][2] || f
[1][2] > 708 ||
164 251 > f
[0][3] || f
[0][3] > 373 || 251 > f
[1][3] || f
[1][3] > 373 ||
165 111 > f
[0][4] || f
[0][4] > 201 || 111 > f
[1][4] || f
[1][4] > 201 ||
166 111 > f
[0][5] || f
[0][5] > 201 || 111 > f
[1][5] || f
[1][5] > 201)
172 /* --- @fipstest@ --- *
174 * Arguments: @const octet *p@ = pointer to a buffer of @FIPSTEST_BUFSZ@
177 * Returns: Zero if OK, or a bitmask of failed tests.
179 * Use: Performs the FIPS140 randomness tests on a block of data.
182 unsigned fipstest(const octet
*p
)
191 /*----- That's all, folks -------------------------------------------------*/