Check in a branch with a major redesign on how entropy polling is performed.

Combine the fast and slow polls, into a single poll() operation.

Instead of being given a buffer to write output into, the EntropySource is
passed an Entropy_Accumulator. This handles the RLE encoding that xor_into_buf
used to do. It also contains a cached I/O buffer so entropy sources do not
individually need to allocate memory for that with each poll. When data
is added to the accumulator, the source specifies an estimate of the number
of bits of entropy per byte, as a double. This is tracked in the accumulator.
Once the estimated entropy hits a target (set by the constructor), the
accumulator's member function predicate polling_goal_achieved flips to true.
This signals to the PRNG that it can stop performing polling on sources,
also polls that take a long time periodically check this flag and return
immediately.

The Win32 and BeOS entropy sources have been updated, but blindly; testing
is needed.

The test_es example program has been modified: now it polls twice and outputs
the XOR of the two collected results. That helps show if the output is consistent
across polls (not a good thing). I have noticed on the Unix entropy source,
occasionally there are many 0x00 bytes in the output, which is not optimal.
This also needs to be investigated.

The RLE is not actually RLE anymore. It works well for non-random inputs
(ASCII text, etc), but I noticed that when /dev/random output was fed into
it, the output buffer would end up being RR01RR01RR01 where RR is a random
byte and 00 is the byte count.

The buffer sizing also needs to be examined carefully. It might be useful
to choose a prime number for the size to XOR stuff into, to help ensure an
even distribution of entropy across the entire buffer space. Or: feed it
all into a hash function?

This change should (perhaps with further modifications) help WRT the
concerns Zack W raised about the RNG on the monotone-dev list.

1 files changed, 23 insertions, 16 deletions

diff --git a/doc/examples/test_es.cpp b/doc/examples/test_es.cpp
index 18531b326..cae47a853 100644
--- a/doc/examples/test_es.cpp
+++ b/doc/examples/test_es.cpp
@@ -32,30 +32,36 @@
 
 using namespace Botan;
 
-void test_entropy_source(EntropySource* es)
+void test_entropy_source(EntropySource* es,
+                         EntropySource* es2 = 0)
    {
    // sometimes iostreams really is just a pain
 
-   // upper buffer size of 96 to match HMAC_RNG's
-   byte buf[96] = { 0 };
-
    printf("Polling '%s':\n", es->name().c_str());
 
-   printf("  Fast poll... ");
-   u32bit fast_poll_got = es->fast_poll(buf, sizeof(buf));
-   printf("got %d bytes: ", fast_poll_got);
-   for(u32bit i = 0; i != fast_poll_got; ++i)
-      printf("%02X", buf[i]);
-   printf("\n");
+   Entropy_Accumulator accum1(256);
+   es->poll(accum1);
+
+   Entropy_Accumulator accum2(256);
+   if(es2)
+      es2->poll(accum2);
+   else
+      es->poll(accum2);
+
+   SecureVector<byte> polled1 = accum1.get_entropy_buffer();
+   SecureVector<byte> polled2 = accum2.get_entropy_buffer();
+
+   SecureVector<byte> compare(std::min(polled1.size(), polled2.size()));
+
+   for(u32bit i = 0; i != compare.size(); ++i)
+      compare[i] = polled1[i] ^ polled2[i];
 
-   printf("  Slow poll... ");
-   u32bit slow_poll_got = es->slow_poll(buf, sizeof(buf));
-   printf("got %d bytes: ", slow_poll_got);
-   for(u32bit i = 0; i != slow_poll_got; ++i)
-      printf("%02X", buf[i]);
+   for(u32bit i = 0; i != compare.size(); ++i)
+      printf("%02X", compare[i]);
    printf("\n");
 
    delete es;
+   delete es2;
    }
 
 int main()
@@ -81,7 +87,8 @@ int main()
 #endif
 
 #if defined(BOTAN_HAS_ENTROPY_SRC_FTW)
-   test_entropy_source(new FTW_EntropySource("/proc"));
+   test_entropy_source(new FTW_EntropySource("/proc"),
+                       new FTW_EntropySource("/proc"));
 #endif