Lines Matching defs:words
74 BN_ULONG words[EC_MAX_SCALAR_WORDS];
83 BN_ULONG carry = bn_add_words(r->words, a->words, b->words, order->top);
85 BN_ULONG v = bn_sub_words(tmp.words, r->words, order->d, order->top) - carry;
90 r->words[i] = constant_time_select_w(v, r->words[i], tmp.words[i]);
97 return bn_mod_mul_montgomery_small(r->words, order->top, a->words, order->top,
98 b->words, order->top, group->order_mont);
108 return bn_mod_mul_montgomery_small(r->words, order->top, a->words, order->top,
109 b->words, order->top, group->order_mont);
132 out->words[i] =
133 (out->words[i] >> shift) | (out->words[i + 1] << (BN_BITS2 - shift));
135 out->words[order->top - 1] >>= shift;
255 // TODO(davidben): Add a words version of |BN_mod_inverse_odd| and write
258 !bn_to_montgomery_small(s_inv_mont.words, order->top, s_inv_mont.words,
346 SHA512_Update(&sha, priv_key->words, order->top * sizeof(BN_ULONG));
356 if (!bn_to_montgomery_small(out_kinv_mont->words, order->top, k.words,
358 !bn_mod_inverse_prime_mont_small(out_kinv_mont->words, order->top,
359 out_kinv_mont->words, order->top,
429 !bn_to_montgomery_small(r_mont.words, order->top, r_mont.words,
441 !bn_set_words(ret->s, s.words, order->top)) {