Liang Kong

Liang Kong

Auto-generated profile, based on publicly available information

Liang Kong

School of Integrated Circuits, Tsinghua University, Beijing, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 August 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
WGWenbo Guo
Wenbo Guo
SLShuguo Li
Shuguo Li
LKLiang Kong
Liang Kong
Quantum algorithms pose a huge threat to the current cryptosystems. In this article, we present a hardware implementation of CRYSTALS-KYBER which is one of the post-quantum cryptosystems based on the Module-LWE problem. Using the proposed modular reduction algorithm, modified modular adder and the reconfigurable data path, the design shares the computing resource for different polynomial related operations, and achieves higher degree of parallelism. Our design is implemented on a Xilinx Artix-7 FPGA. Compared with the leading hardware implementations, our design is more compact, the execution time is shorter, and it significantly consumes fewer registers.

9 June 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LKLiang Kong
Liang Kong
SLShuguo Li
Shuguo Li
RLRuirui Liu
Ruirui Liu
Discrete Gaussian distribution plays an essential role in lattice cryptography whereas naive implementations suffer from timing attacks. Unfortunately, conversion to secure constant-time variant incurs severe deterioration in performance. In Knuth-Yao sampling, we demonstrate several properties of the discrete distribution generation tree involving structural features and finite node height. Accordingly we propose a generic method independent of standard deviations, which focuses on minimizing the Boolean expressions for the mapping from input bit strings to output sample values, along with an in-depth efficiency analysis. Two optimization techniques are devised to further propel the minimization by replacing and adjusting nodes. To strike the balance of computational overhead and closeness to optimum, heuristic strategies are introduced. Finally, performance evaluation is conducted both in software and hardware. Running on a 3.4GHz Intel Core i7-6700 processor, our method improves sampling rate by up to 29.5% compared to the latest technique. Targeting hardware FPGA devices, our approach can be 2.7 times faster and achieves 57.3% resource reduction than the original constant-time Knuth-Yao sampling. Compared to the Cumulative Distribution Table algorithm with fixed step binary search, our sampler can be at least 12.6 times faster and gains 79%/61% better area-time product than its counterpart without/with BRAM.

24 October 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
LKLiang Kong
Liang Kong
GQGuojie Qin
Guojie Qin
SLShuguo Li
Shuguo Li
In this brief, we present computational fusions with Residue Number System (RNS) basis transforms to enhance computational efficiency. We also investigate the impact of the word length of RNS primes for the leveled BFV scheme. Moreover, the method of dedicated acceleration for the critical subroutine is proposed. Based on these optimizations, an efficient accelerator for the leveled BFV scheme is accomplished on Virtex-7 FPGA. Compared to latest works, our design achieves 1.6 times speedup and 1.4×–2.6× area-time-product improvements.

14 November 2026
Verified
Conference Paper
Open access
JYJiangrui Yu
Jiangrui Yu
BZBaosheng Zhang
Baosheng Zhang
LKLiang Kong
Liang Kong
LDLin Ding
Lin Ding
YCYi Chen
Yi Chen
MLMeng Li
Meng Li