Home | History | Annotate | Download | only in libtommath

Lines Matching full:restricted

1493 \section{Restricted Dimminished Radix}
1496 digit shifting and small multiplications. In this case the ``restricted'' variant refers to moduli of the
1515 This reduces $a$ in place modulo $b$ with the pre--computed value $mp$. $b$ must be of a restricted
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
1567 detect when Barrett, Montgomery, Restricted and Unrestricted Dimminished Radix based exponentiation can be used. Generally
1568 moduli of the a ``restricted dimminished radix'' form lead to the fastest modular exponentiations. Followed by Montgomery