]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/rand/md_rand.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 "cryptlib.h" | |
61 | #include <sys/types.h> | |
62 | #include <time.h> | |
63 | ||
d02b48c6 RE |
64 | #if !defined(USE_MD5_RAND) && !defined(USE_SHA1_RAND) && !defined(USE_MDC2_RAND) && !defined(USE_MD2_RAND) |
65 | #ifndef NO_MD5 | |
66 | #define USE_MD5_RAND | |
67 | #elif !defined(NO_SHA1) | |
68 | #define USE_SHA1_RAND | |
69 | #elif !defined(NO_MDC2) | |
70 | #define USE_MDC2_RAND | |
71 | #elif !defined(NO_MD2) | |
72 | #define USE_MD2_RAND | |
73 | #else | |
74 | We need a message digest of some type | |
75 | #endif | |
76 | #endif | |
77 | ||
78 | /* Changed how the state buffer used. I now attempt to 'wrap' such | |
79 | * that I don't run over the same locations the next time go through | |
80 | * the 1023 bytes - many thanks to | |
81 | * Robert J. LeBlanc <rjl@renaissoft.com> for his comments | |
82 | */ | |
83 | ||
84 | #if defined(USE_MD5_RAND) | |
85 | #include "md5.h" | |
86 | #define MD_DIGEST_LENGTH MD5_DIGEST_LENGTH | |
87 | #define MD_CTX MD5_CTX | |
88 | #define MD_Init(a) MD5_Init(a) | |
89 | #define MD_Update(a,b,c) MD5_Update(a,b,c) | |
90 | #define MD_Final(a,b) MD5_Final(a,b) | |
dfeab068 | 91 | #define MD(a,b,c) MD5(a,b,c) |
d02b48c6 RE |
92 | #elif defined(USE_SHA1_RAND) |
93 | #include "sha.h" | |
94 | #define MD_DIGEST_LENGTH SHA_DIGEST_LENGTH | |
95 | #define MD_CTX SHA_CTX | |
96 | #define MD_Init(a) SHA1_Init(a) | |
97 | #define MD_Update(a,b,c) SHA1_Update(a,b,c) | |
98 | #define MD_Final(a,b) SHA1_Final(a,b) | |
dfeab068 | 99 | #define MD(a,b,c) SHA1(a,b,c) |
d02b48c6 RE |
100 | #elif defined(USE_MDC2_RAND) |
101 | #include "mdc2.h" | |
102 | #define MD_DIGEST_LENGTH MDC2_DIGEST_LENGTH | |
103 | #define MD_CTX MDC2_CTX | |
104 | #define MD_Init(a) MDC2_Init(a) | |
105 | #define MD_Update(a,b,c) MDC2_Update(a,b,c) | |
106 | #define MD_Final(a,b) MDC2_Final(a,b) | |
dfeab068 | 107 | #define MD(a,b,c) MDC2(a,b,c) |
d02b48c6 RE |
108 | #elif defined(USE_MD2_RAND) |
109 | #include "md2.h" | |
110 | #define MD_DIGEST_LENGTH MD2_DIGEST_LENGTH | |
111 | #define MD_CTX MD2_CTX | |
112 | #define MD_Init(a) MD2_Init(a) | |
113 | #define MD_Update(a,b,c) MD2_Update(a,b,c) | |
114 | #define MD_Final(a,b) MD2_Final(a,b) | |
dfeab068 | 115 | #define MD(a,b,c) MD2(a,b,c) |
d02b48c6 RE |
116 | #endif |
117 | ||
118 | #include "rand.h" | |
119 | ||
dfeab068 RE |
120 | /* #define NORAND 1 */ |
121 | /* #define PREDICT 1 */ | |
d02b48c6 RE |
122 | |
123 | #define STATE_SIZE 1023 | |
124 | static int state_num=0,state_index=0; | |
58964a49 | 125 | static unsigned char state[STATE_SIZE+MD_DIGEST_LENGTH]; |
d02b48c6 | 126 | static unsigned char md[MD_DIGEST_LENGTH]; |
dfeab068 | 127 | static long md_count[2]={0,0}; |
d02b48c6 | 128 | |
dfeab068 | 129 | char *RAND_version="RAND part of SSLeay 0.9.1a 06-Jul-1998"; |
d02b48c6 | 130 | |
dfeab068 RE |
131 | static void ssleay_rand_cleanup(void); |
132 | static void ssleay_rand_seed(unsigned char *buf, int num); | |
133 | static void ssleay_rand_bytes(unsigned char *buf, int num); | |
134 | ||
135 | RAND_METHOD rand_ssleay={ | |
136 | ssleay_rand_seed, | |
137 | ssleay_rand_bytes, | |
138 | ssleay_rand_cleanup, | |
139 | }; | |
140 | ||
141 | RAND_METHOD *RAND_SSLeay() | |
142 | { | |
143 | return(&rand_ssleay); | |
144 | } | |
145 | ||
146 | static void ssleay_rand_cleanup() | |
d02b48c6 | 147 | { |
58964a49 | 148 | memset(state,0,sizeof(state)); |
d02b48c6 RE |
149 | state_num=0; |
150 | state_index=0; | |
151 | memset(md,0,MD_DIGEST_LENGTH); | |
dfeab068 RE |
152 | md_count[0]=0; |
153 | md_count[1]=0; | |
d02b48c6 RE |
154 | } |
155 | ||
dfeab068 | 156 | static void ssleay_rand_seed(buf,num) |
d02b48c6 RE |
157 | unsigned char *buf; |
158 | int num; | |
159 | { | |
160 | int i,j,k,st_idx,st_num; | |
161 | MD_CTX m; | |
162 | ||
163 | #ifdef NORAND | |
164 | return; | |
165 | #endif | |
166 | ||
167 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
168 | st_idx=state_index; | |
169 | st_num=state_num; | |
170 | ||
171 | state_index=(state_index+num); | |
58964a49 | 172 | if (state_index >= STATE_SIZE) |
d02b48c6 RE |
173 | { |
174 | state_index%=STATE_SIZE; | |
175 | state_num=STATE_SIZE; | |
176 | } | |
177 | else if (state_num < STATE_SIZE) | |
178 | { | |
179 | if (state_index > state_num) | |
180 | state_num=state_index; | |
181 | } | |
182 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); | |
183 | ||
184 | for (i=0; i<num; i+=MD_DIGEST_LENGTH) | |
185 | { | |
186 | j=(num-i); | |
187 | j=(j > MD_DIGEST_LENGTH)?MD_DIGEST_LENGTH:j; | |
188 | ||
189 | MD_Init(&m); | |
190 | MD_Update(&m,md,MD_DIGEST_LENGTH); | |
191 | k=(st_idx+j)-STATE_SIZE; | |
192 | if (k > 0) | |
193 | { | |
194 | MD_Update(&m,&(state[st_idx]),j-k); | |
195 | MD_Update(&m,&(state[0]),k); | |
196 | } | |
197 | else | |
198 | MD_Update(&m,&(state[st_idx]),j); | |
199 | ||
200 | MD_Update(&m,buf,j); | |
dfeab068 | 201 | MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count)); |
d02b48c6 | 202 | MD_Final(md,&m); |
dfeab068 | 203 | md_count[1]++; |
d02b48c6 RE |
204 | |
205 | buf+=j; | |
206 | ||
207 | for (k=0; k<j; k++) | |
208 | { | |
209 | state[st_idx++]^=md[k]; | |
210 | if (st_idx >= STATE_SIZE) | |
211 | { | |
212 | st_idx=0; | |
213 | st_num=STATE_SIZE; | |
214 | } | |
215 | } | |
216 | } | |
217 | memset((char *)&m,0,sizeof(m)); | |
218 | } | |
219 | ||
dfeab068 | 220 | static void ssleay_rand_bytes(buf,num) |
d02b48c6 RE |
221 | unsigned char *buf; |
222 | int num; | |
223 | { | |
224 | int i,j,k,st_num,st_idx; | |
225 | MD_CTX m; | |
226 | static int init=1; | |
227 | unsigned long l; | |
228 | #ifdef DEVRANDOM | |
229 | FILE *fh; | |
230 | #endif | |
231 | ||
232 | #ifdef PREDICT | |
233 | { | |
234 | static unsigned char val=0; | |
235 | ||
236 | for (i=0; i<num; i++) | |
237 | buf[i]=val++; | |
238 | return; | |
239 | } | |
240 | #endif | |
241 | ||
242 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
243 | ||
244 | if (init) | |
245 | { | |
246 | init=0; | |
247 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); | |
248 | /* put in some default random data, we need more than | |
249 | * just this */ | |
250 | RAND_seed((unsigned char *)&m,sizeof(m)); | |
251 | #ifndef MSDOS | |
252 | l=getpid(); | |
253 | RAND_seed((unsigned char *)&l,sizeof(l)); | |
254 | l=getuid(); | |
255 | RAND_seed((unsigned char *)&l,sizeof(l)); | |
256 | #endif | |
257 | l=time(NULL); | |
258 | RAND_seed((unsigned char *)&l,sizeof(l)); | |
259 | ||
58964a49 | 260 | /* #ifdef DEVRANDOM */ |
d02b48c6 RE |
261 | /* |
262 | * Use a random entropy pool device. | |
263 | * Linux 1.3.x and FreeBSD-Current has | |
264 | * this. Use /dev/urandom if you can | |
265 | * as /dev/random will block if it runs out | |
266 | * of random entries. | |
267 | */ | |
268 | if ((fh = fopen(DEVRANDOM, "r")) != NULL) | |
269 | { | |
58964a49 | 270 | unsigned char tmpbuf[32]; |
d02b48c6 | 271 | |
58964a49 | 272 | fread((unsigned char *)tmpbuf,1,32,fh); |
d02b48c6 RE |
273 | /* we don't care how many bytes we read, |
274 | * we will just copy the 'stack' if there is | |
275 | * nothing else :-) */ | |
276 | fclose(fh); | |
58964a49 RE |
277 | RAND_seed(tmpbuf,32); |
278 | memset(tmpbuf,0,32); | |
d02b48c6 | 279 | } |
58964a49 | 280 | /* #endif */ |
d02b48c6 RE |
281 | #ifdef PURIFY |
282 | memset(state,0,STATE_SIZE); | |
283 | memset(md,0,MD_DIGEST_LENGTH); | |
284 | #endif | |
285 | CRYPTO_w_lock(CRYPTO_LOCK_RAND); | |
286 | } | |
287 | ||
288 | st_idx=state_index; | |
289 | st_num=state_num; | |
290 | state_index+=num; | |
291 | if (state_index > state_num) | |
292 | state_index=(state_index%state_num); | |
293 | ||
294 | CRYPTO_w_unlock(CRYPTO_LOCK_RAND); | |
295 | ||
296 | while (num > 0) | |
297 | { | |
298 | j=(num >= MD_DIGEST_LENGTH/2)?MD_DIGEST_LENGTH/2:num; | |
299 | num-=j; | |
300 | MD_Init(&m); | |
301 | MD_Update(&m,&(md[MD_DIGEST_LENGTH/2]),MD_DIGEST_LENGTH/2); | |
dfeab068 | 302 | MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count)); |
d02b48c6 RE |
303 | #ifndef PURIFY |
304 | MD_Update(&m,buf,j); /* purify complains */ | |
305 | #endif | |
306 | k=(st_idx+j)-st_num; | |
307 | if (k > 0) | |
308 | { | |
309 | MD_Update(&m,&(state[st_idx]),j-k); | |
310 | MD_Update(&m,&(state[0]),k); | |
311 | } | |
312 | else | |
313 | MD_Update(&m,&(state[st_idx]),j); | |
314 | MD_Final(md,&m); | |
315 | ||
316 | for (i=0; i<j; i++) | |
317 | { | |
318 | if (st_idx >= st_num) | |
319 | st_idx=0; | |
320 | state[st_idx++]^=md[i]; | |
321 | *(buf++)=md[i+MD_DIGEST_LENGTH/2]; | |
322 | } | |
323 | } | |
324 | ||
325 | MD_Init(&m); | |
dfeab068 RE |
326 | MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count)); |
327 | md_count[0]++; | |
d02b48c6 RE |
328 | MD_Update(&m,md,MD_DIGEST_LENGTH); |
329 | MD_Final(md,&m); | |
330 | memset(&m,0,sizeof(m)); | |
331 | } | |
332 | ||
333 | #ifdef WINDOWS | |
334 | #include <windows.h> | |
335 | #include <rand.h> | |
336 | ||
337 | /***************************************************************************** | |
338 | * Initialisation function for the SSL random generator. Takes the contents | |
339 | * of the screen as random seed. | |
340 | * | |
341 | * Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V. | |
342 | * | |
343 | * Code adapted from | |
344 | * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>; | |
345 | * the original copyright message is: | |
346 | * | |
347 | // (C) Copyright Microsoft Corp. 1993. All rights reserved. | |
348 | // | |
349 | // You have a royalty-free right to use, modify, reproduce and | |
350 | // distribute the Sample Files (and/or any modified version) in | |
351 | // any way you find useful, provided that you agree that | |
352 | // Microsoft has no warranty obligations or liability for any | |
353 | // Sample Application Files which are modified. | |
354 | */ | |
355 | /* | |
356 | * I have modified the loading of bytes via RAND_seed() mechanism since | |
357 | * the origional would have been very very CPU intensive since RAND_seed() | |
358 | * does an MD5 per 16 bytes of input. The cost to digest 16 bytes is the same | |
359 | * as that to digest 56 bytes. So under the old system, a screen of | |
360 | * 1024*768*256 would have been CPU cost of approximatly 49,000 56 byte MD5 | |
361 | * digests or digesting 2.7 mbytes. What I have put in place would | |
362 | * be 48 16k MD5 digests, or efectivly 48*16+48 MD5 bytes or 816 kbytes | |
363 | * or about 3.5 times as much. | |
364 | * - eric | |
365 | */ | |
366 | void RAND_screen(void) | |
367 | { | |
368 | HDC hScrDC; /* screen DC */ | |
369 | HDC hMemDC; /* memory DC */ | |
370 | HBITMAP hBitmap; /* handle for our bitmap */ | |
371 | HBITMAP hOldBitmap; /* handle for previous bitmap */ | |
372 | BITMAP bm; /* bitmap properties */ | |
373 | unsigned int size; /* size of bitmap */ | |
374 | char *bmbits; /* contents of bitmap */ | |
375 | int w; /* screen width */ | |
376 | int h; /* screen height */ | |
377 | int y; /* y-coordinate of screen lines to grab */ | |
378 | int n = 16; /* number of screen lines to grab at a time */ | |
379 | ||
380 | /* Create a screen DC and a memory DC compatible to screen DC */ | |
381 | hScrDC = CreateDC("DISPLAY", NULL, NULL, NULL); | |
382 | hMemDC = CreateCompatibleDC(hScrDC); | |
383 | ||
384 | /* Get screen resolution */ | |
385 | w = GetDeviceCaps(hScrDC, HORZRES); | |
386 | h = GetDeviceCaps(hScrDC, VERTRES); | |
387 | ||
388 | /* Create a bitmap compatible with the screen DC */ | |
389 | hBitmap = CreateCompatibleBitmap(hScrDC, w, n); | |
390 | ||
391 | /* Select new bitmap into memory DC */ | |
392 | hOldBitmap = SelectObject(hMemDC, hBitmap); | |
393 | ||
394 | /* Get bitmap properties */ | |
395 | GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&bm); | |
396 | size = (unsigned int)bm.bmWidthBytes * bm.bmHeight * bm.bmPlanes; | |
397 | ||
398 | bmbits = Malloc(size); | |
399 | if (bmbits) { | |
400 | /* Now go through the whole screen, repeatedly grabbing n lines */ | |
401 | for (y = 0; y < h-n; y += n) | |
402 | { | |
403 | unsigned char md[MD_DIGEST_LENGTH]; | |
404 | ||
405 | /* Bitblt screen DC to memory DC */ | |
406 | BitBlt(hMemDC, 0, 0, w, n, hScrDC, 0, y, SRCCOPY); | |
407 | ||
408 | /* Copy bitmap bits from memory DC to bmbits */ | |
409 | GetBitmapBits(hBitmap, size, bmbits); | |
410 | ||
411 | /* Get the MD5 of the bitmap */ | |
dfeab068 | 412 | MD(bmbits,size,md); |
d02b48c6 RE |
413 | |
414 | /* Seed the random generator with the MD5 digest */ | |
415 | RAND_seed(md, MD_DIGEST_LENGTH); | |
416 | } | |
417 | ||
418 | Free(bmbits); | |
419 | } | |
420 | ||
421 | /* Select old bitmap back into memory DC */ | |
422 | hBitmap = SelectObject(hMemDC, hOldBitmap); | |
423 | ||
424 | /* Clean up */ | |
425 | DeleteObject(hBitmap); | |
426 | DeleteDC(hMemDC); | |
427 | DeleteDC(hScrDC); | |
428 | } | |
429 | #endif |