I am planning on implementing an elliptic curve cryptosystem using gmp to do the finite field arithmetic and I was wondering if it would be worth my time to implement any of the algorithms to improve efficiency of modular arithmetic, in particular, fast reductions for NIST primes. Thank you.