Compute the inverse of b modulo an irreducible GF(2^m) polynomial given as an int array.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_inv_arr(
BIGNUM* r,
BIGNUM const* b,
int const p[],
BN_CTX* ctx);1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Result BIGNUM receiving (1 / b) mod p(x). |
| b | Value to invert (must be non-zero modulo p). |
| p | Irreducible polynomial as a descending list of set-bit indices terminated by -1. |
| ctx | BN_CTX scratch space. |