Compute r = (a / b) mod p for binary polynomial-field (GF(2^m)) values.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_div(
BIGNUM* r,
BIGNUM const* a,
BIGNUM const* b,
BIGNUM const* p,
BN_CTX* ctx);
1 on success, or 0 on failure.
| Name | Description |
|---|---|
| r | Result BIGNUM. |
| a | Dividend. |
| b | Divisor (must be invertible modulo p). |
| p | Irreducible reduction polynomial. |
| ctx | BN_CTX for temporaries. |