View Single Post
Old 2016-03-25, 02:05   #1
BenR's Avatar
Nov 2014

32 Posts
Default Fast modular reduction for primes < 512 bits?


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?

BenR is offline   Reply With Quote