bn_get_top
q_words = bn_get_top(dsa->params.q);
fixed_words = bn_get_top(order) + 2;
fixed_top = bn_get_top(order) + 2;
group_top = bn_get_top(cardinality);
group_top = bn_get_top(group->field);
for (i = 0; i < bn_get_top(scalar) * BN_BYTES; i += BN_BYTES) {
if (bn_get_top(z) == (P256_LIMBS - P256_LIMBS / 8)) {
for (j = 0; j < bn_get_top(scalars[i]) * BN_BYTES; j += BN_BYTES) {
return (bn_get_top(generator->X) == P256_LIMBS) && (bn_get_top(generator->Y) == P256_LIMBS) && is_equal(bn_get_words(generator->X), def_xG) && is_equal(bn_get_words(generator->Y), def_yG) && is_one(generator->Z);
return (bn_get_top(generator->X) == P256_LIMBS)
&& (bn_get_top(generator->Y) == P256_LIMBS)
int bn_get_top(const BIGNUM *a);