mersenneforum.org - View Single Post - Fast modular reduction for primes < 512 bits?

BenR · 2016-03-27, 00:37

It's actually for any prime, not just the NIST ones :)

I'll look into Montgomery multiplication. The downside is that even the distinguished points would need to be stored in Montgomery form.

2016-03-27, 00:37	#3
BenR Nov 2014 9₁₀ Posts	It's actually for any prime, not just the NIST ones :) I'll look into Montgomery multiplication. The downside is that even the distinguished points would need to be stored in Montgomery form.