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

BenR · 2016-03-25, 02:05

Hi,

I'm working on an implementation of Pollard's Rho for elliptic curves over prime fields.

Currently it's using the Barrett Reduction but I'm wondering if there is anything faster for general primes (no special form) in the 128 to 512 bit range?

Thanks

2016-03-25, 02:05	#1
BenR Nov 2014 3² Posts	Fast modular reduction for primes < 512 bits? Hi, I'm working on an implementation of Pollard's Rho for elliptic curves over prime fields. Currently it's using the Barrett Reduction but I'm wondering if there is anything faster for general primes (no special form) in the 128 to 512 bit range? Thanks