On Gaussian Sampling for -ary Lattices and Linear Codes with Lee Weight
MF Bollauf, M Lie, C Ling - Cryptology ePrint Archive, 2025 - eprint.iacr.org
We show that discrete Gaussian sampling for a $ q $-ary lattice is equivalent to codeword
sampling for a linear code over $\mathbb {Z} _q $ with the Lee weight. This insight allows us …
sampling for a linear code over $\mathbb {Z} _q $ with the Lee weight. This insight allows us …
Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems
AL Horlemann, K Khathuria, M Newman… - arXiv preprint arXiv …, 2024 - arxiv.org
Post-quantum cryptography has gained attention due to the need for secure cryptographic
systems in the face of quantum computing. Code-based and lattice-based cryptography are …
systems in the face of quantum computing. Code-based and lattice-based cryptography are …
Short Lee-Metric Code-Based Signature
CH Tan, TF Prabowo - 2024 1st International Conference On …, 2024 - ieeexplore.ieee.org
Since the first Lee-metric signature scheme FuLeeca has been broken, it is challenging to
construct a Lee-metric signature scheme. In this paper, we construct a new Lee-metric code …
construct a Lee-metric signature scheme. In this paper, we construct a new Lee-metric code …