[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[GNUnet-SVN] r13237 - gnunet/src/util
From: |
gnunet |
Subject: |
[GNUnet-SVN] r13237 - gnunet/src/util |
Date: |
Fri, 8 Oct 2010 17:47:24 +0200 |
Author: grothoff
Date: 2010-10-08 17:47:24 +0200 (Fri, 08 Oct 2010)
New Revision: 13237
Modified:
gnunet/src/util/crypto_ksk.c
Log:
fix
Modified: gnunet/src/util/crypto_ksk.c
===================================================================
--- gnunet/src/util/crypto_ksk.c 2010-10-08 15:46:17 UTC (rev 13236)
+++ gnunet/src/util/crypto_ksk.c 2010-10-08 15:47:24 UTC (rev 13237)
@@ -321,7 +321,7 @@
/* Calculate all remainders. */
tmp = gcry_mpi_new (0);
sp = gcry_mpi_new (0);
- for (i = 0; i <= no_of_small_primer_numbers; i++)
+ for (i = 0; i <= no_of_small_prime_numbers; i++)
{
size_t written;
@@ -337,14 +337,15 @@
for (step = 0; step < 20000; step += 2)
{
/* Check against all the small primes we have in mods. */
- for (i = 0; (x = small_prime_numbers[i]); i++)
+ for (i = 0; i <= no_of_small_prime_numbers; i++)
{
+ uint16_t x = small_prime_numbers[i];
while (mods[i] + step >= x)
mods[i] -= x;
if (!(mods[i] + step))
break;
}
- if (x)
+ if (i <= no_of_small_prime_numbers)
continue; /* Found a multiple of an already known prime.
*/
gcry_mpi_add_ui (*ptest, prime, step);
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [GNUnet-SVN] r13237 - gnunet/src/util,
gnunet <=