diff options
author | Christian Grothoff <christian@grothoff.org> | 2010-10-08 15:48:01 +0000 |
---|---|---|
committer | Christian Grothoff <christian@grothoff.org> | 2010-10-08 15:48:01 +0000 |
commit | 9b2054a6caa48e24c98e42436e53b1d091c6e7bc (patch) | |
tree | cc0799be4f98bad634bf167c2becb3b8792c454d /src/util/crypto_ksk.c | |
parent | ce0a92249ea2fddfb223051c5f8f94700024fcda (diff) | |
download | gnunet-9b2054a6caa48e24c98e42436e53b1d091c6e7bc.tar.gz gnunet-9b2054a6caa48e24c98e42436e53b1d091c6e7bc.zip |
fix
Diffstat (limited to 'src/util/crypto_ksk.c')
-rw-r--r-- | src/util/crypto_ksk.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/util/crypto_ksk.c b/src/util/crypto_ksk.c index 7600c5600..8fe75f372 100644 --- a/src/util/crypto_ksk.c +++ b/src/util/crypto_ksk.c | |||
@@ -321,7 +321,7 @@ gen_prime (gcry_mpi_t *ptest, unsigned int nbits, GNUNET_HashCode * hc) | |||
321 | /* Calculate all remainders. */ | 321 | /* Calculate all remainders. */ |
322 | tmp = gcry_mpi_new (0); | 322 | tmp = gcry_mpi_new (0); |
323 | sp = gcry_mpi_new (0); | 323 | sp = gcry_mpi_new (0); |
324 | for (i = 0; i <= no_of_small_prime_numbers; i++) | 324 | for (i = 0; i < no_of_small_prime_numbers; i++) |
325 | { | 325 | { |
326 | size_t written; | 326 | size_t written; |
327 | 327 | ||
@@ -337,7 +337,7 @@ gen_prime (gcry_mpi_t *ptest, unsigned int nbits, GNUNET_HashCode * hc) | |||
337 | for (step = 0; step < 20000; step += 2) | 337 | for (step = 0; step < 20000; step += 2) |
338 | { | 338 | { |
339 | /* Check against all the small primes we have in mods. */ | 339 | /* Check against all the small primes we have in mods. */ |
340 | for (i = 0; i <= no_of_small_prime_numbers; i++) | 340 | for (i = 0; i < no_of_small_prime_numbers; i++) |
341 | { | 341 | { |
342 | uint16_t x = small_prime_numbers[i]; | 342 | uint16_t x = small_prime_numbers[i]; |
343 | while (mods[i] + step >= x) | 343 | while (mods[i] + step >= x) |
@@ -345,7 +345,7 @@ gen_prime (gcry_mpi_t *ptest, unsigned int nbits, GNUNET_HashCode * hc) | |||
345 | if (!(mods[i] + step)) | 345 | if (!(mods[i] + step)) |
346 | break; | 346 | break; |
347 | } | 347 | } |
348 | if (i <= no_of_small_prime_numbers) | 348 | if (i < no_of_small_prime_numbers) |
349 | continue; /* Found a multiple of an already known prime. */ | 349 | continue; /* Found a multiple of an already known prime. */ |
350 | 350 | ||
351 | gcry_mpi_add_ui (*ptest, prime, step); | 351 | gcry_mpi_add_ui (*ptest, prime, step); |