The discrete logarithm problem in Jacobians of curves of high genusgover finite fieldsFqis known to be computable with subexponential complexityLqg(1/2,O(1)). We present an algorithm for a family of plane curves whose degrees inXandYare low with respect to the curve genus, and suitably unbala...
Communications of the ACM, Volume 9 (9) –Sep 1, 1966 Read Article Download PDF Share Full Text for Free 4 pages References References for this paper are not available at this time. We will be adding them shortly, thank you for your patience....