Description
An analogue quantum computer for the solution of the knapsack problem is discussed. Dynamics of some quantum-optical system exhibits explicit parallels with knapsack problem. This fact gives the possibility to propose an quantum algorithm for the knapsack problem and to estimate the quantum complexity of this problem.
Next sessions
-
Endomorphisms via Splittings
Speaker : Min-Yi Shen - No Affiliation
One of the fundamental hardness assumptions underlying isogeny-based cryptography is the problem of finding a non-trivial endomorphism of a given supersingular elliptic curve. In this talk, we show that the problem is related to the problem of finding a splitting of a principally polarised superspecial abelian surface. In particular, we provide formal security reductions and a proof-of-concept[…]-
Cryptography
-