Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
The author generalizes earlier works about a modified version of Shor's algorithm for computing short discrete logarithms with tradeoffs [\textit{M. Ekerå} and \textit{J. Håstad}, Lect. Notes Comput. Sci. 10346, 347--363 (2017; Zbl 1437.94058)]. The modified algorithm does not need the order of the group to be known because it computes both the order and the logarithm. However, it requires the logarithm to be small in comparison with the group order (`short discrete logarithm'). The paper also includes discussion of results of partial classical simulations of the suggested quantum algorithm.
scientific article; zbMATH DE number 7379095
scientific article