]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/rand/randtest.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | #include <stdio.h> | |
60 | #include <stdlib.h> | |
61 | #include "rand.h" | |
62 | ||
63 | /* some FIPS 140-1 random number test */ | |
64 | /* some simple tests */ | |
65 | ||
66 | int main() | |
67 | { | |
68 | unsigned char buf[2500]; | |
69 | int i,j,k,s,sign,nsign,err=0; | |
70 | unsigned long n1; | |
71 | unsigned long n2[16]; | |
72 | unsigned long runs[2][34]; | |
73 | /*double d; */ | |
74 | long d; | |
75 | ||
76 | RAND_bytes(buf,2500); | |
77 | ||
78 | n1=0; | |
79 | for (i=0; i<16; i++) n2[i]=0; | |
80 | for (i=0; i<34; i++) runs[0][i]=runs[1][i]=0; | |
81 | ||
82 | /* test 1 and 2 */ | |
83 | sign=0; | |
84 | nsign=0; | |
85 | for (i=0; i<2500; i++) | |
86 | { | |
87 | j=buf[i]; | |
88 | ||
89 | n2[j&0x0f]++; | |
90 | n2[(j>>4)&0x0f]++; | |
91 | ||
92 | for (k=0; k<8; k++) | |
93 | { | |
94 | s=(j&0x01); | |
95 | if (s == sign) | |
96 | nsign++; | |
97 | else | |
98 | { | |
99 | if (nsign > 34) nsign=34; | |
100 | if (nsign != 0) | |
101 | { | |
102 | runs[sign][nsign-1]++; | |
103 | if (nsign > 6) | |
104 | runs[sign][5]++; | |
105 | } | |
106 | sign=s; | |
107 | nsign=1; | |
108 | } | |
109 | ||
110 | if (s) n1++; | |
111 | j>>=1; | |
112 | } | |
113 | } | |
114 | if (nsign > 34) nsign=34; | |
115 | if (nsign != 0) runs[sign][nsign-1]++; | |
116 | ||
117 | /* test 1 */ | |
118 | if (!((9654 < n1) && (n1 < 10346))) | |
119 | { | |
120 | printf("test 1 failed, X=%ld\n",n1); | |
121 | err++; | |
122 | } | |
123 | printf("test 1 done\n"); | |
124 | ||
125 | /* test 2 */ | |
126 | #ifdef undef | |
127 | d=0; | |
128 | for (i=0; i<16; i++) | |
129 | d+=n2[i]*n2[i]; | |
130 | d=d*16.0/5000.0-5000.0; | |
131 | if (!((1.03 < d) && (d < 57.4))) | |
132 | { | |
133 | printf("test 2 failed, X=%.2f\n",d); | |
134 | err++; | |
135 | } | |
136 | #endif | |
137 | d=0; | |
138 | for (i=0; i<16; i++) | |
139 | d+=n2[i]*n2[i]; | |
140 | d=(d*8)/25-500000; | |
141 | if (!((103 < d) && (d < 5740))) | |
142 | { | |
143 | printf("test 2 failed, X=%ld.%02ld\n",d/100L,d%100L); | |
144 | err++; | |
145 | } | |
146 | printf("test 2 done\n"); | |
147 | ||
148 | /* test 3 */ | |
149 | for (i=0; i<2; i++) | |
150 | { | |
151 | if (!((2267 < runs[i][0]) && (runs[i][0] < 2733))) | |
152 | { | |
153 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
154 | i,1,runs[i][0]); | |
155 | err++; | |
156 | } | |
157 | if (!((1079 < runs[i][1]) && (runs[i][1] < 1421))) | |
158 | { | |
159 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
160 | i,2,runs[i][1]); | |
161 | err++; | |
162 | } | |
163 | if (!(( 502 < runs[i][2]) && (runs[i][2] < 748))) | |
164 | { | |
165 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
166 | i,3,runs[i][2]); | |
167 | err++; | |
168 | } | |
169 | if (!(( 223 < runs[i][3]) && (runs[i][3] < 402))) | |
170 | { | |
171 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
172 | i,4,runs[i][3]); | |
173 | err++; | |
174 | } | |
175 | if (!(( 90 < runs[i][4]) && (runs[i][4] < 223))) | |
176 | { | |
177 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
178 | i,5,runs[i][4]); | |
179 | err++; | |
180 | } | |
181 | if (!(( 90 < runs[i][5]) && (runs[i][5] < 223))) | |
182 | { | |
183 | printf("test 3 failed, bit=%d run=%d num=%ld\n", | |
184 | i,6,runs[i][5]); | |
185 | err++; | |
186 | } | |
187 | } | |
188 | printf("test 3 done\n"); | |
189 | ||
190 | /* test 4 */ | |
191 | if (runs[0][33] != 0) | |
192 | { | |
193 | printf("test 4 failed, bit=%d run=%d num=%ld\n", | |
194 | 0,34,runs[0][33]); | |
195 | err++; | |
196 | } | |
197 | if (runs[1][33] != 0) | |
198 | { | |
199 | printf("test 4 failed, bit=%d run=%d num=%ld\n", | |
200 | 1,34,runs[1][33]); | |
201 | err++; | |
202 | } | |
203 | printf("test 4 done\n"); | |
204 | err=((err)?1:0); | |
205 | exit(err); | |
206 | return(err); | |
207 | } |