Large Integer Polynomial Methods in a Prime Field

One of the major tasks in Schoof's very fast elliptic curve point counting algorithm is to determine whether the number of points is even or odd. This program makes the determination by finding out for a given prime whether the elliptic curve Weierstrass polynomial has roots.

C# (179.2 KB)
120 times
Add to favorites
E-mail Twitter Digg Facebook

Solution explorer

Click an item in the panel on the left to view the contents here.