Lines Matching refs:hline
186 \hline \textbf{Define} & \textbf{Purpose} \\
187 \hline BN\_MP\_DIV\_SMALL & Enables a slower, smaller and equally \\
189 \hline
204 \hline \textbf{Restriction} & \textbf{Undefine} \\
205 \hline Exponentiation with odd moduli only & BN\_S\_MP\_EXPTMOD\_C \\
210 \hline Exponentiation with random odd moduli & (The above plus the following) \\
217 \hline Modular inverse odd moduli only & BN\_MP\_INVMOD\_SLOW\_C \\
218 \hline Modular inverse (both, smaller/slower) & BN\_FAST\_MP\_INVMOD\_C \\
219 \hline
228 \hline \textbf{Restriction} & \textbf{Undefine} \\
229 \hline Moduli $\le 2560$ bits & BN\_MP\_MONTGOMERY\_REDUCE\_C \\
233 \hline Polynomial Schmolynomial & BN\_MP\_KARATSUBA\_MUL\_C \\
238 \hline
265 \hline \textbf{Criteria} & \textbf{Pro} & \textbf{Con} & \textbf{Notes} \\
266 \hline Few lines of code per file & X & & GnuPG $ = 300.9$, LibTomMath $ = 71.97$ \\
267 \hline Commented function prototypes & X && GnuPG function names are cryptic. \\
268 \hline Speed && X & LibTomMath is slower. \\
269 \hline Totally free & X & & GPL has unfavourable restrictions.\\
270 \hline Large function base & X & & GnuPG is barebones. \\
271 \hline Five modular reduction algorithms & X & & Faster modular exponentiation for a variety of moduli. \\
272 \hline Portable & X & & GnuPG requires configuration to build. \\
273 \hline
307 \hline \textbf{Code} & \textbf{Meaning} \\
308 \hline MP\_OKAY & The function succeeded. \\
309 \hline MP\_VAL & The function input was invalid. \\
310 \hline MP\_MEM & Heap memory exhausted. \\
311 \hline &\\
312 \hline MP\_YES & Response is yes. \\
313 \hline MP\_NO & Response is no. \\
314 \hline
793 \hline \textbf{Result Code} & \textbf{Meaning} \\
794 \hline MP\_GT & $a > b$ \\
795 \hline MP\_EQ & $a = b$ \\
796 \hline MP\_LT & $a < b$ \\
797 \hline
1257 \hline \textbf{Value of XXX} & \textbf{Meaning} \\
1258 \hline tune & Builds portable tuning application \\
1259 \hline tune86 & Builds x86 (pentium and up) program for COFF \\
1260 \hline tune86c & Builds x86 program for Cygwin \\
1261 \hline tune86l & Builds x86 program for Linux (ELF format) \\
1262 \hline
1689 \hline \textbf{Flag} & \textbf{Meaning} \\
1690 \hline LTM\_PRIME\_BBS & Make the prime congruent to $3$ modulo $4$ \\
1691 \hline LTM\_PRIME\_SAFE & Make a prime $p$ such that $(p - 1)/2$ is also prime. \\
1693 \hline LTM\_PRIME\_2MSB\_OFF & Makes sure that the bit adjacent to the most significant bit \\
1695 \hline LTM\_PRIME\_2MSB\_ON & Makes sure that the bit adjacent to the most significant bit \\
1697 \hline
