Lines Matching refs:field
30 group->field = BN_new();
34 if (group->field == NULL || group->a == NULL || group->b == NULL) {
35 BN_free(group->field);
49 BN_free(group->field);
60 BN_clear_free(group->field);
77 if (!BN_copy(dest->field, src->field))
107 /* group->field */
108 if (!BN_copy(group->field, p))
110 i = BN_GF2m_poly2arr(group->field, group->poly, 6) - 1;
147 if (!BN_copy(p, group->field))
168 * Gets the degree of the field. For a curve over GF(2^m) this is the value
173 return BN_num_bits(group->field) - 1;
694 /* Wrapper to simple binary polynomial field multiplication implementation. */
701 /* Wrapper to simple binary polynomial field squaring implementation. */
708 /* Wrapper to simple binary polynomial field division implementation. */
712 return BN_GF2m_mod_div(r, a, b, group->field, ctx);
732 if (!BN_priv_rand_ex(s->Z, BN_num_bits(group->field) - 1,
747 if (!BN_priv_rand_ex(r->Y, BN_num_bits(group->field) - 1,
856 /* GF(2^m) field elements should always have BIGNUM::neg = 0 */
934 if (!(ret = BN_GF2m_mod_inv(r, a, group->field, ctx)))