t-multiple discrete logarithm problem and solving difficulty
Cryptography and Security
2018-03-26 v2 Information Theory
math.IT
Abstract
Considering the difficult problem under classical computing model can be solved by the quantum algorithm in polynomial time, t-multiple discrete logarithm problems presented. The problem is non-degeneracy and unique solution. We talk about what the parameter effects the problem solving difficulty. Then we pointed out that the index-calculus algorithm is not suitable for the problem, and two sufficient conditions of resistance to the quantum algorithm for the hidden subgroup problem are given.
Keywords
Cite
@article{arxiv.1605.04870,
title = {t-multiple discrete logarithm problem and solving difficulty},
author = {Xiangqun Fu and Wansu Bao and Jianhong Shi and Xiang Wang},
journal= {arXiv preprint arXiv:1605.04870},
year = {2018}
}
Comments
7 pages, 1 table