Searched +refs:term +refs:adjust +refs:current +refs:row +refs:cache (Results 1 - 1 of 1) sorted by relevance

/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dtommath.tex103 This book and indeed much of the LibTom projects would not exist in their current form if it was not for a plethora
291 The term ``mp\_int'' shall refer to a composite structure which contains the digits of the integer it represents, as well
1477 mp\_int. Step 2.1 will multiply the current result by sixteen making room for four more bits in the less significant positions. In step 2.2 the
2063 are the same there is no need to perform two reads from the digits of $a$. Step 6.1 performs a single precision shift on the current digit $a_n$ to
2590 Each row of the product is added to the result after being shifted to the left (\textit{multiplied by a power of the radix}) by the appropriate
2813 implementation was ``row--major'' which means it adds to each of the columns in each pass. After the outer loop it would then fix
2815 one mp\_word per iteration. On processors such as the Athlon XP and P4 this did not matter much since the cache bandwidth
2816 is very high and it can keep the ALU fed with data. It did, however, matter on older and embedded cpus where cache is often
2820 After the inner loop we store the current accumulator in $W$ and shift $\_ \hat W$ (lines 77, 80) to forward it as
2842 When picking points to gather relations there are always three obvious points to choose, $y = 0, 1$ and $ \infty$. The $\zeta_0$ term
[all...]

Completed in 94 milliseconds