Shaping Postquantum Cryptography: The Hidden Subgroup and Shift Problems
The security of popular public key-cryptographic protocols, such as RSA, Diffie–Hellman key exchange and the digital signature algorithm (DSA), is endangered by the advent of quantum computers. Shor brought a big breakthrough with his quantum algorithm that can be used to factor an arbitrarily large integer into the product of its prime factors, hence jeopardizing the security of RSA, and that at the same time also solves the Discrete Logarithm Problem, which raises issues for certain Diffie–Hellman-based cryptosystems and digital signatures. It is hence crucial to upgrade our current tools for postquantum cryptography: it should be infeasible, even using quantum algorithms, to break the new cryptosystems. Popular candidates include for example elliptic curve or lattice-based cryptography, but they share something in common: they are specific cases of the more general Hidden Subgroup and connected Hidden Shift Problem.
Related Articles
Conservation Laws and Quantum Error Correction: Toward a Generalized Matching Decoder
Decoding algorithms are essential to fault-tolerant quantum-computing architectures. In this perspective we explore decoding algorithms for the surface code;...
Special Issue on Quantum Computation and Quantum Information
Quantum information was once a niche domain focused on foundational questions. It has grown into a broad research area with industrial, academic, and national research efforts around the world, but many foundational questions remain. The special issue papers consider cryptography and error correction from the viewpoint of quantum information and computation.
A Playful Sketch of the Quantum Cryptography Protocol BB84 [About the Cover]
This drawing was a blueprint for a small quilt that was added to the mathematics/art installation Mathemalchemy (about which more information can be found at mathemalchemy.org).
