X-Git-Url: http://git.silcnet.org/gitweb/?a=blobdiff_plain;f=lib%2Fsilcmath%2Fsilcmath.h;h=966cd6d9f5ce0e5fca025283993e7ac2225c3de4;hb=9b499de7f8fdbb24c32b8a0a84bb2fbbcdab782a;hp=08a08c0c00d149e67a88b1c5bc652c7e9b601207;hpb=410642a14d4185abd75715cee3f5177cd55b1ceb;p=crypto.git

diff --git a/lib/silcmath/silcmath.h b/lib/silcmath/silcmath.h
index 08a08c0c..966cd6d9 100644
--- a/lib/silcmath/silcmath.h
+++ b/lib/silcmath/silcmath.h
@@ -4,7 +4,7 @@
 
   Author: Pekka Riikonen <priikone@silcnet.org>
 
-  Copyright (C) 1997 - 2005 Pekka Riikonen
+  Copyright (C) 1997 - 2008 Pekka Riikonen
 
   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
@@ -32,7 +32,7 @@
 
 #include "silcrng.h"
 
-/****f* silcmath/SilcMathAPI/silc_math_gen_prime
+/****f* silcmath/silc_math_gen_prime
  *
  * SYNOPSIS
  *
@@ -43,8 +43,7 @@
  *
  *    Find appropriate prime. It generates a number by taking random bytes.
  *    It then tests the number that it's not divisible by any of the small
- *    primes and then it performs Fermat's prime test. I thank Rieks Joosten
- *    (r.joosten@pijnenburg.nl) for such a good help with prime tests.
+ *    primes and then it performs Fermat's prime test.
  *
  *    If argument verbose is TRUE this will display some status information
  *    about the progress of generation.  If the `rng' is NULL then global
@@ -55,7 +54,7 @@
 SilcBool silc_math_gen_prime(SilcMPInt *prime, SilcUInt32 bits,
 			     SilcBool verbose, SilcRng rng);
 
-/****f* silcmath/SilcMathAPI/silc_math_prime_test
+/****f* silcmath/silc_math_prime_test
  *
  * SYNOPSIS
  *