Finding points on curves over finite fields

被引：4
|
作者：
Von zur Gathen, J [1 ]
Shparlinski, I
Sinclair, A
机构：
[1] Univ Paderborn, Fak Elektrotech Informat & Math, D-33095 Paderborn, Germany
[2] Macquarie Univ, Dept Comp, Sydney, NSW 2109, Australia
[3] ICSI, Berkeley, CA USA
[4] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
来源：
SIAM JOURNAL ON COMPUTING | 2003年 / 32卷 / 06期
关键词：
finite fields; algebraic curves; algebraic geometry; computer algebra; probabilistic algorithms; random sampling;
D O I：
10.1137/S0097539799351018
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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).
引用
收藏
页码：1436 / 1448
页数：13
相关论文
共 50 条
12345