Reduce a modulo irreducible polynomial p in GF(2^m): r = a mod p.
a
p
Declared in <openssl/bn.h>
<openssl/bn.h>
int BN_GF2m_mod( BIGNUM* r, BIGNUM const* a, BIGNUM const* p);
1 on success, or 0 on error.