Lines Matching refs:important
130 multiple precision calculations is often very important since we deal with outdated machine architecture where modular
334 distinction is important as scalars are often used as array indicies and various other counters.
673 destination. For example, the second example (\textit{mp\_add}) adds $a$ to $b$ and stores in $a$. This is an important
1098 important since if the \textbf{used} is zero the test on the right would fetch below the array. That is obviously
1127 level basis of the entire library. While these algorithm are relatively trivial it is important to understand how they
1448 One important limitation of this function is that it will only set one digit. The size of a digit is not fixed, meaning source that uses
1622 algorithms make use of the lower level algorithms and are the cruicial building block for the multiplication algorithms. It is very important
2015 the digits left or right as well to shift individual bits of the digits left and right. It is important to note that not all ``shift'' operations
2480 For most number theoretic problems including certain public key cryptographic algorithms, the ``multipliers'' form the most important subset of
2507 used. This algorithm does not use any particularly interesting optimizations and should ideally be avoided if possible. One important
2624 carry from the previous iteration. A particularly important observation is that most modern optimizing
3322 The important observation is that the inner loop does not begin at $iy = 0$ like for multiplication. As such the inner loops
5246 routines are less performance oriented than the algorithms of chapters five, six and seven but are no less important.
5479 remainder. An important aspect of this algorithm seemingly overlooked in other descriptions such as that of Algorithm 14.20 HAC \cite[pp. 598]{HAC}
6032 to compute. The ideal choice of $p$ is two since division by two amounts to a right logical shift. Another important observation is that by