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

Name

Description

r

Destination product.

a

First multiplicand.

b

Second multiplicand.

p

Descending exponent list of the irreducible, terminated by ‐1.

ctx

BN_CTX scratch space.

Created with MrDocs