Lattice reduction does not change the solution vector for many algorithms in vector perturbation precoding due to a unique lattice structure, and LLL-aided nearest plane methods do not beat conventional THP under mutual information.
Lattice basis reduction: Improved practical algorithms and solving sub- set sum problems
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Restricted Syndrome Decoding reduces to Regular Syndrome Decoding and Closest Vector Problem via structured low-norm vectors in constructed codes, broadening attacks on the CROSS signature scheme.
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.
citing papers explorer
-
Is Lattice Reduction Necessary for Vector Perturbation Precoding?
Lattice reduction does not change the solution vector for many algorithms in vector perturbation precoding due to a unique lattice structure, and LLL-aided nearest plane methods do not beat conventional THP under mutual information.
-
Cross-Paradigm Models of Restricted Syndrome Decoding with Application to CROSS
Restricted Syndrome Decoding reduces to Regular Syndrome Decoding and Closest Vector Problem via structured low-norm vectors in constructed codes, broadening attacks on the CROSS signature scheme.
-
Explainable PQC: A Layered Interpretive Framework for Post-Quantum Cryptographic Security Assumptions
A layered framework is defined to interpret post-quantum cryptographic security assumptions through complexity models, combinatorial Hodge theory on lattices, and Julia-based lattice reduction experiments.