BN_GF2m_mod_solve_quad_arr

Solve the quadratic r^2 + r = a mod p over GF(2^m) with the modulus given as an int array.

Synopsis

Declared in <openssl/bn.h>

int
BN_GF2m_mod_solve_quad_arr(
    BIGNUM* r,
    BIGNUM const* a,
    int const p[],
    BN_CTX* ctx);

Return Value

1 on success, or 0 if no solution / on error.

Parameters

NameDescription
rDestination for one solution when it exists.
aRight-hand side.
pDescending exponent list of the irreducible, terminated by -1.
ctxBN_CTX scratch space.