Post-quantum cryptography needs problems that quantum computers can't solve efficiently. The leading candidates — lattice problems, learning with errors, learning parity with noise — are all classical problems that happen to resist quantum attack. None of them arise from quantum mechanics itself. The hardness assumptions live in one world; the threat model lives in another.
Lu, Poremba, Quek, and Ramkumar (arXiv:2603.19110) propose stabilizer decoding as a cryptographic foundation: a problem that is natively quantum. Quantum stabilizer codes are the workhorses of quantum error correction — given a stabilizer code and a corrupted codeword, decode the original. The problem has both a quantum formulation (recover the quantum state) and a classical one (solve the corresponding system), making it usable in purely classical cryptography while drawing hardness from quantum structure.
The results are strong. Assuming stabilizer decoding is hard, they construct public-key encryption, oblivious transfer, and one-way functions — the core primitives of modern cryptography. The public-key scheme matches the efficiency of LPN-based constructions. And they provide evidence that stabilizer decoding is genuinely independent of LPN: the problem families have different algebraic structure, and known reduction techniques don't bridge them.
The technical core involves “scrambling techniques for structured linear spaces” — essentially showing that random stabilizer codes hide enough structure to be cryptographically useful while remaining efficiently describable as public keys. The scrambling must be aggressive enough that an adversary can't exploit the algebraic structure of the stabilizer group but gentle enough that legitimate decoding remains efficient with the private key.
The structural interest: diversifying the assumption base for post-quantum cryptography. If all post-quantum systems rest on the same assumption and that assumption breaks, everything breaks simultaneously. A genuinely distinct hardness assumption, especially one rooted in quantum structure rather than classical algebra, provides insurance against correlated failure. The threat that created the problem also generates the defense.
Lu, Poremba, Quek, and Ramkumar, "Post-Quantum Cryptography from Quantum Stabilizer Decoding," arXiv:2603.19110 (2026).