Function mont_reduction

modules/crypt/arith/xsBigIntEx.c:412–436

}

txBigInt *mont_reduction(txMachine *the, txBigInt *r, txBigInt *a, txBigInt *m, txU4 u, pool_t *pool)
{
	txBigInt *t1, *t2;
	txU2 t1siz, t2siz;
	int n;

	n = m->size;
	t2siz = n + 1;
	t1siz = MAX(t2siz, a->size) + 1;
	t2 = pool_get(the, t2siz, pool);
	t1 = pool_get(the, t1siz, pool);
	fxBigInt_copy(t1, a);
	while (--n >= 0) {
		txU4 u1 = u * t1->data[0];	/* mod b */
		fxBigInt_umul1(the, t2, m, u1);
		fxBigInt_uadd(the, t1, t1, t2);
		fxBigInt_ulsr1(the, t1, t1, mxBigIntWordSize);
	}
	if (fxBigInt_ucomp(t1, m) >= 0)
		fxBigInt_sub(the, t1, t1, m);
	fxBigInt_copy(r, t1);
	pool_put(t1, t1siz);
	pool_put(t2, t2siz);
	return r;
}

txBigInt *mont_in(txMachine *the, txBigInt *r, txBigInt *a, txBigInt *m)
{