You are looking at a specific version 20110105:023628 of this paper.
See the latest version.
Paper 2011/004
A low-memory algorithm for finding short product representations in finite groups
Gaetan Bisson and Andrew V. Sutherland
Abstract
We describe a space-efficient algorithm for solving a generalization of the subset sum problem in a finite group G, using a Pollard-rho approach. Given an element z and a sequence of elements S, our algorithm attempts to find a subsequence of S whose product in G is equal to z. For a random sequence S of length d*log2(n), where n=#G and d>=2 is a constant, we find that its expected running time is O(sqrt(n)*log(n)) group operations (we give a rigorous proof for d>4), and it only needs to store O(1) group elements. We consider applications to class groups of imaginary quadratic fields, and to finding isogenies between elliptic curves over a finite field.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- gaetan bisson @ loria fr
- History
- 2011-01-05: received
- Short URL
- https://ia.cr/2011/004
- License
-
CC BY