3 ms·
GMP doesn't do well in prime fields with a small, fixed number of limbs. Poly1305 and elliptic curves are both good examples. Its general routines aren't as f
by brandmeyer 5y ago
GMP doesn't do well in prime fields with a small, fixed number of limbs. Poly1305 and elliptic curves are both good examples. Its general routines aren't as fast as custom routines, and it doesn't execute in constant time.
MPFQ exists for short finite field work, but it hasn't achieved the popularity of GNU MP.
https://gitlab.inria.fr/mpfq/mpfq https://gitlab.inria.fr/mpfq/mpfq