arXiv · 1310.7903
A reduction of semigroup DLP to classic DLP
Abstract
We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (SGDLP) to the same problem in a subgroup of the same semigroup. It follows that SGDLP can be solved in polynomial time by quantum computers, and that SGDLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential algorithms.
Explore related subjects
Keep this discovery
Matan Banin, Boaz Tsaban. 2013-10-29. A reduction of semigroup DLP to classic DLP. https://doi.org/10.1007/s10623-015-0130-2
Cite the original work for its findings. Save a collection to share your selection of sources.