On ramification and genus of recursive towers.
In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of , where is the cardinality of the ground field. Moreover, it is proven that for every fixed natural number the following holds: We consider the discrete logarithm problem for curves given by plane models...
We give upper and lower bounds for the number of points on abelian varieties over finite fields, and lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian surfaces.
Consider two families of hyperelliptic curves (over ℚ), and , and their respective Jacobians , . We give a partial characterization of the torsion part of and . More precisely, we show that the only prime factors of the orders of such groups are 2 and prime divisors of n (we also give upper bounds for the exponents). Moreover, we give a complete description of the torsion part of . Namely, we show that . In addition, we characterize the torsion parts of , where p is an odd prime, and...
We consider Weil sums of binomials of the form , where F is a finite field, ψ: F → ℂ is the canonical additive character, , and . If we fix F and d, and examine the values of as a runs through , we always obtain at least three distinct values unless d is degenerate (a power of the characteristic of F modulo ). Choices of F and d for which we obtain only three values are quite rare and desirable in a wide variety of applications. We show that if F is a field of order 3ⁿ with n odd, and with...