BN_GF2m_mod_mul_arr

Multiply then reduce in GF(2^m) with the modulus given as an int array: r = (a * b) mod p.

Synopsis

Declared in <openssl/bn.h>

int
BN_GF2m_mod_mul_arr(
    BIGNUM* r,
    BIGNUM const* a,
    BIGNUM const* b,
    int const p[],
    BN_CTX* ctx);

Return Value

1 on success, or 0 on error.

Parameters

NameDescription
rDestination product.
aFirst multiplicand.
bSecond multiplicand.
pDescending exponent list of the irreducible, terminated by -1.
ctxBN_CTX scratch space.