activity
20102026
most citedDecoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

65 citations · 143 across the 15 of their papers we have counts for

collaborators

16 papers

cs.CR2026

On the Maximum Toroidal Distance Code for Lattice-Based Public-Key Cryptography

Shuiyin Liu, Amin Sakzad

We propose a maximum toroidal distance (MTD) code for lattice-based public-key encryption (PKE). By formulating the encryption encoding problem as the selection of points…

cs.CR2025

Compact Lattice-Coded (Multi-Recipient) Kyber without CLT Independence Assumption

Shuiyin Liu, Amin Sakzad

This work presents a joint design of encoding and encryption procedures for public key encryptions (PKEs) and key encapsulation mechanism (KEMs) such as Kyber, without relying on t…

cs.IT2025

Joint Power and Bit Allocation for Precoded Massive MIMO Channels

Shuiyin Liu, Amin Sakzad

This work addresses the joint optimization of power and bit allocation in precoded large-scale n x n MIMO systems with discrete input alphabets, specifically QAM constellations. We…

cs.CR2024

Semi-Compressed CRYSTALS-Kyber

Shuiyin Liu, Amin Sakzad

In this paper, we investigate the communication overhead of the Kyber, which has recently been standardized by the National Institute of Standards and Technology (NIST). Given the…

cs.IT2024

CRYSTALS-Kyber With Lattice Quantizer

Shuiyin Liu, Amin Sakzad

Module Learning with Errors (M-LWE) based key reconciliation mechanisms (KRM) can be viewed as quantizing an M-LWE sample according to a lattice codebook. This paper describes a ge…

cs.IT2023★ 1 cited

Lattice Codes for CRYSTALS-Kyber

Shuiyin Liu, Amin Sakzad

This paper describes a constant-time lattice encoder for the National Institute of Standards and Technology (NIST) recommended post-quantum encryption algorithm: Kyber. The first m…

cs.IT2018★ 1 cited

Fast Decoding of Low Density Lattice Codes

Shuiyin Liu, Yi Hong, Emanuele Viterbo +2

Low density lattice codes (LDLC) are a family of lattice codes that can be decoded efficiently using a message-passing algorithm. In the original LDLC decoder, the message exchange…

cs.CR2014★ 2 cited

Unshared Secret Key Cryptography: Finite Constellation Inputs and Ideal Secrecy Outage

Shuiyin Liu, Yi Hong, Emanuele Viterbo

The Unshared Secret Key Cryptography (USK), recently proposed by the authors, guarantees Shannon's ideal secrecy and perfect secrecy for MIMO wiretap channels, without requiring se…

cs.IT2014★ 1 cited

Guaranteeing Positive Secrecy Capacity with Finite-Rate Feedback using Artificial Noise

Shuiyin Liu, Yi Hong, Emanuele Viterbo

While the impact of finite-rate feedback on the capacity of fading channels has been extensively studied in the literature, not much attention has been paid to this problem under s…

cs.CR2014

Unshared Secret Key Cryptography

Shuiyin Liu, Yi Hong, Emanuele Viterbo

Current security techniques can be implemented with either secret key exchange or physical layer wiretap codes. In this work, we investigate an alternative solution for MIMO wireta…

cs.IT2014★ 50 cited

Artificial Noise Revisited

Shuiyin Liu, Yi Hong, Emanuele Viterbo

The artificial noise (AN) scheme, proposed by Goel and Negi, is being considered as one of the key enabling technology for secure communications over multiple-input multiple-output…

cs.IT2013

Practical Secrecy using Artificial Noise

Shuiyin Liu, Yi Hong, Emanuele Viterbo

In this paper, we consider the use of artificial noise for secure communications. We propose the notion of practical secrecy as a new design criterion based on the behavior of the…

cs.IT2013

Practical Secrecy: Bridging the Gap between Cryptography and Physical Layer Security

Shuiyin Liu, Yi Hong, Emanuele Viterbo

Current security techniques can be implemented either by requiring a secret key exchange or depending on assumptions about the communication channels. In this paper, we show that,…

cs.IT2013★ 23 cited

Decoding by Sampling - Part II: Derandomization and Soft-output Decoding

Zheng Wang, Shuiyin Liu, Cong Ling

In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample cand…

cs.IT2013

Proximity Factors of Lattice Reduction-Aided Precoding for Multiantenna Broadcast

Shuiyin Liu, Cong Ling, Xiaofu Wu

Lattice precoding is an effective strategy for multiantenna broadcast. In this paper, we show that approximate lattice precoding in multiantenna broadcast is a variant of the close…

cs.IT2010★ 65 cited

Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding

Shuiyin Liu, Cong Ling, Damien Stehlé

Despite its reduced complexity, lattice reduction-aided decoding exhibits a widening gap to maximum-likelihood (ML) performance as the dimension increases. To improve its performan…