[#BN_GF2m_mod_mul]
= BN_GF2m_mod_mul
:mrdocs:

Multiply then reduce in GF(2ˆm): r = (a * b) mod p.

== Synopsis

Declared in `<openssl/bn.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
BN_GF2m_mod_mul(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* a,
    xref:BIGNUM.adoc[BIGNUM] const* b,
    xref:BIGNUM.adoc[BIGNUM] const* p,
    xref:BN_CTX.adoc[BN_CTX]* ctx);
----

== Return Value

1 on success, or 0 on error.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination product.
| *a*
| First multiplicand.
| *b*
| Second multiplicand.
| *p*
| Irreducible modulus polynomial.
| *ctx*
| BN_CTX scratch space.
|===


[.small]#Created with https://www.mrdocs.com[MrDocs]#