Lines Matching refs:pre
165 another pre--defined class ``SC\_RSA\_1'' which works in conjunction with the RSA from LibTomCrypt. Additional
573 /* use the number [e.g. pre-computation] */
1303 Barrett reduction is a generic optimized reduction algorithm that requires pre--computation to achieve
1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation
1392 This reduces $a$ in place modulo $m$ with the pre--computed value $mp$. $a$ must be in the range
1499 As in the case of Montgomery reduction there is a pre--computation phase required for a given modulus.
1507 and does not return any error codes. After the pre--computation a reduction can be performed with the
1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted
1544 This will reduce $a$ in place modulo $n$ with the pre--computed value $d$. From my experience this routine is
