Abstract
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 language | English |
|---|---|
| Pages (from-to) | 284-292 |
| Number of pages | 9 |
| Journal | Annual Symposium on Foundations of Computer Science - Proceedings |
| Publication status | Published - 1995 |
| Externally published | Yes |