5 * Montgomery Modular Arithmetic Functions.
\r
7 * Copyright (C) Lenka Fibikova 2000
\r
12 #ifndef HEADER_MONT2_H
\r
13 #define HEADER_MONT2_H
\r
19 typedef struct bn_mont_st{
\r
23 BN_ULONG p_inv_b_neg; /* p' = p^{-1} mod b; b = 2^BN_BITS */
\r
26 #define BN_from_mont(x, mont, ctx) (BN_mont_red((x), (mont), (ctx)))
\r
29 BN_MONTGOMERY *BN_mont_new();
\r
30 int BN_to_mont(BIGNUM *x, BN_MONTGOMERY *mont, BN_CTX *ctx);
\r
31 void BN_mont_clear_free(BN_MONTGOMERY *mont);
\r
32 int BN_mont_set(BIGNUM *p, BN_MONTGOMERY *mont, BN_CTX *ctx);
\r
33 int BN_mont_red(BIGNUM *y, BN_MONTGOMERY *mont, BN_CTX *ctx);
\r
34 BN_ULONG BN_mont_inv(BIGNUM *x, int e, BN_CTX *ctx);
\r
35 int BN_mont_mod_mul(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_MONTGOMERY *mont, BN_CTX *ctx);
\r
36 int BN_mont_mod_add(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_MONTGOMERY *mont);
\r
37 int BN_mont_mod_sub(BIGNUM *r, BIGNUM *x, BIGNUM *y, BN_MONTGOMERY *mont);
\r
38 int BN_mont_mod_lshift1(BIGNUM *r, BIGNUM *x, BN_MONTGOMERY *mont);
\r
39 int BN_mont_mod_lshift(BIGNUM *r, BIGNUM *x, int n, BN_MONTGOMERY *mont);
\r