[#BN_GF2m_mod]
= BN&lowbar;GF2m&lowbar;mod
:mrdocs:

Reduce `a` modulo irreducible polynomial `p` in GF(2&circ;m)&colon; r &equals; a mod p&period;

== Synopsis

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

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

== Return Value

1 on success, or 0 on error&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination residue&period;
| *a*
| Polynomial to reduce&period;
| *p*
| Irreducible modulus polynomial&period;
|===


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