8 search results - page 1 / 2 » Elliptic Gauss sums and applications to point counting |
JSC
2010
13 years 3 months ago
2010
SIAMSC
2010
13 years 2 days ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
PKC
2001
Springer
13 years 9 months ago
2001
Springer
Quite recently, in [4], a new time-memory tradeoff algorithm was presented. The original goal of this algorithm was to count the number of points on an elliptic curve, however, th...
AMC
2007
13 years 5 months ago
2007
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
EUROCRYPT
2001
Springer
13 years 9 months ago
2001
Springer
The use of elliptic curves in cryptography relies on the ability to count the number of points on a given curve. Before 1999, the SEA algorithm was the only efficient method known ...