0000000000013753

AUTHOR

Edlyn Teske

showing 1 related works from this author

Point counting on Picard curves in large characteristic

2005

We present an algorithm for computing the cardinality of the Jacobian of a random Picard curve over a finite field. If the underlying field is a prime field Fp, the algorithm has complexity O(p).

Discrete mathematicsAlgebra and Number TheoryApplied MathematicsJacobian varietyGeometryField (mathematics)Computational Mathematicssymbols.namesakeMathematics::Algebraic GeometryFinite fieldPoint countingCardinalityJacobian matrix and determinantsymbolsPicard hornPrime fieldMathematicsMathematics of Computation
researchProduct