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.]
61 #include <sys/types.h>
64 #if !defined(USE_MD5_RAND) && !defined(USE_SHA1_RAND) && !defined(USE_MDC2_RAND) && !defined(USE_MD2_RAND)
67 #elif !defined(NO_SHA1)
69 #elif !defined(NO_MDC2)
71 #elif !defined(NO_MD2)
74 We need a message digest of some type
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
84 #if defined(USE_MD5_RAND)
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)
91 #define MD(a,b,c) MD5(a,b,c)
92 #elif defined(USE_SHA1_RAND)
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)
99 #define MD(a,b,c) SHA1(a,b,c)
100 #elif defined(USE_MDC2_RAND)
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)
107 #define MD(a,b,c) MDC2(a,b,c)
108 #elif defined(USE_MD2_RAND)
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)
115 #define MD(a,b,c) MD2(a,b,c)
120 /* #define NORAND 1 */
121 /* #define PREDICT 1 */
123 #define STATE_SIZE 1023
124 static int state_num
=0,state_index
=0;
125 static unsigned char state
[STATE_SIZE
+MD_DIGEST_LENGTH
];
126 static unsigned char md
[MD_DIGEST_LENGTH
];
127 static long md_count
[2]={0,0};
129 char *RAND_version
="RAND part of SSLeay 0.9.1a 06-Jul-1998";
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
);
135 RAND_METHOD rand_ssleay
={
141 RAND_METHOD
*RAND_SSLeay()
143 return(&rand_ssleay
);
146 static void ssleay_rand_cleanup()
148 memset(state
,0,sizeof(state
));
151 memset(md
,0,MD_DIGEST_LENGTH
);
156 static void ssleay_rand_seed(buf
,num
)
160 int i
,j
,k
,st_idx
,st_num
;
167 CRYPTO_w_lock(CRYPTO_LOCK_RAND
);
171 state_index
=(state_index
+num
);
172 if (state_index
>= STATE_SIZE
)
174 state_index
%=STATE_SIZE
;
175 state_num
=STATE_SIZE
;
177 else if (state_num
< STATE_SIZE
)
179 if (state_index
> state_num
)
180 state_num
=state_index
;
182 CRYPTO_w_unlock(CRYPTO_LOCK_RAND
);
184 for (i
=0; i
<num
; i
+=MD_DIGEST_LENGTH
)
187 j
=(j
> MD_DIGEST_LENGTH
)?MD_DIGEST_LENGTH
:j
;
190 MD_Update(&m
,md
,MD_DIGEST_LENGTH
);
191 k
=(st_idx
+j
)-STATE_SIZE
;
194 MD_Update(&m
,&(state
[st_idx
]),j
-k
);
195 MD_Update(&m
,&(state
[0]),k
);
198 MD_Update(&m
,&(state
[st_idx
]),j
);
201 MD_Update(&m
,(unsigned char *)&(md_count
[0]),sizeof(md_count
));
209 state
[st_idx
++]^=md
[k
];
210 if (st_idx
>= STATE_SIZE
)
217 memset((char *)&m
,0,sizeof(m
));
220 static void ssleay_rand_bytes(buf
,num
)
224 int i
,j
,k
,st_num
,st_idx
;
234 static unsigned char val
=0;
236 for (i
=0; i
<num
; i
++)
242 CRYPTO_w_lock(CRYPTO_LOCK_RAND
);
247 CRYPTO_w_unlock(CRYPTO_LOCK_RAND
);
248 /* put in some default random data, we need more than
250 RAND_seed((unsigned char *)&m
,sizeof(m
));
253 RAND_seed((unsigned char *)&l
,sizeof(l
));
255 RAND_seed((unsigned char *)&l
,sizeof(l
));
258 RAND_seed((unsigned char *)&l
,sizeof(l
));
260 /* #ifdef DEVRANDOM */
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
268 if ((fh
= fopen(DEVRANDOM
, "r")) != NULL
)
270 unsigned char tmpbuf
[32];
272 fread((unsigned char *)tmpbuf
,1,32,fh
);
273 /* we don't care how many bytes we read,
274 * we will just copy the 'stack' if there is
275 * nothing else :-) */
277 RAND_seed(tmpbuf
,32);
282 memset(state
,0,STATE_SIZE
);
283 memset(md
,0,MD_DIGEST_LENGTH
);
285 CRYPTO_w_lock(CRYPTO_LOCK_RAND
);
291 if (state_index
> state_num
)
292 state_index
=(state_index
%state_num
);
294 CRYPTO_w_unlock(CRYPTO_LOCK_RAND
);
298 j
=(num
>= MD_DIGEST_LENGTH
/2)?MD_DIGEST_LENGTH
/2:num
;
301 MD_Update(&m
,&(md
[MD_DIGEST_LENGTH
/2]),MD_DIGEST_LENGTH
/2);
302 MD_Update(&m
,(unsigned char *)&(md_count
[0]),sizeof(md_count
));
304 MD_Update(&m
,buf
,j
); /* purify complains */
309 MD_Update(&m
,&(state
[st_idx
]),j
-k
);
310 MD_Update(&m
,&(state
[0]),k
);
313 MD_Update(&m
,&(state
[st_idx
]),j
);
318 if (st_idx
>= st_num
)
320 state
[st_idx
++]^=md
[i
];
321 *(buf
++)=md
[i
+MD_DIGEST_LENGTH
/2];
326 MD_Update(&m
,(unsigned char *)&(md_count
[0]),sizeof(md_count
));
328 MD_Update(&m
,md
,MD_DIGEST_LENGTH
);
330 memset(&m
,0,sizeof(m
));
337 /*****************************************************************************
338 * Initialisation function for the SSL random generator. Takes the contents
339 * of the screen as random seed.
341 * Created 960901 by Gertjan van Oosten, gertjan@West.NL, West Consulting B.V.
344 * <URL:http://www.microsoft.com/kb/developr/win_dk/q97193.htm>;
345 * the original copyright message is:
347 // (C) Copyright Microsoft Corp. 1993. All rights reserved.
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.
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.
366 void RAND_screen(void)
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 */
380 /* Create a screen DC and a memory DC compatible to screen DC */
381 hScrDC
= CreateDC("DISPLAY", NULL
, NULL
, NULL
);
382 hMemDC
= CreateCompatibleDC(hScrDC
);
384 /* Get screen resolution */
385 w
= GetDeviceCaps(hScrDC
, HORZRES
);
386 h
= GetDeviceCaps(hScrDC
, VERTRES
);
388 /* Create a bitmap compatible with the screen DC */
389 hBitmap
= CreateCompatibleBitmap(hScrDC
, w
, n
);
391 /* Select new bitmap into memory DC */
392 hOldBitmap
= SelectObject(hMemDC
, hBitmap
);
394 /* Get bitmap properties */
395 GetObject(hBitmap
, sizeof(BITMAP
), (LPSTR
)&bm
);
396 size
= (unsigned int)bm
.bmWidthBytes
* bm
.bmHeight
* bm
.bmPlanes
;
398 bmbits
= Malloc(size
);
400 /* Now go through the whole screen, repeatedly grabbing n lines */
401 for (y
= 0; y
< h
-n
; y
+= n
)
403 unsigned char md
[MD_DIGEST_LENGTH
];
405 /* Bitblt screen DC to memory DC */
406 BitBlt(hMemDC
, 0, 0, w
, n
, hScrDC
, 0, y
, SRCCOPY
);
408 /* Copy bitmap bits from memory DC to bmbits */
409 GetBitmapBits(hBitmap
, size
, bmbits
);
411 /* Get the MD5 of the bitmap */
414 /* Seed the random generator with the MD5 digest */
415 RAND_seed(md
, MD_DIGEST_LENGTH
);
421 /* Select old bitmap back into memory DC */
422 hBitmap
= SelectObject(hMemDC
, hOldBitmap
);
425 DeleteObject(hBitmap
);