[#BN_GF2m_mod_inv_arr]
= BN&lowbar;GF2m&lowbar;mod&lowbar;inv&lowbar;arr
:mrdocs:

Compute the inverse of `b` modulo an irreducible GF(2&circ;m) polynomial given as an int array&period;

== Synopsis

Declared in `&lt;openssl&sol;bn&period;h&gt;`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
int
BN&lowbar;GF2m&lowbar;mod&lowbar;inv&lowbar;arr(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* b,
    int const p[],
    xref:BN_CTX.adoc[BN&lowbar;CTX]* ctx);
----

== Return Value

1 on success, or 0 on error&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Result BIGNUM receiving (1 &sol; b) mod p(x)&period;
| *b*
| Value to invert (must be non&hyphen;zero modulo `p)&period;`
| *p*
| Irreducible polynomial as a descending list of set&hyphen;bit indices terminated by &hyphen;1&period;
| *ctx*
| BN&lowbar;CTX scratch space&period;
|===


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