Square then reduce in GF(2^m) with the modulus given as an int array: r = (a * a) mod p.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_sqr_arr(
BIGNUM* r,
BIGNUM const* a,
int const p[],
BN_CTX* ctx);1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Destination square. |
| a | Value to square. |
| p | Descending exponent list of the irreducible, terminated by -1. |
| ctx | BN_CTX scratch space. |