Quantum computers represent a significant threat to the security of current public-key cryptographic systems. Postquantum cryptographic schemes, which are conjectured to be resistant to quantum attacks, are being actively developed. Among these, lattice-based cryptography has emerged as a prominent candidate, relying on the computational hardness of problems such as the shortest vector problem (SVP) for its security. In this paper, we propose a quantum approach that translates lattice enumeration into a quantum computing framework, which utilizes amplitude amplification to speed up the search process and pruning constraints to reduce unnecessary search space. This approach significantly lowers time complexity and improves performance, especially when solving the SVP in two variations of lattice enumeration. The effectiveness and efficiency of our approach are validated through small-scale simulations, which demonstrate notable speed improvements.

Close

PrevNext

View figure in article

• Quantum algorithms & computation
• Quantum information processing
• Quantum simulation