arXiv · 1101.0564
A low-memory algorithm for finding short product representations in finite groups
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 log_2 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.
Explore related subjects
Keep this discovery
Gaetan Bisson, Andrew V. Sutherland. 2011-01-03. A low-memory algorithm for finding short product representations in finite groups. https://doi.org/10.1007/s10623-011-9527-8
Cite the original work for its findings. Save a collection to share your selection of sources.