Quantum One-Way Functions and Related Cryptographic Primitives

arXiv:2608.05754 · quant-ph, cs.CR, math-ph, math.MP · Submitted 2026-08-06 · Read on arXiv

Georgios M. Nikolopoulos

quant-ph, cs.CR, math-ph, math.MP

Submitted: 2026-08-06

Updated: 2026-08-21

Comments: Topical Review

Journal ref: New J. Phys. (2026)

DOI: 10.1088/1367-2630/ae958e

Project page: https://sattath.github.io/microcrypt-zoo

License: http://creativecommons.org/licenses/by/4.0/

The gist: Quantum cryptographic primitives beyond key distribution remain a less well understood area of research.

Terminology

Abstract

Quantum cryptographic primitives beyond key distribution remain a less well understood area of research. In classical cryptography, one-way functions underpin nearly all standard cryptographic protocols, motivating the search for meaningful quantum analogues and for a clear understanding of the physical and computational mechanisms that could enforce one-wayness. In this article, we review quantum one-way functions and a range of closely related quantum-state primitives, including one-way state generators, pseudorandom quantum states, and efficiently indistinguishable pairs of states. We discuss both computational and information-theoretic notions of quantum one-wayness, emphasizing the different adversarial models and security assumptions that underlie these constructions. We compare and contrast the various proposed primitives, and clarify their conceptual relationships. Particular emphasis is placed on questions of physical realizability, experimental feasibility, and robustness to noise. Finally, we outline open problems and future directions toward the development of practical quantum cryptographic primitives beyond key distribution, and the emergence of a broader quantum-cryptographic ecosystem.

Sources

Related papers