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
*/
-/****h* silcmath/SilcMathAPI
+/****h* silcmath/SILC Math Interface
*
* DESCRIPTION
*
#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
*
* (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
*