Lines Matching refs:performs
291 that is very flexible, complete and performs well in resource contrained environments. Fast RSA for example can
1085 This will divide $a$ in place by $x^b$ and discard the remainder. This function cannot fail as it performs the operations
1604 Performs a Fermat primality test to the base $b$. That is it computes $b^a \mbox{ mod }a$ and tests whether the value is
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
