1 /* crypto/rand/md_rand.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
63 #include "openssl/e_os.h"
65 #include <openssl/crypto.h>
67 #if !defined(USE_MD5_RAND) && !defined(USE_SHA1_RAND) && !defined(USE_MDC2_RAND) && !defined(USE_MD2_RAND)
68 #if !defined(NO_SHA) && !defined(NO_SHA1)
70 #elif !defined(NO_MD5)
72 #elif !defined(NO_MDC2) && !defined(NO_DES)
74 #elif !defined(NO_MD2)
77 #error No message digest algorithm available
81 /* Changed how the state buffer used. I now attempt to 'wrap' such
82 * that I don't run over the same locations the next time go through
83 * the 1023 bytes - many thanks to
84 * Robert J. LeBlanc <rjl@renaissoft.com> for his comments
87 #if defined(USE_MD5_RAND)
88 #include <openssl/md5.h>
89 #define MD_DIGEST_LENGTH MD5_DIGEST_LENGTH
90 #define MD_CTX MD5_CTX
91 #define MD_Init(a) MD5_Init(a)
92 #define MD_Update(a,b,c) MD5_Update(a,b,c)
93 #define MD_Final(a,b) MD5_Final(a,b)
94 #define MD(a,b,c) MD5(a,b,c)
95 #elif defined(USE_SHA1_RAND)
96 #include <openssl/sha.h>
97 #define MD_DIGEST_LENGTH SHA_DIGEST_LENGTH
98 #define MD_CTX SHA_CTX
99 #define MD_Init(a) SHA1_Init(a)
100 #define MD_Update(a,b,c) SHA1_Update(a,b,c)
101 #define MD_Final(a,b) SHA1_Final(a,b)
102 #define MD(a,b,c) SHA1(a,b,c)
103 #elif defined(USE_MDC2_RAND)
104 #include <openssl/mdc2.h>
105 #define MD_DIGEST_LENGTH MDC2_DIGEST_LENGTH
106 #define MD_CTX MDC2_CTX
107 #define MD_Init(a) MDC2_Init(a)
108 #define MD_Update(a,b,c) MDC2_Update(a,b,c)
109 #define MD_Final(a,b) MDC2_Final(a,b)
110 #define MD(a,b,c) MDC2(a,b,c)
111 #elif defined(USE_MD2_RAND)
112 #include <openssl/md2.h>
113 #define MD_DIGEST_LENGTH MD2_DIGEST_LENGTH
114 #define MD_CTX MD2_CTX
115 #define MD_Init(a) MD2_Init(a)
116 #define MD_Update(a,b,c) MD2_Update(a,b,c)
117 #define MD_Final(a,b) MD2_Final(a,b)
118 #define MD(a,b,c) MD2(a,b,c)
121 #include <openssl/rand.h>
123 /* #define NORAND 1 */
124 /* #define PREDICT 1 */
126 #define STATE_SIZE 1023
127 static int state_num=0,state_index=0;
128 static unsigned char state[STATE_SIZE+MD_DIGEST_LENGTH];
129 static unsigned char md[MD_DIGEST_LENGTH];
130 static long md_count[2]={0,0};
132 const char *RAND_version="RAND" OPENSSL_VERSION_PTEXT;
134 static void ssleay_rand_cleanup(void);
135 static void ssleay_rand_seed(const void *buf, int num);
136 static void ssleay_rand_bytes(unsigned char *buf, int num);
138 RAND_METHOD rand_ssleay_meth={
144 RAND_METHOD *RAND_SSLeay(void)
146 return(&rand_ssleay_meth);
149 static void ssleay_rand_cleanup(void)
151 memset(state,0,sizeof(state));
154 memset(md,0,MD_DIGEST_LENGTH);
159 static void ssleay_rand_seed(const void *buf, int num)
161 int i,j,k,st_idx,st_num;
168 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
172 state_index=(state_index+num);
173 if (state_index >= STATE_SIZE)
175 state_index%=STATE_SIZE;
176 state_num=STATE_SIZE;
178 else if (state_num < STATE_SIZE)
180 if (state_index > state_num)
181 state_num=state_index;
183 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
185 for (i=0; i<num; i+=MD_DIGEST_LENGTH)
188 j=(j > MD_DIGEST_LENGTH)?MD_DIGEST_LENGTH:j;
191 MD_Update(&m,md,MD_DIGEST_LENGTH);
192 k=(st_idx+j)-STATE_SIZE;
195 MD_Update(&m,&(state[st_idx]),j-k);
196 MD_Update(&m,&(state[0]),k);
199 MD_Update(&m,&(state[st_idx]),j);
202 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
206 buf=(const char *)buf + j;
210 state[st_idx++]^=md[k];
211 if (st_idx >= STATE_SIZE)
218 memset((char *)&m,0,sizeof(m));
221 static void ssleay_rand_bytes(unsigned char *buf, int num)
223 int i,j,k,st_num,st_idx;
233 static unsigned char val=0;
235 for (i=0; i<num; i++)
241 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
245 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
246 /* put in some default random data, we need more than
248 RAND_seed(&m,sizeof(m));
251 RAND_seed(&l,sizeof(l));
253 RAND_seed(&l,sizeof(l));
256 RAND_seed(&l,sizeof(l));
258 /* #ifdef DEVRANDOM */
260 * Use a random entropy pool device.
261 * Linux 1.3.x and FreeBSD-Current has
262 * this. Use /dev/urandom if you can
263 * as /dev/random will block if it runs out
266 if ((fh = fopen(DEVRANDOM, "r")) != NULL)
268 unsigned char tmpbuf[32];
270 fread((unsigned char *)tmpbuf,1,32,fh);
271 /* we don't care how many bytes we read,
272 * we will just copy the 'stack' if there is
273 * nothing else :-) */
275 RAND_seed(tmpbuf,32);
280 memset(state,0,STATE_SIZE);
281 memset(md,0,MD_DIGEST_LENGTH);
283 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
290 if (state_index > state_num)
291 state_index=(state_index%state_num);
293 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
297 j=(num >= MD_DIGEST_LENGTH/2)?MD_DIGEST_LENGTH/2:num;
300 MD_Update(&m,&(md[MD_DIGEST_LENGTH/2]),MD_DIGEST_LENGTH/2);
301 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
303 MD_Update(&m,buf,j); /* purify complains */
308 MD_Update(&m,&(state[st_idx]),j-k);
309 MD_Update(&m,&(state[0]),k);
312 MD_Update(&m,&(state[st_idx]),j);
317 if (st_idx >= st_num)
319 state[st_idx++]^=md[i];
320 *(buf++)=md[i+MD_DIGEST_LENGTH/2];
325 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
327 MD_Update(&m,md,MD_DIGEST_LENGTH);
329 memset(&m,0,sizeof(m));
334 #include <openssl/rand.h>
336 /*****************************************************************************
337 * Initialisation function for the SSL random generator. Takes the contents
338 * of the screen as random seed.
340 * Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V.
343 * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>;
344 * the original copyright message is:
346 * (C) Copyright Microsoft Corp. 1993. All rights reserved.
348 * You have a royalty-free right to use, modify, reproduce and
349 * distribute the Sample Files (and/or any modified version) in
350 * any way you find useful, provided that you agree that
351 * Microsoft has no warranty obligations or liability for any
352 * Sample Application Files which are modified.
355 * I have modified the loading of bytes via RAND_seed() mechanism since
356 * the origional would have been very very CPU intensive since RAND_seed()
357 * does an MD5 per 16 bytes of input. The cost to digest 16 bytes is the same
358 * as that to digest 56 bytes. So under the old system, a screen of
359 * 1024*768*256 would have been CPU cost of approximatly 49,000 56 byte MD5
360 * digests or digesting 2.7 mbytes. What I have put in place would
361 * be 48 16k MD5 digests, or efectivly 48*16+48 MD5 bytes or 816 kbytes
362 * or about 3.5 times as much.
365 void RAND_screen(void)
367 HDC hScrDC; /* screen DC */
368 HDC hMemDC; /* memory DC */
369 HBITMAP hBitmap; /* handle for our bitmap */
370 HBITMAP hOldBitmap; /* handle for previous bitmap */
371 BITMAP bm; /* bitmap properties */
372 unsigned int size; /* size of bitmap */
373 char *bmbits; /* contents of bitmap */
374 int w; /* screen width */
375 int h; /* screen height */
376 int y; /* y-coordinate of screen lines to grab */
377 int n = 16; /* number of screen lines to grab at a time */
379 /* Create a screen DC and a memory DC compatible to screen DC */
380 hScrDC = CreateDC("DISPLAY", NULL, NULL, NULL);
381 hMemDC = CreateCompatibleDC(hScrDC);
383 /* Get screen resolution */
384 w = GetDeviceCaps(hScrDC, HORZRES);
385 h = GetDeviceCaps(hScrDC, VERTRES);
387 /* Create a bitmap compatible with the screen DC */
388 hBitmap = CreateCompatibleBitmap(hScrDC, w, n);
390 /* Select new bitmap into memory DC */
391 hOldBitmap = SelectObject(hMemDC, hBitmap);
393 /* Get bitmap properties */
394 GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&bm);
395 size = (unsigned int)bm.bmWidthBytes * bm.bmHeight * bm.bmPlanes;
397 bmbits = Malloc(size);
399 /* Now go through the whole screen, repeatedly grabbing n lines */
400 for (y = 0; y < h-n; y += n)
402 unsigned char md[MD_DIGEST_LENGTH];
404 /* Bitblt screen DC to memory DC */
405 BitBlt(hMemDC, 0, 0, w, n, hScrDC, 0, y, SRCCOPY);
407 /* Copy bitmap bits from memory DC to bmbits */
408 GetBitmapBits(hBitmap, size, bmbits);
410 /* Get the MD5 of the bitmap */
413 /* Seed the random generator with the MD5 digest */
414 RAND_seed(md, MD_DIGEST_LENGTH);
420 /* Select old bitmap back into memory DC */
421 hBitmap = SelectObject(hMemDC, hOldBitmap);
424 DeleteObject(hBitmap);