A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm

Abstract

We present an algorithm based on the birthday paradox, which is a low-memory parallel counterpart to the algorithm of Matsuo, Chao and Tsujii. This algorithm computes the group order of the Jacobian of a genus 2 curve over a finite field for which the characteristic polynomial of the Frobenius endomorphism is known modulo some integer. The main tool is a 2-dimensional pseudo-random walk that allows to heuristically choose random elements in a 2-dimensional space. We analyze the expected running time based on heuristics that we validate by computer experiments. Compared with the original algorithm by Matsuo, Chao and Tsujii, we lose a factor of about 3 in running time, but the memory requirement drops from several GB to almost nothing. Our method is general and can be applied in other contexts to transform a baby-step giant-step approach into a low memory algorithm.
Fichier principal
Vignette du fichier
LMPMCT.pdf (188.08 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00514089 , version 1 (01-09-2010)

Identifiers

Cite

Pierrick Gaudry, Eric Schost. A low-memory parallel version of Matsuo, Chao and Tsujii's algorithm. ANTS-VI, 2004, Burlington, United States. pp.208-222, ⟨10.1007/978-3-540-24847-7_15⟩. ⟨inria-00514089⟩
117 View
359 Download

Altmetric

Share

Gmail Facebook X LinkedIn More