Skip to content
Preprint

Need for Coherent Access in Constructing Quantum Cryptography

Sep 2026 · 0 citations · 39 references
Physics Computer Science

TL;DR

It is shown that fully black-box PRS length extension from logarithmic to superlogarithmic output length must use coherent access to the underlying short PRS, giving an oracle separation between classically accessible logarithmic length PRFSs and superlogarithmic length PRSs.

Abstract

We construct quantum oracles relative to which quantum-secure one-way functions (OWFs) exist but pseudorandom states (PRSs) with superlogarithmic output length do not. At first glance, this appears to contradict the known black-box constructions of PRS generators from quantum-secure OWFs. The distinction lies in the access model to the oracles; our oracle separation uses \emph{classical-accessible} random oracles that can be accessed only classically even by quantum algorithms. In fact, our impossibility of PRSs applies to \emph{any} classically accessible classical oracle in place of the random oracle, while keeping the other oracle component unchanged, showing the need for coherent access in constructing PRSs. We further show that logarithmic output length pseudorandom function-like states (PRFSs) exist relative to our oracles, giving an oracle separation between classically accessible logarithmic length PRFSs and superlogarithmic length PRSs. This shows that fully black-box PRS length extension from logarithmic to superlogarithmic output length must use coherent access to the underlying short PRS.

View source

Similar papers

Preprint Oct 2026

How to Build Pseudorandom Unitaries in Microcrypt

We provide the first evidence relative to a classical oracle that pseudorandom unitaries (PRUs) can exist without quantum-computable one-way functions. To obtain this result, we first prove that five independent random diagonal phase layers interleaved with Hadamard transforms \[ U=F_5HF_4HF_3HF_2HF_1 \] form a strong...

Aditya Gulati, Dakshita Khurana, Kabir Tomer · 0 citations
Preprint Sep 2026

Derivatives of Quantum Randomness: Separating Pseudorandom Unitaries from Pseudorandom (Function-like) States

Quantum computation gives rise to new pseudorandom primitives for states and unitaries, including pseudorandom state generators (PRSGs), pseudorandom function-like state generators (PRFSGs), and pseudorandom unitaries (PRUs). In this paper, we show a full unitary oracle separation between PRFSGs and PRUs. The separatio...

Minki Hhan · 1 citation
Preprint Oct 2026

Protecting Quantum Computers against Untrusted Users

It is shown that security of the restricted model of computation, 1/2BQP_1, is built on not only classical hardness for factoring, but also conjectured circuit lowerbounds for rational reconstruction, which permits arbitrary circuits and system sizes.

S. A. Yadavalli, Joel Rajakumar, A. Schuckert et al. · 2 citations
Preprint Sep 2026

Beyond NISQ Assumptions: One-time Memory in the Classically Accessible Random-Oracle Model

This work adapts the classically accessible random oracle model (CAROM) as in [BDF+11] and [AK22], in which adversaries are only allowed to classically query the random oracle, and shows that an efficient simulation-secure one-time memory (OTM) is possible under CAROM.

Bo-Yang Chen, Tian-Ren Liu, Luo-Ji Wei · 0 citations
Preprint Sep 2026

How Not to Build Microcrypt

A key challenge in quantum cryptography is to build quantum one-wayness and pseudorandomness without the use of (quantum computable) one-way functions. So far, this has turned out to be a difficult task, with only a few proposed candidates that are not directly built from one-way functions. Even within these few propos...

Aditya Gulati, Dakshita Khurana, Kabir Tomer · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.