Square then reduce in GF(2^m): r = (a * a) mod p.
Declared in <openssl/bn.h>
int
BN_GF2m_mod_sqr(
BIGNUM* r,
BIGNUM const* a,
BIGNUM const* p,
BN_CTX* ctx);1 on success, or 0 on error.
| Name | Description |
|---|---|
| r | Destination square. |
| a | Value to square. |
| p | Irreducible modulus polynomial. |
| ctx | BN_CTX scratch space. |