~ similar to 2603.23230v2· 20 results
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.
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…
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…
The paper analyzes subcodes of lambda-Gabidulin codes to construct highly efficient McEliece-like and Niederreiter-like cryptosystems, demonstrating that random subcodes of classical Gabidulin codes y…
The paper establishes that the existence of many-time secure uncloneable encryption (UCE) can be shown to follow from relatively weak assumptions, such as the existence of many-time secure symmetric k…
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).
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…
The paper systematically investigates the conditions under which linear layers in AES-like ciphers avoid related-differential structures, proving that the MDS property is necessary and identifying spe…
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 introduces an LLM-guided evolutionary workflow that successfully discovers and certifies a large number of novel bivariate quantum error-correcting codes, demonstrating the utility of LLMs i…
This paper demonstrates that Simple Power Analysis (SPA) can successfully extract secret session key bits from post-quantum cryptosystems, specifically during the key decapsulation phase, using only a…
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…
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 proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random code…
The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…
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 proposes 'Explainable PQC,' a layered interpretive framework designed to structure and clarify how post-quantum cryptographic security assumptions are represented and communicated, particula…
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…
This paper characterizes the graph structure, including cycle and path lengths, of Chebyshev permutation polynomials over the ring $\mathbb{Z}_{2^{k_1}3^{k_2}}$, demonstrating strong regularities desp…