Left‐shift then reduce quickly: r = (a << n) mod m (assumes 0 <= a < m).
Synopsis
Return Value
1 on success, or 0 on error.
Parameters
Name |
Description |
r |
Destination. |
a |
Value already reduced modulo |
n |
Number of bits to shift left (non‐negative). |
m |
Modulus. |
Created with MrDocs