3 * $Id: fipstest.c,v 1.1 2000/06/17 10:55:38 mdw Exp $
5 * FIPS 140-1 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 /*----- Revision history --------------------------------------------------*
32 * $Log: fipstest.c,v $
33 * Revision 1.1 2000/06/17 10:55:38 mdw
34 * FIPS 140-1 random generator test.
38 /*----- Header files ------------------------------------------------------*/
40 #include <mLib/bits.h>
44 /*----- Main code ---------------------------------------------------------*/
46 /* --- @monobit@ --- *
48 * Arguments: @const octet *p@ = pointer to buffer
50 * Returns: Zero if OK, @FIPSTEST_MONOBIT@ on failure.
52 * Use: Performs the monobit test on a buffer of data. If %$n_1$% is
53 * the number of 1 bits in the buffer, then the monobit test is
54 * passed when %$9654 < n_1 < 10346$%.
57 static unsigned monobit(const octet
*p
)
62 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
64 for (j
= 0; j
< 8; j
++) {
71 if (9654 >= n1
|| n1
>= 10346)
72 return (FIPSTEST_MONOBIT
);
78 * Arguments: @const octet *p@ = pointer to buffer
80 * Returns: Zero if OK, @FIPSTEST_POKER@ on failure.
82 * Use: Performs the poker test on a buffer of data. The buffer is
83 * divided into 4-bit nibbles %$x_i$%. If
84 * %$f(x) = \sum_{x_i = x} 1$% is the frequency of each nibble,
85 * then the test is passed if
86 * %$1.03 < 16/5000 \sum_i f(i)^2 - 5000 < 57.4$%.
89 static unsigned poker(const octet
*p
)
91 unsigned long f
[16] = { 0 };
95 /* --- Compute the frequencies --- */
97 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
103 /* --- Now do the comparison --- *
105 * This can be simplified. Multiply through the inequality by 5000 and
106 * we get %$5150 < 16 \sum_i f(i)^2 - 5000^2 < 287000$%.
109 for (i
= 0; i
< 16; i
++)
114 if (5150 >= q
|| q
>= 287000)
115 return (FIPSTEST_POKER
);
121 * Arguments: @const octet *p@ = pointer to buffer
123 * Returns: Zero for success, @FIPSTEST_RUNS@ or @FIPSTEST_LONGRUNS@ on
126 * Use: Performs the runs and long runs tests. The frequency of each
127 * `run', or sequence of equal bits, is counted and tested.
130 static unsigned runs(const octet
*p
)
136 unsigned f
[2][6] = { 0 };
138 /* --- Count the run lengths --- */
140 for (i
= 0; i
< FIPSTEST_BUFSZ
; i
++) {
142 for (j
= 0; j
< 8; j
++) {
150 rc
|= FIPSTEST_LONGRUNS
;
162 rc
|= FIPSTEST_LONGRUNS
;
167 /* --- Check the results --- */
169 if (2267 > f
[0][0] || f
[0][0] > 2733 ||
170 2267 > f
[1][0] || f
[1][0] > 2733 ||
171 1079 > f
[0][1] || f
[0][1] > 1421 ||
172 1079 > f
[1][1] || f
[1][1] > 1421 ||
173 502 > f
[0][2] || f
[0][2] > 748 ||
174 502 > f
[1][2] || f
[1][2] > 748 ||
175 223 > f
[0][3] || f
[0][3] > 402 ||
176 223 > f
[1][3] || f
[1][3] > 402 ||
177 90 > f
[0][4] || f
[0][4] > 223 ||
178 90 > f
[1][4] || f
[1][4] > 223 ||
179 90 > f
[0][5] || f
[0][5] > 223 ||
180 90 > f
[1][5] || f
[1][5] > 223)
186 /* --- @fipstest@ --- *
188 * Arguments: @const octet *p@ = pointer to a buffer of @FIPSTEST_BUFSZ@
191 * Returns: Zero if OK, or a bitmask of failed tests.
193 * Use: Performs the FIPS 140-1 randomness tests on a block of data.
196 unsigned fipstest(const octet
*p
)
205 /*----- That's all, folks -------------------------------------------------*/