Quantum
Birthday-Scale Non-Adaptive Security for Strong Pseudorandom Unitaries
Publication: quant-ph updates on arXiv.org
Author: Zvika Brakerski, Lior Ozer, Shahar Silberstein
Source published: 20/11/2026, 05:00:00 UTC
Briefing created: 20/11/2026, 05:29:23 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 20/11/2026, 05:13:24 UTC.
Briefings
A new quantum cryptographic proof establishes birthday-scale non-adaptive security for a DPFC strong pseudorandom unitary candidate. The study demonstrates that the candidate withstands approximately the square root of the dimension N queries, matching the best known query complexity for non-strong PRUs. The proof combines the EPR-sector decomposition technique with a path-recording framework, offering a significant improvement over previous adaptive security bounds.
Key points
- The DPFC (Clifford-Phase-Permutation-Clifford) strong PRU candidate withstands approximately t ≈ sqrt(N) queries, matching the best known query complexity for non-strong PRUs.
- The proof utilizes the EPR-sector decomposition of Schuster et al. (arXiv 2025) and the path-recording framework of Ma and Huang (STOC 2025) to establish this security bound.
Context
This research addresses the security of pseudorandom unitaries in quantum cryptography, specifically for the DPFC candidate. The findings are critical for evaluating the robustness of quantum cryptographic protocols that rely on strong pseudorandomness against adversaries with access to all unitary operations.
Limitations
The study provides a non-adaptive security bound for t ≈ sqrt(N) queries and an upper bound showing the candidate fails for t >> sqrt(N). The proof relies on specific techniques from prior works and does not address adaptive security in the same manner. The evidence is limited to the non-adaptive setting and does not cover all possible query types or adversary capabilities beyond the specified access model.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 20/11/2026, 05:29:23 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeifnhzf7yqf322pnln66nrfkqhmy3omfsvjwajcxfdzjyfutlplgnm