A reduction of semigroup DLP to classic DLP
Cryptography and Security
2016-07-26 v4 Computational Complexity
Quantum Physics
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.
Keywords
Cite
@article{arxiv.1310.7903,
title = {A reduction of semigroup DLP to classic DLP},
author = {Matan Banin and Boaz Tsaban},
journal= {arXiv preprint arXiv:1310.7903},
year = {2016}
}
Comments
Improved discussion of the nonperiodic case