Lines Matching refs:Like
746 Both functions work like the previous counterparts except they first mp\_init $a$ before setting the values.
1225 Will square $a$ and store it in $b$. Like the case of multiplication there are four different squaring
1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation
1519 Since the moduli are restricted this algorithm is not particularly useful for something like Rabin, RSA or
1528 Unrestricted reductions work much like the restricted counterparts except in this case the moduli is of the
1829 These work like the full mp\_int capable variants except the second parameter $b$ is a mp\_digit. These
1831 an entire mp\_int to store a number like $1$ or $2$.
