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 presents two new attacks on decisional $k$-sparse LWE and LPN problems for higher moduli $q$ by generalizing the Kikuchi method using graph theory.

This paper improves machine learning attacks against the Learning with Errors (LWE) problem by demonstrating that using larger, repeated datasets and a stepwise regression technique allows for the rec…

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 refutes Steurer's conjecture regarding the existence of large constant-separated sets within families of unit-norm vectors with low average correlation, using high-dimensional expanders to s…

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…

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

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 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 analyzes low-degree estimation thresholds for recovering hidden signals in planted hypergraphs and tensor PCA, establishing sharp phase transitions and providing polynomial-time recovery alg…

The paper establishes information-theoretic lower bounds for stochastic optimization using low-bit gradients by reducing the problem to compressed Gaussian mean estimation, yielding sharp bounds on co…

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 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 formally proves a theorem regarding adversarial noise amplification and proposes a novel, lightweight detection mechanism that uses this enhanced signal for robust adversarial defense.

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 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 addresses secure distributed hypothesis testing, proving impossibility in the standard setting and achieving secure testing for simple and general classes by incorporating a shared secret ke…

The paper introduces Sparse Backdoor, a novel supply-chain attack that embeds a provably undetectable backdoor into pre-trained image classifiers by injecting structured sparse perturbations.