Two quantum Ising algorithms for the shortest-vector problem
David Joseph, Adam Callison, Cong Ling, Florian Mintert
Abstract
Traditional public key cryptography will become obsolete when quantum computers are able to break it. The authors propose two quantum algorithms to solve the shortest-vector problem, which could play an important role in designing new cryptosystems for the postquantum era.
Topics & Concepts
Public key cryptosystemComputer scienceCryptosystemQuantumLattice problemQuantum computerAlgorithmCryptographyQuantum algorithmPublic-key cryptographyKey (lock)Theoretical computer scienceQuantum cryptographyEncryptionQuantum informationPhysicsComputer securityQuantum mechanicsQuantum Computing Algorithms and ArchitectureQuantum Information and CryptographyChaos-based Image/Signal Encryption