Explicit bounds of polynomial coefficients and counting points on Picard curves over finite fields

In this paper, we describe an algorithm for computing the order of the Jacobian varieties of Picard curves over finite fields. This is an extension of the algorithm of Matsuo, Chao and Tsujii (MCT) [K. Matsuo, J. Chao, S. Tsujii, An improved baby step algorithm for point counting of hyperelliptic cu...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical and computer modelling Vol. 49; no. 1; pp. 80 - 87
Main Authors:	Sohn, Gyoyong, Kim, Hoil
Format:	Journal Article
Language:	English
Published:	Kidlington Elsevier Ltd 2009 Elsevier
Subjects:	Algebra Algebraic geometry Baby-step giant-step algorithm Counting points Cryptography Exact sciences and technology Mathematical analysis Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Number theory Numerical analysis. Scientific computation Picard curves Sciences and techniques of general use Counting points Picard curves Cryptography Baby-step giant-step algorithm Chaos Finite field Characteristic polynomial Algorithm Scientific computation Applied mathematics Hyperelliptic curve Mathematical model Computer aided analysis
ISSN:	0895-7177, 1872-9479
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!