Lines Matching refs:followed
169 In the file tommath\_class.h you will see a large list of C ``defines'' followed by a series of ``ifdefs''
1159 should only be used with very large inputs. This is followed by the Karatsuba multiplications which are for moderate
1160 sized inputs. Then followed by the Comba and baseline multipliers.
1568 moduli of the a ``restricted dimminished radix'' form lead to the fastest modular exponentiations. Followed by Montgomery
1640 This will perform a trial division followed by $t$ rounds of Miller-Rabin tests on $a$ and store the result in $result$.
