Compute r = (a / b) in GF(2^m) with reduction polynomial p[].
Declared in <openssl/bn.h>
int
BN_GF2m_mod_div_arr(
BIGNUM* r,
BIGNUM const* a,
BIGNUM const* b,
int const p[],
BN_CTX* ctx);
1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Destination quotient. |
| a | Dividend. |
| b | Divisor (must be nonzero in the field). |
| p | Irreducible polynomial as a descending exponent array terminated by -1. |
| ctx | BN_CTX scratch space. |