Compute modular exponentiation with a simple sliding‐window algorithm: r = (a ˆ p) mod m.

Synopsis

Declared in <openssl/bn.h>

int
BN_mod_exp_simple(
    BIGNUM* r,
    BIGNUM const* a,
    BIGNUM const* p,
    BIGNUM const* m,
    BN_CTX* ctx);

Return Value

1 on success, or 0 on error.

Parameters

Name

Description

r

Destination for the result.

a

Base.

p

Exponent.

m

Modulus.

ctx

BN_CTX scratch space.

Created with MrDocs