Finding points on curves over finite fields extended abstract

Joachim von zur Gathen*, Igor Shparlinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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

Original languageEnglish
Pages (from-to)284-292
Number of pages9
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
Publication statusPublished - 1995
Externally publishedYes


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

Cite this