X-Git-Url: http://git.silcnet.org/gitweb/?a=blobdiff_plain;f=lib%2Fsilcmath%2Fsilcmath.h;h=c3e09b470c0c4ac696ff1c6b251fe9a8e50e1868;hb=e7b6c157b80152bf9fb9266e6bdd93f9fb0db776;hp=08a08c0c00d149e67a88b1c5bc652c7e9b601207;hpb=8fd8212bcd16f2b53fbedff2a9b9a4e8c15b9695;p=silc.git diff --git a/lib/silcmath/silcmath.h b/lib/silcmath/silcmath.h index 08a08c0c..c3e09b47 100644 --- a/lib/silcmath/silcmath.h +++ b/lib/silcmath/silcmath.h @@ -4,7 +4,7 @@ Author: Pekka Riikonen - Copyright (C) 1997 - 2005 Pekka Riikonen + Copyright (C) 1997 - 2007 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 @@ -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