[#BN_GF2m_mod_arr]
= BN_GF2m_mod_arr
:mrdocs:

Reduce `a` modulo an irreducible GF(2ˆm) polynomial given as an int array: r = a mod p.

== Synopsis

Declared in `<openssl/bn.h>`

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

== Return Value

1 on success, or 0 on error.

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination.
| *a*
| Value to reduce.
| *p*
| Descending exponent list of the irreducible, terminated by ‐1 (and ending in 0).
|===


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