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 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…

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 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.

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 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 introduces the base-m length codec, a canonical and robust encoding scheme that maps byte strings to lists of residues modulo m, essential for finite-ring cryptosystems.

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 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 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.

The paper analyzes the security limits of verifiable decapsulation tests for Key Encapsulation Mechanisms (KEMs), establishing that the list-hit event is the primary black-box obstruction and deriving…

The paper proposes using Merkle Tree Certificates (MTC) to create a post-quantum Public Key Infrastructure (PKI) for Kubernetes and 5G/6G core networks, significantly reducing the overhead associated…

The paper demonstrates that encoding harmful prompts as genuine mathematical problems, rather than just using mathematical formatting, effectively bypasses the safety filters of large language models.

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 paper quantifies the latency impact of increasing certificate chain sizes required by Post-Quantum Cryptography (PQC) on TLS Time to First Byte (TTFB), finding that Merkle Tree Certificates (MTC)…

This paper experimentally compares ML-DSA and SLH-DSA in TLS 1.3, finding that placing SLH-DSA at the server leaf significantly increases computational cost and latency, suggesting upper-layer placeme…

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 reveals that predictable nonce reuse by Polygon MEV searchers creates a critical vulnerability in ECDSA signatures, allowing passive attackers to recover private keys using linear algebra.

This paper proves that the per-observation leakage bound for deep, multi-stage masked Number Theoretic Transform (NTT) pipelines remains constant and low ($2/q$), regardless of the pipeline's depth ($…