16 * 8 = 128.

[openssl.git] / crypto / rand / md_rand.c

diff --git a/crypto/rand/md_rand.c b/crypto/rand/md_rand.c
index 18b8e8d922830d7615148592e759487207e6ae73..be08e06658d17a256eb78b1e379f40538e2ffa0c 100644 (file)
--- a/crypto/rand/md_rand.c
+++ b/crypto/rand/md_rand.c
@@ -56,7 +56,7 @@
  * [including the GNU Public Licence.]
  */
 
-#define ENTROPY_NEEDED 32  /* require 128 bits of randomness */
+#define ENTROPY_NEEDED 16  /* require 128 bits of randomness */
 
 #ifndef MD_RAND_DEBUG
 # ifndef NDEBUG
@@ -186,9 +186,9 @@ static void ssleay_rand_add(const void *buf, int num, int add)
        /*
         * (Based on the rand(3) manpage)
         *
-        * The input is chopped up into units of 16 bytes (or less for
+        * The input is chopped up into units of 20 bytes (or less for
         * the last block).  Each of these blocks is run through the hash
-        * function as follow:  The data passed to the hash function
+        * function as follows:  The data passed to the hash function
         * is the current 'md', the same number of bytes from the 'state'
         * (the location determined by in incremented looping index) as
         * the current 'block', the new key data 'block', and 'count'
@@ -322,19 +322,22 @@ static int ssleay_rand_bytes(unsigned char *buf, int num)
 #endif
 
        /*
-        * (Based on doc/ssleay.txt, section rand.doc:)
+        * (Based on the rand(3) manpage:)
         *
-        * For each group of 8 bytes (or less), we do the following,
+        * For each group of 10 bytes (or less), we do the following:
         *
-        * Input into MD5, the top 8 bytes from 'md', the byte that are
-        * to be overwritten by the random bytes and bytes from the
+        * Input into the hash function the top 10 bytes from the
+        * local 'md' (which is initialized from the global 'md'
+        * before any bytes are generated), the bytes that are
+        * to be overwritten by the random bytes, and bytes from the
         * 'state' (incrementing looping index).  From this digest output
-        * (which is kept in 'md'), the top (upto) 8 bytes are
-        * returned to the caller and the bottom (upto) 8 bytes are xored
+        * (which is kept in 'md'), the top (up to) 10 bytes are
+        * returned to the caller and the bottom (up to) 10 bytes are xored
         * into the 'state'.
         * Finally, after we have finished 'num' random bytes for the
-        * caller, 'count' (which is incremented) and the local and globl 'md'
-        * are fed into MD5 and the results are kept in the global 'md'.
+        * caller, 'count' (which is incremented) and the local and global 'md'
+        * are fed into the hash function and the results are kept in the
+        * global 'md'.
         */
 
        CRYPTO_w_lock(CRYPTO_LOCK_RAND);
@@ -494,12 +497,12 @@ static int ssleay_rand_pseudo_bytes(unsigned char *buf, int num)
  */
 /*
  * I have modified the loading of bytes via RAND_seed() mechanism since
- * the origional would have been very very CPU intensive since RAND_seed()
+ * the original would have been very very CPU intensive since RAND_seed()
  * does an MD5 per 16 bytes of input.  The cost to digest 16 bytes is the same
  * as that to digest 56 bytes.  So under the old system, a screen of
- * 1024*768*256 would have been CPU cost of approximatly 49,000 56 byte MD5
+ * 1024*768*256 would have been CPU cost of approximately 49,000 56 byte MD5
  * digests or digesting 2.7 mbytes.  What I have put in place would
- * be 48 16k MD5 digests, or efectivly 48*16+48 MD5 bytes or 816 kbytes
+ * be 48 16k MD5 digests, or effectively 48*16+48 MD5 bytes or 816 kbytes
  * or about 3.5 times as much.
  * - eric 
  */