The parallelized Pollard kangaroo method in real quadratic function fields
The Pollard kangaroo method [\textit{J. Pollard}, Math. Comput. 32, 918-924 (1978; Zbl 0382.10001)], also called the lambda method, is a space-efficient algorithm for computing discrete logarithms in finite abelian groups. Recently, parallelized versions of this method have been proposed [\textit{P. C. van Oorschot} and \textit{M. J. Wiener}, J. Cryptology 12, 1-28 (1999; Zbl 0992.94028) and \textit{J. M. Pollard}, J. Cryptology 13, 437-447 (2000; Zbl 0979.11057)]. NEWLINENEWLINENEWLINEThis paper begins with an exposition of these two parallelized versions, including an experimental comparison of their efficiency in computing elliptic discrete logarithms in practice. Then it turns to its main subject, which is the adaptation of the parallelized kangaroo method to the quick computation of class numbers and regulators of ``real quadratic function fields, i.e., quadratic extensions of the rational function field over a finite field, in which the place at infinity splits. In particular, the authors set a new record by computing a 29-digit class number and regulator of a genus-3 real quadratic function field.
- Computing discrete logarithms with the parallelized kangaroo method.
- Some Methods for Evaluating the Regulator of a Real Quadratic Function Field
- Kangaroos, monopoly and discrete logarithms
- An efficient collision detection method for computing discrete logarithms with Pollard's rho
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- Algebraic function fields and codes
- Computing in the Jacobian of a Hyperelliptic Curve
- Explicit bounds and heuristics on class numbers in hyperelliptic function fields
- scientific article; zbMATH DE number 1643934 (Why is no real title available?)
- scientific article; zbMATH DE number 1186971 (Why is no real title available?)
- scientific article; zbMATH DE number 1186976 (Why is no real title available?)
- scientific article; zbMATH DE number 3522065 (Why is no real title available?)
- scientific article; zbMATH DE number 1273658 (Why is no real title available?)
- Kangaroos, monopoly and discrete logarithms
- Key-exchange in real quadratic congruence function fields
- On random walks for Pollard's rho method
- Parallel collision search with cryptanalytic applications
- Real and imaginary quadratic representations of hyperelliptic function fields
- Computing discrete logarithms with the parallelized kangaroo method.
- Explicit bounds and heuristics on class numbers in hyperelliptic function fields
- Construction of all cubic function fields of a given square-free discriminant
- Cryptographic aspects of real hyperelliptic curves
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- How long does it take to catch a wild kangaroo?
- Point counting on Picard curves in large characteristic
- RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect
- Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
- Approximating Euler products and class number computation in algebraic function fields
This page was built for publication: The parallelized Pollard kangaroo method in real quadratic function fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781226)
