Compute the multiplicative inverse in GF(2^m): r = (1 / b) mod p.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_inv(
BIGNUM* r,
BIGNUM const* b,
BIGNUM const* p,
BN_CTX* ctx);1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Destination inverse. |
| b | Value to invert (must be non-zero modulo p). |
| p | Irreducible modulus polynomial. |
| ctx | BN_CTX scratch space. |