2 papers
cs.CR2016
t-multiple discrete logarithm problem and solving difficulty
Xiangqun Fu, Wansu Bao, Jianhong Shi +1
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 p…
cs.CR2014
Parameter security characterization of knapsack public-key crypto under quantum computing
Xiangqun Fu, Wansu Bao, Jianhong Shi +2
In order to research the security of the knapsack problem under quantum algorithm attack, we study the quantum algorithm for knapsack problem over Z_r based on the relation between…