Can I read Counting Points on Curves over Finite Fields on EtoBox?

Counting Points on Curves over Finite Fields by Ming-Deh Huang; Doug Ierardi is a Computer Science article available to read on EtoBox.

What is Counting Points on Curves over Finite Fields about?

We consider the problem of counting the number of points on a plane curve, defined by a homogeneous polynomial F (x, y, z) ∈ Fq[x, y, z], which are rational over a ground field Fq. More precisely, we show that if we are given a projective plane curve C of degree n, and if C has only ordinary multiple points, then one can compute the number of Fq-rational points on C in randomized time (log q) ∆ where ∆ = n O(1) . Since our algorithm actually computes the characteristic polynomial of the Frobenius endomorphism on the Jacobian of C, it follows that we may also compute (1) the number of Fq-rational points on the smooth projective model of C, (2) the number of Fq-rational points on the Jacobian of C, and (3) the number of F q m -rational points on C in any given finite extension F q m of the ground field, each in a similar time bound.

Who reads Counting Points on Curves over Finite Fields?

Author

Ming-Deh Huang; Doug Ierardi

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0747-7171)

Published

1998

Language

EN

Field

Computer Science (Physical Sciences)