[#BN_GF2m_mod_solve_quad_arr]
= BN&lowbar;GF2m&lowbar;mod&lowbar;solve&lowbar;quad&lowbar;arr
:mrdocs:

Solve the quadratic r&circ;2 &plus; r &equals; a mod p over GF(2&circ;m) with the modulus 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;solve&lowbar;quad&lowbar;arr(
    xref:BIGNUM.adoc[BIGNUM]* r,
    xref:BIGNUM.adoc[BIGNUM] const* a,
    int const p[],
    xref:BN_CTX.adoc[BN&lowbar;CTX]* ctx);
----

== Return Value

1 on success, or 0 if no solution &sol; on error&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *r*
| Destination for one solution when it exists&period;
| *a*
| Right&hyphen;hand side&period;
| *p*
| Descending exponent list of the irreducible, terminated by &hyphen;1&period;
| *ctx*
| BN&lowbar;CTX scratch space&period;
|===


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