Reduce a modulo an irreducible GF(2^m) polynomial given as an int array: r = a mod p.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_arr(
BIGNUM* r,
BIGNUM const* a,
int const p[]);
1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Destination. |
| a | Value to reduce. |
| p | Descending exponent list of the irreducible, terminated by -1 (and ending in 0). |