mersenneforum.org Fast modular reduction for primes < 512 bits?
 Register FAQ Search Today's Posts Mark Forums Read

 2016-03-25, 02:05 #1 BenR     Nov 2014 32 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
2016-03-25, 15:55   #2
jasonp
Tribal Bullet

Oct 2004

2·52·71 Posts

Quote:
 Originally Posted by BenR 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?
If this is intended for elliptic curve discrete logs for the NIST elliptic curves, those primes do have special forms for which custom code may or may not run faster than general modular reduction.

Otherwise Montgomery multiplication would probably outperform Barrett's method for moduli of these sizes.

 2016-03-27, 00:37 #3 BenR     Nov 2014 118 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.

 Similar Threads Thread Thread Starter Forum Replies Last Post jasong jasong 35 2016-12-11 00:57 Derived Number Theory Discussion Group 24 2016-09-08 11:45 fivemack Computer Science & Computational Number Theory 15 2009-02-19 06:32 goatboy Math 1 2007-12-07 12:30 Dresdenboy Programming 10 2004-02-29 17:27

All times are UTC. The time now is 14:45.

Wed Dec 7 14:45:15 UTC 2022 up 111 days, 12:13, 0 users, load averages: 0.97, 0.93, 0.90