Update comments to provide a better approximation of reality.
This commit is contained in:
parent
b99b110766
commit
ec1258dd44
@ -262,8 +262,9 @@ typedef struct bn_mont_ctx_st
|
|||||||
int ri; /* number of bits in R */
|
int ri; /* number of bits in R */
|
||||||
BIGNUM RR; /* used to convert to montgomery form */
|
BIGNUM RR; /* used to convert to montgomery form */
|
||||||
BIGNUM N; /* The modulus */
|
BIGNUM N; /* The modulus */
|
||||||
BIGNUM Ni; /* The inverse of N (bignum form) */
|
BIGNUM Ni; /* R*(1/R mod N) - N*Ni = 1
|
||||||
BN_ULONG n0; /* The inverse of N in word form */
|
* (Ni is only stored for bignum algorithm) */
|
||||||
|
BN_ULONG n0; /* least significant word of Ni */
|
||||||
int flags;
|
int flags;
|
||||||
} BN_MONT_CTX;
|
} BN_MONT_CTX;
|
||||||
|
|
||||||
|
@ -304,7 +304,8 @@ int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
|
|||||||
BN_sub_word(&Ri,1);
|
BN_sub_word(&Ri,1);
|
||||||
else /* if N mod word size == 1 */
|
else /* if N mod word size == 1 */
|
||||||
BN_set_word(&Ri,BN_MASK2); /* Ri-- (mod word size) */
|
BN_set_word(&Ri,BN_MASK2); /* Ri-- (mod word size) */
|
||||||
BN_div(&Ri,NULL,&Ri,&tmod,ctx); /* Ni = (R*Ri-1)/N */
|
BN_div(&Ri,NULL,&Ri,&tmod,ctx); /* Ni = (R*Ri-1)/N,
|
||||||
|
* keep only list significant word: */
|
||||||
mont->n0=Ri.d[0];
|
mont->n0=Ri.d[0];
|
||||||
BN_free(&Ri);
|
BN_free(&Ri);
|
||||||
}
|
}
|
||||||
|
Loading…
x
Reference in New Issue
Block a user