Thang Xuan Pham

Thang Xuan Pham

Auto-generated profile, based on publicly available information

Thang Xuan Pham

Department of Information and Communication Engineering, Inha University, Incheon, South Korea

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
28 September 2023 in IEEE Transactions on Circuits and Systems I: Regular Papers
Verified
Journal Article
Open access
TPThang Xuan Pham
Thang Xuan Pham
PDPhap Ngoc Duong
Phap Ngoc Duong
Hanho LeeHanho Lee
Hanho Lee
The CRYSTALS-Dilithium protocol is considered as one of the most promising digital signature schemes in NIST’s post-quantum cryptography standardization process. While separating arithmetic computation units can be advantageous in some cases, it can lead to increased hardware resource consumption and performance degradation. To overcome this issue, this paper proposes a novel architecture called the Unified Polynomial Arithmetic Unit (UniPAU), specifically designed for the Dilithium signature scheme. The proposed UniPAU offers a unique hardware module that can execute all the polynomial operations required for the Dilithium signature scheme. To demonstrate the effectiveness of our design, we implemented it on the Xilinx Zynq UltraScale+ ZCU102 (xczu9eg-ffvb1156-2-e) FPGA platform and evaluated its hardware efficiency and performance. Our implementation results indicate that the proposed UniPAU can achieve comparable throughput while consuming fewer hardware resources compared to state-of-the-art studies. These findings suggest that our UniPAU can provide an optimized and efficient hardware solution for polynomial arithmetic operations in the Dilithium signature scheme.

21 October 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
TPThang Xuan Pham
Thang Xuan Pham
Hanho LeeHanho Lee
Hanho Lee
Trellis min-max algorithm based nonbinary low-density parity-check (NB-LDPC) decoders with compressed messages offer promising performance compared with their conventional counterparts. Recent studies have shown that reducing check-node output information to a set of four most reliable intrinsic messages strikes a balance between the hardware complexity and error-correcting performance of the decoder. Therefore, an efficient architecture to find the first four minimum values (F4M) from a given set of values is greatly required. This brief proposes an algorithm to derive F4M from two four-sorted sequences, with subsequent efficient tree structure based architecture to construct the F4M finder. To demonstrate the hardware efficiency, the proposed F4M finder architecture implementations using TSMC 90-nm CMOS technology were conducted. Experimental results confirmed that the latency of the proposed F4M finder was approximately halved compared with that of design in the state-of-the-art work. In particular, the proposed F4M finder architecture can be adopted to further improve the performance of the NB-LDPC decoders.

31 January 2023 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
TPThang Xuan Pham
Thang Xuan Pham
TNTuy Tan Nguyen
Tuy Tan Nguyen
Hanho LeeHanho Lee
Hanho Lee
Limitations on hardware resource consumption and throughput make the use of non-binary low-density parity-check (NB-LDPC) codes challenging in practical applications. This paper first proposes a novel check-node (CN) decoding algorithm called Hamming-distance trellis min-max (H-TMM) to reduce the complexity introduced by searching for two minimum values in previous TMM-based algorithms. Then, by taking advantage of the proposed algorithm and the number appearances of reliable values, a high-performance H-TMM-based NB-LDPC decoder architecture is presented. Experiments on the 32-ary (837, 726) NB-LDPC code confirmed that the proposed decoder can obtain a high throughput on less hardware resources compared with the state-of-the-art works while maintaining a competitive error-correcting performance. In particular, the proposed CN unit architecture reduced hardware resources by almost half compared to that in the latest decoder.