Merged silc_1_0_branch to trunk.

[silc.git] / lib / silcmath / silcmath.h

diff --git a/lib/silcmath/silcmath.h b/lib/silcmath/silcmath.h
index d9233d30690fd1deae81f2acd0ab4db2b438ae3e..e1bb9945aaaa5e5334653f470258727204d14a0a 100644 (file)
--- a/lib/silcmath/silcmath.h
+++ b/lib/silcmath/silcmath.h
@@ -8,8 +8,7 @@
  
   This program is free software; you can redistribute it and/or modify
   it under the terms of the GNU General Public License as published by
-  the Free Software Foundation; either version 2 of the License, or
-  (at your option) any later version.
+  the Free Software Foundation; version 2 of the License.
  
   This program is distributed in the hope that it will be useful,
   but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -31,11 +30,14 @@
 #ifndef SILCMATH_H
 #define SILCMATH_H
 
+#include "silcrng.h"
+
 /****f* silcmath/SilcMathAPI/silc_math_gen_prime
  *
  * SYNOPSIS
  *
- *    int silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits, bool verbose);
+ *    int silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits, bool verbose,
+ *                            SilcRng);
  *
  * DESCRIPTION
  *
@@ -45,10 +47,13 @@
  *    (r.joosten@pijnenburg.nl) for such a good help with prime tests. 
  *
  *    If argument verbose is TRUE this will display some status information
- *    about the progress of generation.
+ *    about the progress of generation.  If the `rng' is NULL then global
+ *    RNG is used, if non-NULL then `rng' is used to generate the random
+ *    number number.
  *
  ***/
-bool silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits, bool verbose);
+bool silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits, bool verbose,
+                        SilcRng rng);
 
 /****f* silcmath/SilcMathAPI/silc_math_prime_test
  *