[#BN_GF2m_mod_inv_arr]
= BN_GF2m_mod_inv_arr
:mrdocs:

Compute the inverse of `b` modulo an irreducible GF(2ˆm) polynomial given as an int array.

== Synopsis

Declared in `<openssl/bn.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
BN_GF2m_mod_inv_arr(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* b,
    int 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*
| Result BIGNUM receiving (1 / b) mod p(x).
| *b*
| Value to invert (must be non‐zero modulo `p).`
| *p*
| Irreducible polynomial as a descending list of set‐bit indices terminated by ‐1.
| *ctx*
| BN_CTX scratch space.
|===


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