A reduction of Semigroup DLP to classic DLP


We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the… (More)
DOI: 10.1007/s10623-015-0130-2


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.