Lines Matching refs:Faster
271 \hline Five modular reduction algorithms & X & & Faster modular exponentiation for a variety of moduli. \\
1217 Since squaring can be performed faster than multiplication it is performed it's own function instead of just using
1231 Both of the Toom-Cook and Karatsuba multiplication algorithms are faster than the traditional $O(n^2)$ approach that
1238 actually faster than Comba until you hit distinct ``cutoff'' points. For Karatsuba with the default configuration,
1240 110 digits Karatsuba and Comba multiplications just about break even and for 110+ digits Karatsuba is faster.
1395 Montgomery reduction is faster than Barrett reduction for moduli smaller than the ``comba'' limit. With the default
1517 much faster than both Barrett and Montgomery reductions as they have a much lower asymtotic running time.
1545 slower than mp\_dr\_reduce but faster for most moduli sizes than the Montgomery reduction.
1553 This computes $c = a^b$ using a simple binary left-to-right algorithm. It is faster than repeated multiplications by
