Lines Matching refs:slower
187 \hline BN\_MP\_DIV\_SMALL & Enables a slower, smaller and equally \\
218 \hline Modular inverse (both, smaller/slower) & BN\_FAST\_MP\_INVMOD\_C \\
268 \hline Speed && X & LibTomMath is slower. \\
285 own application but I think there are reasons not to. While LibTomMath is slower than libraries such as GnuMP it is
286 not normally significantly slower. On x86 machines the difference is normally a factor of two when performing modular
1545 slower than mp\_dr\_reduce but faster for most moduli sizes than the Montgomery reduction.
1630 in bits. This comes in handy specially since larger numbers are slower to test. For example, a 512-bit number would
