Lines Matching defs:Algorithm
180 A tweak is an algorithm ``alternative''. For example, to provide tradeoffs (usually between size and space).
1288 algorithm mp\_exptmod when an appropriate modulus is detected.
1291 In order to effect an arbitrary modular reduction the following algorithm is provided.
1299 of $b$. This algorithm accepts an input $a$ of any range and is not limited by $0 \le a < b^2$.
1303 Barrett reduction is a generic optimized reduction algorithm that requires pre--computation to achieve
1377 Montgomery is a specialized reduction algorithm for any odd moduli. Like Barrett reduction a pre--computation
1397 algorithm after that point.
1487 This particular example does not look too efficient but it demonstrates the point of the algorithm. By
1489 a single final reduction to correct for the normalization and the fast reduction used within the algorithm.
1519 Since the moduli are restricted this algorithm is not particularly useful for something like Rabin, RSA or
1520 BBS cryptographic purposes. This reduction algorithm is useful for Diffie-Hellman and ECC where fixed
1553 This computes $c = a^b$ using a simple binary left-to-right algorithm. It is faster than repeated multiplications by
1561 This computes $Y \equiv G^X \mbox{ (mod }P\mbox{)}$ using a variable width sliding window algorithm. This function
1582 This algorithm uses the ``Newton Approximation'' method and will converge on the correct root fairly quickly. Since
1583 the algorithm requires raising $a$ to the power of $b$ it is not ideal to attempt to find roots for large
1770 \section{Extended Euclidean Algorithm}
1777 This finds the triple U1/U2/U3 using the Extended Euclidean algorithm such that the following equation holds.
