Lines Matching refs:Which
75 LibTomMath is a library of source code which provides a series of efficient and carefully written functions for manipulating
159 ``tommath\_superclass.h''. By default, the symbol ``LTM\_ALL'' shall be defined which simply
165 another pre--defined class ``SC\_RSA\_1'' which works in conjunction with the RSA from LibTomCrypt. Additional
170 which further define symbols. All of the symbols (technically they're macros $\ldots$) represent a given C source
197 Build trims are meant to be defined on the last pass of the configuration which means they are to be defined
255 Source code alone cannot really teach how the algorithms work which is why I also wrote a textbook that accompanies
322 provide the address of an integer it can store to) which the caller can access. To convert one of the three return codes
330 This will return a pointer to a string which describes the given error code. It will not work for the return codes
373 This allows operands to be re-used which can make programming simpler.
385 represents the default integer which is zero. If the functions returns MP\_OKAY then the mp\_int is ready to be used
416 pointer\footnote{The ``dp'' member.} within the mp\_int to \textbf{NULL} which is used to prevent double free situations.
514 Another less common initializer is mp\_init\_size() which allows the user to initialize an mp\_int with a given
524 to have $size$ digits (which are all initially zero).
558 will require heap operations which can be slow. It is not ideal to shrink mp\_int variables that you will further
594 Within the mp\_int structure are two parameters which control the limitations of the array of digits that represent
856 If this program\footnote{This function uses the mp\_neg() function which is discussed in section \ref{sec:NEG}.} completes
914 If this program\footnote{This function uses the mp\_neg() function which is discussed in section \ref{sec:NEG}.} completes
931 positive. This function is rather handy when you have to compare against small values such as $1$ (which often
980 When multiplying or dividing by two a special case routine can be used which are as follows.
1059 Which will divide $a$ by $2^b$, store the quotient in ``c'' and the remainder in ``d'. If $b \le 0$ then the
1078 This will multiply $a$ in place by $x^b$ which is equivalent to shifting the digits left $b$ places and inserting zeroes
1100 Which compute $c = a \odot b$ where $\odot$ is one of OR, AND or XOR.
1112 Which perform $c = a \odot b$ where $\odot$ is one of signed addition or subtraction. The operations are fully sign
1125 Which assigns $-a$ to $b$.
1135 Which assigns $\vert a \vert$ to $b$.
1157 Which assigns the full signed product $ab$ to $c$. This function actually breaks into one of four cases which are
1158 specific multiplication routines optimized for given parameters. First there are the Toom-Cook multiplications which
1159 should only be used with very large inputs. This is followed by the Karatsuba multiplications which are for moderate
1226 algorithms all which can be called from mp\_sqr(). It is ideal to use mp\_sqr over mp\_mul when squaring terms because
1408 Which calculates $a = R$ for the odd moduli $b$ without using multiplication or division.
1658 This will find a prime greater than $256^{size}$ which can be ``bbs\_style'' or not depending on $bbs$ and must pass
1665 Which is a function that must read $len$ bytes (and return the amount stored) into $dst$. The $dat$ variable is simply
1667 mp\_prime\_random() is more suitable for generating primes which must be secret (as in the case of RSA) since there
1682 (see fig. \ref{fig:primeopts}) which can be OR'ed together. The callback parameters are used as in
1729 character it does not recognize (which happens to include th NUL char... imagine that...). A single leading $-$ sign
