Shanks-Mestre Elliptic Curve Point Counter Single Precision

This application counts the points on an elliptic curve with the Weierstrass formula y^2 = x^3 + ax + b mod p where p is a prime number using two different algorithms. The first algorithm is the very simple but slow order p method that uses the Lagrange symbol.

C# (185.4 KB)
 
 
 
 
 
(0)
126 times
Add to favorites
10/22/2015
E-mail Twitter del.icio.us Digg Facebook

Solution explorer

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