activity
20092023
most citedStrong quantum computational advantage using a superconducting quantum processor

1.1k citations · 1.9k across the 43 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2016

Homomorphic Encryption Experiments on IBM's Cloud Quantum Computing Platform

He-Liang Huang, You-Wei Zhao, Tan Li +6

Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near futur…

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.CR2015

Algorithm for Solving Massively Underdefined Systems of Multivariate Quadratic Equations over Finite Fields

Heliang Huang, Wansu Bao

Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem…

cs.CR2015

Middle-Solving Grobner bases algorithm for cryptanalysis over finite fields

Wansu Bao, Heliang Huang

Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a…

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…