t-multiple discrete logarithm problem and solving difficulty
This addresses cryptographic security concerns by analyzing a problem's resistance to quantum attacks, though it appears incremental as it builds on known discrete logarithm frameworks.
The paper tackles the t-multiple discrete logarithm problem, analyzing how parameters affect solving difficulty and showing that index-calculus algorithms are unsuitable, while providing conditions for resistance to quantum hidden subgroup algorithms.
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.