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 language | English |
|---|---|
| Pages (from-to) | 1436-1448 |
| Number of pages | 13 |
| Journal | SIAM Journal on Computing |
| Volume | 32 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver