Allow for higher granularity of entropy estimates by using 'double'

[thirdparty/openssl.git] / CHANGES

diff --git a/CHANGES b/CHANGES
index 74253ca4e3b104580b97fe23a07dbbad4ad67074..7641ec98ebaf00c9fd292d902f920a31c9a333e9 100644 (file)
--- a/CHANGES
+++ b/CHANGES
@@ -231,7 +231,9 @@
      has a return value which indicates the quality of the random data
      (1 = ok, 0 = not seeded).  Also an error is recorded on the thread's
      error queue. New function RAND_pseudo_bytes() generates output that is
-     guaranteed to be unique but not unpredictable.
+     guaranteed to be unique but not unpredictable. RAND_add is like
+     RAND_seed, but takes an extra argument for an entropy estimate
+     (RAND_seed always assumes full entropy).
      [Ulf Möller]
 
   *) Do more iterations of Rabin-Miller probable prime test (specifically,