Add a method to generate a prime that is guaranteed not to be divisible by 3 or 5.

[oweals/openssl.git] / crypto / bn / bn_gf2m.c

diff --git a/crypto/bn/bn_gf2m.c b/crypto/bn/bn_gf2m.c
index e54a701166a5f65e6aa535d80a58a9bdf17e21ef..b2222a06c93f868ce8b1da6f90e170c59cf997af 100644 (file)
--- a/crypto/bn/bn_gf2m.c
+++ b/crypto/bn/bn_gf2m.c
@@ -631,11 +631,11 @@ int BN_GF2m_mod_inv(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
                        }
                if (ubits==vbits)
                        {
-                       BN_ULONG u;
+                       BN_ULONG ul;
                        int utop = (ubits-1)/BN_BITS2;
 
-                       while ((u=udp[utop])==0 && utop) utop--;
-                       ubits = utop*BN_BITS2 + BN_num_bits_word(u);
+                       while ((ul=udp[utop])==0 && utop) utop--;
+                       ubits = utop*BN_BITS2 + BN_num_bits_word(ul);
                        }
                }
        bn_correct_top(b);