Errata for “ An Extension of Kedlaya ’ s Algorithm to Hyperelliptic Curves

نویسندگان

  • J. Denef
  • F. Vercauteren
چکیده

In this note we correct a gap in the proof of the complexity estimates appearing in our papers [1],[2]. The complexity estimates are correct, but the proof was incomplete at a certain point. The same gap appears in our paper [3], but there the estimate for the space complexity has to be multiplied with a power of log(g), where g is the genus of the curve. First we fill in the gap in [2]. In this paper we gave an algorithm to compute the zeta function of an hyperelliptic curve of genus g over a field with q = 2 n elements. We proved that the worst-case time complexity is O(g 5+ n 3+), and that the worst-case space complexity is O(g 4 n 3). For the average-case time and space complexity we obtained O(g 4+ n 3+) and O(g 3 n 3), respectively. These estimates are correct, but there is a gap in the proof, which we will now correct. The gap in [1] can be treated in the same way. The gap has to do with the precision estimates. The matrix M of the small Frobenius (induced by squaring) on the given basis of the Monsky-Washnitzer cohomology H 1 does not have integral entries. We proved in [2] that the denominators have valuation O(log(g)). Hence the denominators in the norm M F of M have valuation at most O(n log(g)). This can cause a loss of precision of O(n log(g)) q-adic digits, as we noted in section 4.2 of [2]. What we overlooked is that in the calculation of the characteristic polynomial of M F , using the Hessenberg algorithm, there can be an accumulation of loss of precision, so that we lose g times more digits. Thus we lose at most O(ng log(g)) digits, instead of at most O(n log(g)) digits. In our paper we worked with a precision of O(ng) digits. One way to remedy this is to simply carry more precision in our calculations, from the start on. It is easy to see that this does not change the time complexity, but it would increase the space complexity by multiplying it with a power of log(g). However it is not necessary to increase our estimate for the space complexity. To prove this, we will use the following claim. Let C be a smooth proper curve over the ring Z q of q-adic integers, and let …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Extension of Kedlaya's Point-Counting Algorithm to Superelliptic Curves

We present an algorithm for counting points on superelliptic curves y = f(x) over a finite field Fq of small characteristic different from r. This is an extension of an algorithm for hyperelliptic curves due to Kedlaya. In this extension, the complexity, assuming r and the genus are fixed, is O(log q) in time and space, just like for hyperelliptic curves. We give some numerical examples obtaine...

متن کامل

Iterated Coleman Integration for Hyperelliptic Curves

The Coleman integral is a p-adic line integral. Double Coleman integrals on elliptic curves appear in Kim’s nonabelian Chabauty method, the first numerical examples of which were given by the author, Kedlaya, and Kim [3]. This paper describes the algorithms used to produce those examples, as well as techniques to compute higher iterated integrals on hyperelliptic curves, building on previous jo...

متن کامل

Explicit Coleman Integration for Hyperelliptic Curves

Coleman’s theory of p-adic integration figures prominently in several number-theoretic applications, such as finding torsion and rational points on curves, and computing p-adic regulators in K-theory (including p-adic heights on elliptic curves). We describe an algorithm for computing Coleman integrals on hyperelliptic curves, and its implementation in Sage.

متن کامل

Counting Points on Hyperelliptic Curves using Monsky-Washnitzer Cohomology

We describe an algorithm for counting points on an arbitrary hyperelliptic curve over a finite field Fpn of odd characteristic, using Monsky-Washnitzer cohomology to compute a p-adic approximation to the characteristic polynomial of Frobenius. For fixed p, the asymptotic running time for a curve of genus g over Fpn with a rational Weierstrass point is O(g4+ǫn3+ǫ).

متن کامل

Computing L-Series of Hyperelliptic Curves

We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.

متن کامل

Computing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2

We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over F2n , the asymptotic running time of the algorithm is O(gn) and the space complexity is O(gn).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007