Compute r = (a << 1) mod m, assuming 0 <= a < m.

Synopsis

Declared in <openssl/bn.h>

int
BN_mod_lshift1_quick(
    BIGNUM* r,
    BIGNUM const* a,
    BIGNUM const* m);

Return Value

1 on success, or 0 on failure.

Parameters

Name

Description

r

Destination for the result (may alias a).

a

Value to double then reduce; must already be reduced modulo m.

m

Modulus; must be positive.

Created with MrDocs