Compute modular exponentiation using Montgomery reduction: r = (a ˆ p) mod m.

Synopsis

Declared in <openssl/bn.h>

int
BN_mod_exp_mont(
    BIGNUM* r,
    BIGNUM const* a,
    BIGNUM const* p,
    BIGNUM const* m,
    BN_CTX* ctx,
    BN_MONT_CTX* m_ctx);

Return Value

1 on success, or 0 on error.

Parameters

Name

Description

r

Destination for the result.

a

Base.

p

Exponent.

m

Modulus (must be odd).

ctx

BN_CTX scratch space.

m_ctx

Montgomery context for m, or NULL to build one temporarily.

Created with MrDocs