Searched +refs:math +refs:polynomial (Results 1 - 3 of 3) sorted by relevance

/macosx-10.10/emacs-93/emacs/etc/
H A Dcalccard.tex175 % we won't be using math mode much, so redefine some of the characters
576 \key{polynomial quotient, remainder, GCD}{a \\\, a \%\, a g}
/macosx-10.10/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex183 The most prevalent need for multiple precision arithmetic, often referred to as ``bignum'' math, is within the implementation
228 In fact the library discussed within this text has already been used to form a polynomial basis library\footnote{See \url{http://poly.libtomcrypt.org} for more details.}.
271 package. As a case study the ``LibTomMath''\footnote{Available at \url{http://math.libtomcrypt.com}} package is used
361 All of the algorithms presented in this text have a polynomial time work level. That is, of the form
495 effect a math error (i.e. invalid input, heap error, etc) can cause a program to stop functioning which is definitely
556 the source code. For example, one day I may audit the multipliers and the next day the polynomial basis functions.
2011 It is quite common to think of a multiple precision integer as a polynomial in $x$, that is $y = f(\beta)$ where $f(x) = \sum_{i=0}^{n-1} a_i x^i$.
2131 Recall from section 4.3 that any integer can be represented as a polynomial in $x$ as $y = f(\beta)$. Such a representation is also known as
2132 the polynomial basis \cite[pp. 48]{ROSE}. Given such a notation a multiplication or division by $x$ amounts to shifting whole digits a single
2136 Converting from an array of digits to polynomial basi
[all...]
H A Dbn.tex80 to implement ``bignum'' math. However, the resulting code has proven to be very useful. It has been used by numerous
259 are the pros and cons of LibTomMath by comparing it to the math routines from GnuPG\footnote{GnuPG v1.2.3 versus LibTomMath v0.28}.
280 It may seem odd to compare LibTomMath to GnuPG since the math in GnuPG is only a small portion of the entire application.
284 So it may feel tempting to just rip the math code out of GnuPG (or GnuMP where it was taken from originally) in your
290 on the other side of the coin LibTomMath offers you a totally free (public domain) well structured math library
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$.
1070 To multiply by the polynomial $g(x) = x$ all you have todo is shift the digits of the basis left one place. The

Completed in 192 milliseconds