Lines Matching defs:Radix
1066 ``polynomial basis''. This simply means a field element is stored by divisions of a radix. For example, if
1068 the polynomial basis representation of $z$ if $f(\beta) = z$ for a given radix $\beta$.
1400 where $R = \beta^n$, $n$ is the n number of digits in $m$ and $\beta$ is radix used (default is $2^{28}$).
1493 \section{Restricted Dimminished Radix}
1495 ``Dimminished Radix'' reduction refers to reduction with respect to moduli that are ameniable to simple
1497 form $\beta^k - p$ for some $k \ge 0$ and $0 < p < \beta$ where $\beta$ is the radix (default to $2^{28}$).
1516 dimminished radix form and $a$ must be in the range $0 \le a < b^2$. Dimminished radix reductions are
1526 \section{Unrestricted Dimminshed Radix}
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
1710 int mp_toradix (mp_int * a, char *str, int radix);
1712 This still store $a$ in ``str'' as a base-``radix'' string of ASCII chars. This function appends a NUL character
1713 to terminate the string. Valid values of ``radix'' line in the range $[2, 64]$. To determine the size (exact) required
1718 int mp_radix_size (mp_int * a, int radix, int *size)
1726 int mp_read_radix (mp_int * a, char *str, int radix);
1728 This will read the base-``radix'' NUL terminated string from ``str'' into $a$. It will stop reading when it reads a
