Finding points on curves over finite fields

Joachim Von Zur Gathen*, Igor Shparlinski, Alistair Sinclair

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)
67 Downloads (Pure)

Abstract

We solve two computational problems concerning plane algebraic curves over finite fields: generating a uniformly random point, and finding all points deterministically in amortized polynomial time (over a prime field, for nonexceptional curves).

Original languageEnglish
Pages (from-to)1436-1448
Number of pages13
JournalSIAM Journal on Computing
Volume32
Issue number6
DOIs
Publication statusPublished - Sept 2003

Bibliographical note

Copyright SIAM Publications. Article archived for private and non-commercial use with the permission of the author and according to publisher conditions. For further information see http://www.siam.org/.

Fingerprint

Dive into the research topics of 'Finding points on curves over finite fields'. Together they form a unique fingerprint.

Cite this