The unified diff between revisions [51f9ee51..] and [cbf9e103..] is displayed below. It can also be downloaded as a raw diff.

This diff has been restricted to the following files: 'src/dsa_gen.cpp'

#
#
# patch "src/dsa_gen.cpp"
#  from [00d226503a5125dc91efda28bb31dc2b270f6f43]
#    to [1f560b9c58461ea5dc96d1e92d45bb6b3e05f822]
#
============================================================
--- src/dsa_gen.cpp	00d226503a5125dc91efda28bb31dc2b270f6f43
+++ src/dsa_gen.cpp	1f560b9c58461ea5dc96d1e92d45bb6b3e05f822
@@ -5,10 +5,9 @@

 #include <botan/dl_group.h>
 #include <botan/numthry.h>
-#include <botan/libstate.h>
 #include <botan/lookup.h>
 #include <botan/parsing.h>
-#include <botan/rng.h>
+#include <botan/libstate.h>
 #include <algorithm>
 #include <memory>

@@ -84,8 +83,6 @@ bool DL_Group::generate_dsa_primes(BigIn
    if(!is_prime(q))
       return false;

-   global_state().pulse(PRIME_FOUND);
-
    const u32bit n = (pbits-1) / (HASH_SIZE * 8),
                 b = (pbits-1) % (HASH_SIZE * 8);

@@ -94,8 +91,6 @@ bool DL_Group::generate_dsa_primes(BigIn

    for(u32bit j = 0; j != 4096; ++j)
       {
-      global_state().pulse(PRIME_SEARCHING);
-
       for(u32bit k = 0; k <= n; ++k)
          {
          ++seed;
@@ -110,10 +105,7 @@ bool DL_Group::generate_dsa_primes(BigIn
       p = X - (X % (2*q) - 1);

       if(p.bits() == pbits && is_prime(p))
-         {
-         global_state().pulse(PRIME_FOUND);
          return true;
-         }
       }
    return false;
    }
@@ -128,8 +120,7 @@ SecureVector<byte> DL_Group::generate_ds

    while(true)
       {
-      Global_RNG::randomize(seed, seed.size());
-      global_state().pulse(PRIME_SEARCHING);
+      global_state().randomize(seed, seed.size());

       if(generate_dsa_primes(p, q, pbits, qbits, seed))
          return seed;