Finding points on curves over finite fields

SIAM Journal on Computing

Volumn 32, Issue 6, 2003, Pages 1436-1448

  Von Zur Gathen, Joachim ^a   Shparlinski, Igor ^b   Sinclair, Alistair ^c  

^a UNIVERSITY OF PADERBORN   (Germany)

^b MACQUARIE UNIVERSITY   (Australia)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algebraic curves; Algebraic geometry; Computer algebra; Finite fields; Probabilistic algorithms; Random sampling

Indexed keywords

ALGEBRAIC CURVES; ALGEBRAIC GEOMETRY; COMPUTER ALGEBRA; FINITE FIELDS; PROBABLISTIC ALGORITHMS; RANDOM SAMPLING;

ALGORITHMS; CODES (STANDARDS); COMPUTATIONAL GEOMETRY; CURVE FITTING; INTEGER PROGRAMMING; LINEAR ALGEBRA; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; SAMPLING; THEOREM PROVING;

COMPUTATIONAL METHODS;

EID: 0942288265     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539799351018     Document Type: Article

References (17)

1. L. M. ADLEMAN AND M.-D. HUANG (2001), Counting points on curves and abelian varieties over finite fields, J. Symbolic Comput., 32, pp. 171-189.
2. D. G. CANTOR AND H. ZASSENHAUS (1981), A new algorithm for factoring polynomials over finite fields, Math. Comp., 36, pp. 587-592.
3. J. VON ZUR GATHEN (1984), Hensel and Newton methods in valuation rings, Math. Comp., 42, pp. 637-661.
4. J. VON ZUR GATHEN AND E. KALTOFEN (1985), Factorization of multivariate polynomials over finite fields, Math. Comp., 45, pp. 251-261.
5. J. VON ZUR GATHEN, M. KARPINSKI, AND I. E. SHPARLINSKI (1996), Counting curves and their projections, Comput. Complexity, 6, pp. 64-99.
6. J. VON ZUR GATHEN AND V. SHOUP (1992), Computing Frobenius maps and factoring polynomials, Comput. Complexity, 2, pp. 187-224.
7. J. VON ZUR GATHEN AND I. E. SHPARLINSKI (1998), Computing components and projections of curves over finite fields, SIAM J. Comput., 28, pp. 822-840.
8. M.-D. HUANG AND D. IERARDI (1998), Counting points on curves over finite fields, J. Symbolic Comput., 25, pp. 1-21.
9. M.-D. HUANG AND Y.-C. WONG (1999), Solvability of systems of polynomial congruences modulo a large prime, Comput. Complexity, 8, pp. 227-257.
10. M.-D. HUANG AND Y.-C. WONG (1998), An algorithm for approximate counting of points on algebraic sets over finite fields, in Algorithmic Number Theory, Proceedings ANTS-III (Portland OR), J. P. Buhler, ed., Lecture Notes in Comput. Sci. 1423, Springer-Verlag, New York, pp. 514-527.
11. E. KALTOFEN (1985), Fast parallel absolute irreducibility testing, J. Symbolic Comput., 1, pp. 57-67.
12. R. M. KARP, M. LUBY, AND N. MADRAS (1989), Monte-Carlo approximation algorithms for enumeration problems, J. Algorithms, 10, pp. 429-448.
13. A. K. LENSTRA (1985), Factoring multivariate polynomials over finite fields, J. Comput. System Sci., 30, pp. 235-248.
14. G. I. PEREL'MUTER (1969), (Bounds on sums along algebraic curves), Mat. Zametki, 5, pp. 373-380.
15. I. R. SHAFAREVICH (1974), Basic Algebraic Geometry, Grundlehren Math. Wiss. 213, Springer-Verlag, New York, Heidelberg.
16. V. SHOUP (1990), On the deterministic complexity of factoring polynomials over finite fields, Inform. Process. Lett., 33, pp. 261-267.
17. I. E. SHPARLINSKI (1999), Finite Fields: Theory and Computation, Math. Appl. 477, Kluwer Academic Publishers, Dordrecht, The Netherlands.