A Quasi Quadratic Time Algorithm for Hyperelliptic Curve Point Counting
نویسندگان
چکیده
We describe an algorithm to compute the cardinality of Jacobians of ordinary hyperelliptic curves of small genus over finite fields F2n with cost O(n ). This algorithm is derived from ideas due to Mestre. More precisely, we state the mathematical background behind Mestre’s algorithm and develop from it a variant with quasiquadratic time complexity. Among others, we present an algorithm to find roots of a system of generalized Artin-Schreier equations and give results that we obtain with an efficient implementation. Especially, we were able to obtain the cardinality of curves of genus one, two or three in finite fields of huge size.
منابع مشابه
A p-adic quasi-quadratic point counting algorithm
In this article we give an algorithm for the computation of the number of rational points on the Jacobian variety of a generic ordinary hyperelliptic curve defined over a finite field Fq of cardinality q with time complexity O(n) and space complexity O(n), where n = log(q). In the latter complexity estimate the genus and the characteristic are assumed as fixed. Our algorithm forms a generalizat...
متن کاملPoint Counting on Genus 3 Non Hyperelliptic Curves
We propose an algorithm to compute the Frobenius polynomial of an ordinary non hyperelliptic curve of genus 3 over F2N . The method is a generalization of Mestre’s AGM-algorithm for hyperelliptic curves and leads to a quasi quadratic time algorithm for point counting. The current methods for point counting on curves over finite fields of small characteristic rely essentially on a p-adic approac...
متن کاملMemory efficient hyperelliptic curve point counting
Let E be a hyperelliptic curve of genus g over a finite field of degree n and small characteristic. Using deformation theory we present an algorithm that computes the zeta function of E in time essentially cubic in n and quadratic memory. This improves substantially upon Kedlaya’s result which has the same time asymptotic, but requires cubic memory size. AMS (MOS) Subject Classification Codes: ...
متن کاملQuasi-quadratic elliptic curve point counting using rigid cohomology
We present a deterministic algorithm that computes the zeta function of a nonsupersingular elliptic curve E over a finite field with p elements in time quasi-quadratic in n. An older algorithm having the same time complexity uses the canonical lift of E, whereas our algorithm uses rigid cohomology combined with a deformation approach. An implementation in small odd characteristic turns out to g...
متن کاملCounting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology
We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field Fpn of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius. For fixed p, the asymptotic running time for a curve of genus g over Fpn with a rational Weierstrass point is O(g4+ǫn3+ǫ).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008