ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

~ similar to 2606.05527v1· 20 results

quant-phcs.CRRecentMar 19, 2026

Post-Quantum Cryptography from Quantum Stabilizer Decoding

Jonathan Z. Lu, Alexander Poremba, Yihui Quek, Akshar Ramkumar

The paper proposes that decoding random quantum stabilizer codes is a robust, novel post-quantum cryptographic assumption, demonstrating that its average-case hardness implies core primitives like PKE…

View →
quant-phcs.CRRecentMay 6, 2026

Fundamental Limitations of Post-Quantum Cryptographic Architectures

Jiho Jung, Donghwa Ji, Mingyu Lee, Kabgyun Jeong

The paper argues that current lattice-based post-quantum cryptography, which relies on injecting noise, is not unconditionally secure because advanced quantum error correction and learning techniques…

View →
quant-phcs.CRRecentApr 17, 2026

Quantum-Resistant Quantum Teleportation

Xin Jin, Nitish Kumar Chandra, Mohadeseh Azari, Jinglei Cheng +3 more

The paper proposes a quantum-resistant quantum teleportation (QRQT) framework using post-quantum cryptography to secure the classical channel, establishing maximum secure communication distances and a…

View →
cs.CRRecentApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

View →
quant-phcs.CRRecentMay 13, 2026

Backdoor Threats in Variational Quantum Circuits: Taxonomy, Attacks, and Defenses

Lei Jiang, Fan Chen

This paper surveys the security vulnerabilities of Variational Quantum Circuits (VQCs) to backdoor attacks, detailing various attack mechanisms and analyzing current detection and defense strategies.

View →
cs.CRRecentMay 5, 2026

Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices

Elisa Bertino, Ramana Kompella, Ashish Kundu, Cristina Nita-Rotaru +2 more

This paper provides a comprehensive, system-level taxonomy for designing quantum-resistant network architectures, moving beyond simple protocol substitutions to address key distribution and management…

View →
cs.CRcs.SEquant-phRecentApr 8, 2026

Broken Quantum: A Systematic Formal Verification Study of Security Vulnerabilities Across the Open-Source Quantum Computing Simulator Ecosystem

Dominik Blain

The paper presents Broken Quantum, a comprehensive formal security audit that identifies 547 security vulnerabilities across 45 open-source quantum computing simulators, revealing critical flaws in me…

View →
quant-phcs.CRRecentMay 29, 2026

Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure

Alexandru Gheorghiu

The paper constructs a family of simple quantum states (pseudoentangled states) generated by constant-depth circuits that exhibit non-trivial entanglement structure, demonstrating that entanglement st…

View →
cs.CRcs.ITcs.LGRecentApr 8, 2026

Evaluating PQC KEMs, Combiners, and Cascade Encryption via Adaptive IND-CPA Testing Using Deep Learning

Simon Calderon, Niklas Johansson, Onur Günlü

The paper proposes using deep learning to empirically test the indistinguishability of various post-quantum and hybrid cryptographic schemes, finding that no tested combination showed a significant ad…

View →
cs.CRcs.NIRecentApr 9, 2026

Post-Quantum Cryptographic Analysis of Message Transformations Across the Network Stack

Ashish Kundu, Vishal Chakraborty, Ramana Kompella

The paper proposes a formal framework to analyze how the combined cryptographic transformations across all layers of a network stack determine the overall post-quantum security posture of a message.

View →
quant-phcs.CRRecentApr 26, 2026

Efficient Quantum Fully Homomorphic Encryption

Fengxia Liu, Zixian Gong, Kun Tian, Yi Zhang +2 more

The paper introduces a unified framework for Quantum Fully Homomorphic Encryption (QFHE) that achieves exponential efficiency improvements by integrating a novel modular arithmetic program (MAP) tailo…

View →
quant-phcs.CRRecentMay 14, 2026

Toward Covert Quantum Computing

Evan J. D. Anderson, Kaushik Datta, Boulat A. Bash

The paper introduces covert quantum computing, a framework to ensure privacy in multi-tenant quantum cloud environments, and finds that while local crosstalk is limited, long-range coupling effects cr…

View →
quant-phcs.CRmath.CORecentMay 17, 2026

Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics

Ming-Xing Luo

This paper presents a quantum attack on Module-LWE based lattice schemes like ML-KEM, demonstrating a polynomial-time quantum algorithm with a high success probability.

View →
cs.CRRecentApr 27, 2026

Machine-Checked Cardinality Bounds for Masked Barrett Reduction: A 1-Bit Side-Channel Leakage Barrier in Post-Quantum Cryptographic Hardware

Ray Iskander, Khaled Kirah

The paper establishes a universal, machine-checked 1-Bit Barrier for the internal wire map of masked Barrett reduction, providing a strong side-channel leakage bound for post-quantum cryptography.

View →
quant-phcs.CRRecentApr 2, 2026

Topology-Hiding Path Validation for Large-Scale Quantum Key Distribution Networks

Stephan Krenn, Omid Mir, Thomas Lorünser, Sebastian Ramacher +1 more

The paper proposes a provably secure path validation protocol for large-scale Quantum Key Distribution (QKD) networks that allows receivers to verify network compliance without revealing sensitive top…

View →
cs.CRquant-phRecentMay 21, 2026

A Formal Basis for Quantum Cryptographic Exposure Measurement under HNDL Threat

Matheus Rufino, Rafael Duarte Marcelino, Julio Smanioto Garcia

The paper develops a structurally justified framework for measuring Quantum Cryptographic Exposure (HNDL) by showing that the compromise probability factorizes into distinct, interacting components ba…

View →
cs.CRcs.ITquant-phRecentApr 24, 2026

Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection

Ming-Xing Luo

This paper extends quantum lattice reduction techniques (CDPR) from ideal to module lattices over cyclotomic rings, achieving a constant module reduction factor and providing a rigorous, bounded-preci…

View →
quant-phcs.CRRecentMay 11, 2026

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem

Zvika Brakerski, Henry Yuen

The paper establishes a strong connection between scalable pseudorandom unitaries (PRUs) and the unitary synthesis problem, proving that any such PRU construction must require a classical oracle of si…

View →
cs.CRcs.AIRecentMay 27, 2026

Quantum-Enhanced Adversarial Robustness in Artificial Intelligence

Jaydip Sen

The paper reviews adversarial machine learning vulnerabilities and proposes conceptual frameworks for enhancing AI robustness by integrating quantum computing techniques.

View →
cs.CRcs.AIRecentMay 27, 2026

Quantum-Enhanced Adversarial Robustness in Artificial Intelligence

Jaydip Sen

The paper reviews the vulnerability of AI to adversarial attacks and proposes conceptual frameworks for enhancing AI robustness by integrating quantum computing techniques.

View →