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.]
60 #include <sys/types.h>
70 #include <openssl/crypto.h>
72 #if !defined(USE_MD5_RAND) && !defined(USE_SHA1_RAND) && !defined(USE_MDC2_RAND) && !defined(USE_MD2_RAND)
73 #if !defined(NO_SHA) && !defined(NO_SHA1)
75 #elif !defined(NO_MD5)
77 #elif !defined(NO_MDC2) && !defined(NO_DES)
79 #elif !defined(NO_MD2)
82 #error No message digest algorithm available
86 /* Changed how the state buffer used. I now attempt to 'wrap' such
87 * that I don't run over the same locations the next time go through
88 * the 1023 bytes - many thanks to
89 * Robert J. LeBlanc <rjl@renaissoft.com> for his comments
92 #if defined(USE_MD5_RAND)
93 #include <openssl/md5.h>
94 #define MD_DIGEST_LENGTH MD5_DIGEST_LENGTH
95 #define MD_CTX MD5_CTX
96 #define MD_Init(a) MD5_Init(a)
97 #define MD_Update(a,b,c) MD5_Update(a,b,c)
98 #define MD_Final(a,b) MD5_Final(a,b)
99 #define MD(a,b,c) MD5(a,b,c)
100 #elif defined(USE_SHA1_RAND)
101 #include <openssl/sha.h>
102 #define MD_DIGEST_LENGTH SHA_DIGEST_LENGTH
103 #define MD_CTX SHA_CTX
104 #define MD_Init(a) SHA1_Init(a)
105 #define MD_Update(a,b,c) SHA1_Update(a,b,c)
106 #define MD_Final(a,b) SHA1_Final(a,b)
107 #define MD(a,b,c) SHA1(a,b,c)
108 #elif defined(USE_MDC2_RAND)
109 #include <openssl/mdc2.h>
110 #define MD_DIGEST_LENGTH MDC2_DIGEST_LENGTH
111 #define MD_CTX MDC2_CTX
112 #define MD_Init(a) MDC2_Init(a)
113 #define MD_Update(a,b,c) MDC2_Update(a,b,c)
114 #define MD_Final(a,b) MDC2_Final(a,b)
115 #define MD(a,b,c) MDC2(a,b,c)
116 #elif defined(USE_MD2_RAND)
117 #include <openssl/md2.h>
118 #define MD_DIGEST_LENGTH MD2_DIGEST_LENGTH
119 #define MD_CTX MD2_CTX
120 #define MD_Init(a) MD2_Init(a)
121 #define MD_Update(a,b,c) MD2_Update(a,b,c)
122 #define MD_Final(a,b) MD2_Final(a,b)
123 #define MD(a,b,c) MD2(a,b,c)
126 #include <openssl/rand.h>
128 /* #define NORAND 1 */
129 /* #define PREDICT 1 */
131 #define STATE_SIZE 1023
132 static int state_num=0,state_index=0;
133 static unsigned char state[STATE_SIZE+MD_DIGEST_LENGTH];
134 static unsigned char md[MD_DIGEST_LENGTH];
135 static long md_count[2]={0,0};
137 const char *RAND_version="RAND" OPENSSL_VERSION_PTEXT;
139 static void ssleay_rand_cleanup(void);
140 static void ssleay_rand_seed(const void *buf, int num);
141 static void ssleay_rand_bytes(unsigned char *buf, int num);
143 RAND_METHOD rand_ssleay_meth={
149 RAND_METHOD *RAND_SSLeay(void)
151 return(&rand_ssleay_meth);
154 static void ssleay_rand_cleanup(void)
156 memset(state,0,sizeof(state));
159 memset(md,0,MD_DIGEST_LENGTH);
164 static void ssleay_rand_seed(const void *buf, int num)
166 int i,j,k,st_idx,st_num;
173 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
177 state_index=(state_index+num);
178 if (state_index >= STATE_SIZE)
180 state_index%=STATE_SIZE;
181 state_num=STATE_SIZE;
183 else if (state_num < STATE_SIZE)
185 if (state_index > state_num)
186 state_num=state_index;
188 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
190 for (i=0; i<num; i+=MD_DIGEST_LENGTH)
193 j=(j > MD_DIGEST_LENGTH)?MD_DIGEST_LENGTH:j;
196 MD_Update(&m,md,MD_DIGEST_LENGTH);
197 k=(st_idx+j)-STATE_SIZE;
200 MD_Update(&m,&(state[st_idx]),j-k);
201 MD_Update(&m,&(state[0]),k);
204 MD_Update(&m,&(state[st_idx]),j);
207 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
211 buf=(const char *)buf + j;
215 state[st_idx++]^=md[k];
216 if (st_idx >= STATE_SIZE)
223 memset((char *)&m,0,sizeof(m));
226 static void ssleay_rand_bytes(unsigned char *buf, int num)
228 int i,j,k,st_num,st_idx;
238 static unsigned char val=0;
240 for (i=0; i<num; i++)
246 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
250 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
251 /* put in some default random data, we need more than
253 RAND_seed(&m,sizeof(m));
256 RAND_seed(&l,sizeof(l));
258 RAND_seed(&l,sizeof(l));
261 RAND_seed(&l,sizeof(l));
263 /* #ifdef DEVRANDOM */
265 * Use a random entropy pool device.
266 * Linux 1.3.x and FreeBSD-Current has
267 * this. Use /dev/urandom if you can
268 * as /dev/random will block if it runs out
271 if ((fh = fopen(DEVRANDOM, "r")) != NULL)
273 unsigned char tmpbuf[32];
275 fread((unsigned char *)tmpbuf,1,32,fh);
276 /* we don't care how many bytes we read,
277 * we will just copy the 'stack' if there is
278 * nothing else :-) */
280 RAND_seed(tmpbuf,32);
285 memset(state,0,STATE_SIZE);
286 memset(md,0,MD_DIGEST_LENGTH);
288 CRYPTO_w_lock(CRYPTO_LOCK_RAND);
295 if (state_index > state_num)
296 state_index=(state_index%state_num);
298 CRYPTO_w_unlock(CRYPTO_LOCK_RAND);
302 j=(num >= MD_DIGEST_LENGTH/2)?MD_DIGEST_LENGTH/2:num;
305 MD_Update(&m,&(md[MD_DIGEST_LENGTH/2]),MD_DIGEST_LENGTH/2);
306 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
308 MD_Update(&m,buf,j); /* purify complains */
313 MD_Update(&m,&(state[st_idx]),j-k);
314 MD_Update(&m,&(state[0]),k);
317 MD_Update(&m,&(state[st_idx]),j);
322 if (st_idx >= st_num)
324 state[st_idx++]^=md[i];
325 *(buf++)=md[i+MD_DIGEST_LENGTH/2];
330 MD_Update(&m,(unsigned char *)&(md_count[0]),sizeof(md_count));
332 MD_Update(&m,md,MD_DIGEST_LENGTH);
334 memset(&m,0,sizeof(m));
339 #include <openssl/rand.h>
341 /*****************************************************************************
342 * Initialisation function for the SSL random generator. Takes the contents
343 * of the screen as random seed.
345 * Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V.
348 * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>;
349 * the original copyright message is:
351 * (C) Copyright Microsoft Corp. 1993. All rights reserved.
353 * You have a royalty-free right to use, modify, reproduce and
354 * distribute the Sample Files (and/or any modified version) in
355 * any way you find useful, provided that you agree that
356 * Microsoft has no warranty obligations or liability for any
357 * Sample Application Files which are modified.
360 * I have modified the loading of bytes via RAND_seed() mechanism since
361 * the origional would have been very very CPU intensive since RAND_seed()
362 * does an MD5 per 16 bytes of input. The cost to digest 16 bytes is the same
363 * as that to digest 56 bytes. So under the old system, a screen of
364 * 1024*768*256 would have been CPU cost of approximatly 49,000 56 byte MD5
365 * digests or digesting 2.7 mbytes. What I have put in place would
366 * be 48 16k MD5 digests, or efectivly 48*16+48 MD5 bytes or 816 kbytes
367 * or about 3.5 times as much.
370 void RAND_screen(void)
372 HDC hScrDC; /* screen DC */
373 HDC hMemDC; /* memory DC */
374 HBITMAP hBitmap; /* handle for our bitmap */
375 HBITMAP hOldBitmap; /* handle for previous bitmap */
376 BITMAP bm; /* bitmap properties */
377 unsigned int size; /* size of bitmap */
378 char *bmbits; /* contents of bitmap */
379 int w; /* screen width */
380 int h; /* screen height */
381 int y; /* y-coordinate of screen lines to grab */
382 int n = 16; /* number of screen lines to grab at a time */
384 /* Create a screen DC and a memory DC compatible to screen DC */
385 hScrDC = CreateDC("DISPLAY", NULL, NULL, NULL);
386 hMemDC = CreateCompatibleDC(hScrDC);
388 /* Get screen resolution */
389 w = GetDeviceCaps(hScrDC, HORZRES);
390 h = GetDeviceCaps(hScrDC, VERTRES);
392 /* Create a bitmap compatible with the screen DC */
393 hBitmap = CreateCompatibleBitmap(hScrDC, w, n);
395 /* Select new bitmap into memory DC */
396 hOldBitmap = SelectObject(hMemDC, hBitmap);
398 /* Get bitmap properties */
399 GetObject(hBitmap, sizeof(BITMAP), (LPSTR)&bm);
400 size = (unsigned int)bm.bmWidthBytes * bm.bmHeight * bm.bmPlanes;
402 bmbits = Malloc(size);
404 /* Now go through the whole screen, repeatedly grabbing n lines */
405 for (y = 0; y < h-n; y += n)
407 unsigned char md[MD_DIGEST_LENGTH];
409 /* Bitblt screen DC to memory DC */
410 BitBlt(hMemDC, 0, 0, w, n, hScrDC, 0, y, SRCCOPY);
412 /* Copy bitmap bits from memory DC to bmbits */
413 GetBitmapBits(hBitmap, size, bmbits);
415 /* Get the MD5 of the bitmap */
418 /* Seed the random generator with the MD5 digest */
419 RAND_seed(md, MD_DIGEST_LENGTH);
425 /* Select old bitmap back into memory DC */
426 hBitmap = SelectObject(hMemDC, hOldBitmap);
429 DeleteObject(hBitmap);