Home | History | Annotate | Download | only in libtommath

Lines Matching refs:much

1237 So why not always use Karatsuba or Toom-Cook?   The simple answer is that they have so much overhead that they're not
1517 much faster than both Barrett and Montgomery reductions as they have a much lower asymtotic running time.
1528 Unrestricted reductions work much like the restricted counterparts except in this case the moduli is of the
1613 Performs a Miller-Rabin test to the base $b$ of $a$. This test is much stronger than the Fermat test and is very hard to