Counting points on superelliptic curves in average polynomial time
نویسندگان
چکیده
منابع مشابه
Rational points on Erdős–Selfridge superelliptic curves
Given k > 2, we show that there are at most finitely many rational numbers x and y 6= 0 and integers ` > 2 (with (k, `) 6= (2, 2)) for which x(x+ 1) · · · (x+ k − 1) = y. In particular, if we assume that ` is prime, then all such triples (x, y, `) satisfy either y = 0 or ` < exp(3k).
متن کاملHigher-order Weierstrass Weights of Branch Points on Superelliptic Curves
In this paper we consider the problem of calculating the higherorder Weierstrass weight of the branch points of a superelliptic curve C. For any q > 1, we give an exact formula for the q-weight of an affine branch point. We also find a formula for the q-weight of a point at infinity in the case where n and d are relatively prime. With these formulas, for any fixed n, we obtain an asymptotic for...
متن کاملArithmetic on superelliptic curves
superelliptic curves, jacobians, cryptography, discrete logarithm problem In this paper we present an efficient, polynomial-time method to perform calculations in the divisor class group of a curve which has a single point on its normalization above infinity. In particular, we provide a unique representation of divisor classes and an algorithm for reducing a divisor on such a curve to its corre...
متن کاملOn average polynomial time
One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Book Series
سال: 2020
ISSN: 2329-907X,2329-9061
DOI: 10.2140/obs.2020.4.403