generic-library/openssl
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Refactor the first prime index.

Browse Source
This commit is contained in:
Felix Laurie von Massenbach 2014-05-27 13:23:21 +01:00 committed by Ben Laurie
parent 982c42cb20
commit c74e148776
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
crypto/bn/bn_prime.c
View File

@ -172,6 +172,7 @@ static int prime_offsets[480] = {
2297, 2309, 2311 }; 2297, 2309, 2311 };
static int prime_offset_count = 480; static int prime_offset_count = 480;
static int prime_multiplier = 2310; static int prime_multiplier = 2310;
static int first_prime_index = 5;
int BN_GENCB_call(BN_GENCB *cb, int a, int b) int BN_GENCB_call(BN_GENCB *cb, int a, int b)
{ {
@ -420,7 +421,6 @@ loop:
/* check that rnd is a prime */ /* check that rnd is a prime */
if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1)
{ {
/*if (!BN_add(rnd, rnd, add)) goto err;*/
goto loop; goto loop;
} }
} }
@ -456,8 +456,8 @@ loop:
/* we now have a random number 'rand' to test. */ /* we now have a random number 'rand' to test. */
/* skip primes 2, 3, 5, 7, 11 */ /* skip coprimes */
for (i = 5; i < NUMPRIMES; i++) for (i = first_prime_index; i < NUMPRIMES; i++)
{ {
/* check that rnd is a prime */ /* check that rnd is a prime */
if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1) if (BN_mod_word(rnd, (BN_ULONG)primes[i]) <= 1)