Solve the quadratic r^2 + r = a mod p over GF(2^m).
Declared in <openssl/bn.h>
int
BN_GF2m_mod_solve_quad(
BIGNUM* r,
BIGNUM const* a,
BIGNUM const* p,
BN_CTX* ctx);1 on success, or 0 if no solution / on error.
| Name | Description |
|---|---|
| r | Destination for one solution when it exists. |
| a | Right-hand side. |
| p | Irreducible modulus polynomial. |
| ctx | BN_CTX scratch space. |