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…

The paper presents a new worst-case to average-case reduction for the Learning Parity with Noise (LPN) problem, achieving hardness for inverse-polynomial noise rates previously unattainable.

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…

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.

The paper proposes 'Explainable PQC,' a layered interpretive framework designed to structure and clarify how post-quantum cryptographic security assumptions are represented and communicated, particula…

The paper analyzes the security of the post-quantum signature scheme CROSS by showing that the underlying Restricted Syndrome Decoding problem can be reduced to both code-based and lattice-based probl…

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…

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…

The paper constructs strong cryptographic primitives, including key agreement and oblivious transfer, directly from classical tests of anti-commutation (ToNC) on quantum devices, while also developing…

The paper proposes a unified, information-theoretic framework using universal hash functions to solve the bootstrapping of seedless QRNGs and to securely combine PQC and QKD keys against quantum adver…

The paper introduces List Privacy Amplification (LPA) and proves the Quantum List Leftover Hash Lemma (QLLHL), demonstrating that it can significantly increase the achievable key length in Quantum Key…

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…

This survey provides a comprehensive review of the security challenges, threats, and mitigation strategies associated with the rapid advancement of quantum computing.

This survey provides a detailed overview of quantum adversarial machine learning, examining existing attacks, novel quantum-enhanced defense strategies, and the theoretical challenges in securing quan…

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…

The paper introduces a novel public key encryption scheme with high security by leveraging the conjectured intractability of two types of highly corrupted constraint satisfaction problems (CSPs).

The paper introduces a novel authentication-with-response scheme that halves the key consumption required for mutual authentication in Quantum Key Distribution (QKD) while maintaining unconditional se…

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.

This paper identifies new, algebraically weak classes of instances for the Linear Equivalence Problem (LEP) by generalizing techniques from the Permutation Equivalence Problem (PEP) using power codes…

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…