Pengcheng Qiu
Pengcheng Qiu has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Changzheng Wei
Ant Group
4 shared publications - Guiming Wu
Ant Group
4 shared publications - Ying Yan
Ant Group
4 shared publications Jiajie Tong
Huawei Hangzhou Research Center, NO.360, Jiangshu Road, Binjiang District, Hangzhou 310052, P.R.China
2 shared publicationsJun Wang
Huawei Hangzhou Research Center, NO.360, Jiangshu Road, Binjiang District, Hangzhou 310052, P.R.China
2 shared publications- Tingqiang Chu
Ant Group
2 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (10) , 3323-3336
WestLake: Accelerating Fully Homomorphic Encryption With Less On-Chip Memory
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (10) , 3323-3336
WestLake: Accelerating Fully Homomorphic Encryption With Less On-Chip Memory
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (1) , 1-25
ALOHA: Accelerating Leveled Fully Homomorphic Encryption with Cryptography-Specific Architectures
Fully homomorphic encryption (FHE) enables privacy-preserving computation on encrypted data but incurs prohibitive computational overhead. To reduce this overhead, leveled FHE (LFHE) limits the multiplicative depth of supported computations. However, this restriction compromises its generality, making it necessary to integrate LFHE with federated learning (FL) and secure multiparty computation (MPC). Yet these hybrid FL/MPC workflows introduce new challenges, as they require dynamic cryptographic adaptation and flexible scheduling for efficient execution. We propose ALOHA, an FPGA-based LFHE acceleration framework designed to eliminate performance and scheduling bottlenecks in hybrid workflows. ALOHA’s hardware engine efficiently directs ciphertext operations to cryptographic modular arithmetic lanes, enabling parallel computational throughput while eliminating data contention. A reconfigurable Benes network dynamically interconnects these lanes, enabling native support for FHE-specific automorphism and adaptive memory access. To bridge algorithmic flexibility with hardware efficiency, ALOHA further integrates a domain-specific compiler that automates ciphertext packing and generates latency-optimized instruction schedules. In the ablation study, the hardware and the compiler contribute 177.8× and 145.5× speedup compared to state-of-the-art solutions, respectively. In end-to-end evaluations, ALOHA accelerates complex privacy-preserving services hybrid with FL and MPC, resulting in a speedup of 2.5× and 3.3× compared to state-of-the-art accelerators.
- 22 March 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 23 (1) , 1-25
Open AccessALOHA: Accelerating Leveled Fully Homomorphic Encryption with Cryptography-Specific Architectures
Fully homomorphic encryption (FHE) enables privacy-preserving computation on encrypted data but incurs prohibitive computational overhead. To reduce this overhead, leveled FHE (LFHE) limits the multiplicative depth of supported computations. However, this restriction compromises its generality, making it necessary to integrate LFHE with federated learning (FL) and secure multiparty computation (MPC). Yet these hybrid FL/MPC workflows introduce new challenges, as they require dynamic cryptographic adaptation and flexible scheduling for efficient execution. We propose ALOHA, an FPGA-based LFHE acceleration framework designed to eliminate performance and scheduling bottlenecks in hybrid workflows. ALOHA’s hardware engine efficiently directs ciphertext operations to cryptographic modular arithmetic lanes, enabling parallel computational throughput while eliminating data contention. A reconfigurable Benes network dynamically interconnects these lanes, enabling native support for FHE-specific automorphism and adaptive memory access. To bridge algorithmic flexibility with hardware efficiency, ALOHA further integrates a domain-specific compiler that automates ciphertext packing and generates latency-optimized instruction schedules. In the ablation study, the hardware and the compiler contribute 177.8× and 145.5× speedup compared to state-of-the-art solutions, respectively. In end-to-end evaluations, ALOHA accelerates complex privacy-preserving services hybrid with FL and MPC, resulting in a speedup of 2.5× and 3.3× compared to state-of-the-art accelerators.
- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (2) , 593-605
Exa: A Unified Architecture for Multi-Scalar Multiplication and Polynomial Computation in Zero-Knowledge Proof
Zero-knowledge proof (ZKP) is a cryptographic protocol that allows a prover to convince verifiers that a computation is correctly executed without disclosing the prover’s secret. ZKP has been deployed in various privacy-preserving applications. However, the proof generation is notably inefficient on general-purpose processors. Multi-scalar multiplication (MSM) and polynomial computation (POLY), including number theoretic transform (NTT), are two of the most computation-intensive parts in proof generation. Recently, separate accelerators for MSM and POLY (mostly NTT) have been proposed. Unfortunately, separate accelerators may have poor resource utilization since MSM and POLY cannot be performed concurrently. To address this challenge, we propose Exa, a unified hardware architecture for MSM and POLY. It enables MSM and POLY to share computational resources and memory resources through decoupling dataflow control, computation, and memory. We design a novel unified functional unit (FU) array that can support both POLY operation and point addition (PADD) for MSM. In addition, we propose a 3-D NTT implementation and an adaptive MSM implementation on the FU array using a domain-specific instruction set architecture (ISA). Exa is scalable and can be efficiently orchestrated by our proposed runtime system. Compared with the separate accelerators for MSM and NTT, Exa occupies 47% less chip area. Compared to state-of-the-art accelerator PipeZK, Exa achieves up to$20.68 \times $ and$4.58 \times $ improvement for NTT and MSM, respectively, while occupying a chip area that is$2.6 \times $ smaller. For end-to-end applications, Exa can achieve a speedup of$6.5 \times $ on average than software implementation.- 23 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (2) , 593-605
Exa: A Unified Architecture for Multi-Scalar Multiplication and Polynomial Computation in Zero-Knowledge Proof
Zero-knowledge proof (ZKP) is a cryptographic protocol that allows a prover to convince verifiers that a computation is correctly executed without disclosing the prover’s secret. ZKP has been deployed in various privacy-preserving applications. However, the proof generation is notably inefficient on general-purpose processors. Multi-scalar multiplication (MSM) and polynomial computation (POLY), including number theoretic transform (NTT), are two of the most computation-intensive parts in proof generation. Recently, separate accelerators for MSM and POLY (mostly NTT) have been proposed. Unfortunately, separate accelerators may have poor resource utilization since MSM and POLY cannot be performed concurrently. To address this challenge, we propose Exa, a unified hardware architecture for MSM and POLY. It enables MSM and POLY to share computational resources and memory resources through decoupling dataflow control, computation, and memory. We design a novel unified functional unit (FU) array that can support both POLY operation and point addition (PADD) for MSM. In addition, we propose a 3-D NTT implementation and an adaptive MSM implementation on the FU array using a domain-specific instruction set architecture (ISA). Exa is scalable and can be efficiently orchestrated by our proposed runtime system. Compared with the separate accelerators for MSM and NTT, Exa occupies 47% less chip area. Compared to state-of-the-art accelerator PipeZK, Exa achieves up to$20.68 \times $ and$4.58 \times $ improvement for NTT and MSM, respectively, while occupying a chip area that is$2.6 \times $ smaller. For end-to-end applications, Exa can achieve a speedup of$6.5 \times $ on average than software implementation.- Open Access
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
MSMAC: Accelerating Multi-Scalar Multiplication for Zero-Knowledge Proof
Multi-scalar multiplication (MSM) is the most computation-intensive part in proof generation of Zero-knowledge proof (ZKP). In this paper, we propose MSMAC, an FPGA accelerator for large-scale MSM. MSMAC adopts a specially designed Instruction Set Architecture (ISA) for MSM and optimizes pipelined Point Addition Unit (PAU) with hybrid Karatsuba multiplier. Moreover, a runtime system is proposed to split MSM tasks with the optimal sub-task size and orchestrate execution of Processing Elements (PEs). Experimental results show that MSMAC achieves up to 328X and 1.96X speedups compared to the state-of-the-art implementation on CPU (one core) and GPU, respectively, outperforming the state-of-the-art ASIC accelerator by 1.79X. On 4 FPGAs, MSMAC performs 1,261X faster than a single CPU core.
- 23 June 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Open AccessMSMAC: Accelerating Multi-Scalar Multiplication for Zero-Knowledge Proof
Multi-scalar multiplication (MSM) is the most computation-intensive part in proof generation of Zero-knowledge proof (ZKP). In this paper, we propose MSMAC, an FPGA accelerator for large-scale MSM. MSMAC adopts a specially designed Instruction Set Architecture (ISA) for MSM and optimizes pipelined Point Addition Unit (PAU) with hybrid Karatsuba multiplier. Moreover, a runtime system is proposed to split MSM tasks with the optimal sub-task size and orchestrate execution of Processing Elements (PEs). Experimental results show that MSMAC achieves up to 328X and 1.96X speedups compared to the state-of-the-art implementation on CPU (one core) and GPU, respectively, outperforming the state-of-the-art ASIC accelerator by 1.79X. On 4 FPGAs, MSMAC performs 1,261X faster than a single CPU core.
- Open Access
- 12 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 1149-1159
A Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency Communications
We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations [7]–[13] improve parallelism with two approaches, i.e., multi-bit decision or reduced path splitting. In this paper, we combine the two procedures into one with an error-pattern-based architecture. It simultaneously generates a set of candidate paths for multiple bits with pre-stored patterns. For rate-1 (R1) or single parity-check (SPC) nodes, we prove that a small number of deterministic patterns are required to guarantee performance preservation. For general nodes, low-weight error patterns are indexed by syndrome in a look-up table and retrieved in O(1) time. The proposed flip-syndrome-list (FSL) decoder fully parallelizes all constituent code blocks without sacrificing performance, thus is suitable for ultra-low-latency applications. Meanwhile, two code construction optimizations are presented to further reduce complexity and improve performance, respectively.
- 12 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 1149-1159
Open AccessA Flip-Syndrome-List Polar Decoder Architecture for Ultra-Low-Latency Communications
We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations [7]–[13] improve parallelism with two approaches, i.e., multi-bit decision or reduced path splitting. In this paper, we combine the two procedures into one with an error-pattern-based architecture. It simultaneously generates a set of candidate paths for multiple bits with pre-stored patterns. For rate-1 (R1) or single parity-check (SPC) nodes, we prove that a small number of deterministic patterns are required to guarantee performance preservation. For general nodes, low-weight error patterns are indexed by syndrome in a look-up table and retrieved in O(1) time. The proposed flip-syndrome-list (FSL) decoder fully parallelizes all constituent code blocks without sacrificing performance, thus is suitable for ultra-low-latency applications. Meanwhile, two code construction optimizations are presented to further reduce complexity and improve performance, respectively.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A 5.16Gbps decoder ASIC for Polar Code in 16nm FinFET
Polar codes has been selected as 5G standard. However, only a couple of ASIC featuring decoders are fabricated, and none of them support list size L > 4 and code length N > 1024. This paper presents an ASIC implementation of three decoders for polar code: successive cancellation (SC) decoder, flexible decoder and ultra-reliable decoder. These decoders are all SC based decoder, supporting list size up to 1,8,32 and code length up to 2 15 ,2 14 ,2 11 respectively. This chip is fabricated in a 16nm TSMC FinFET technology, and can be clocked at 1 Ghz. Optimization techniques are proposed and employed to increase throughput. Experiment result shows that the throughput can achieve up to 5.16Gbps. Compared with fabricated AISC decoder and synthesized decoder in literature, the flexible decoder achieves higher area efficiency.
- 1 August 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
A 5.16Gbps decoder ASIC for Polar Code in 16nm FinFET
Polar codes has been selected as 5G standard. However, only a couple of ASIC featuring decoders are fabricated, and none of them support list size L > 4 and code length N > 1024. This paper presents an ASIC implementation of three decoders for polar code: successive cancellation (SC) decoder, flexible decoder and ultra-reliable decoder. These decoders are all SC based decoder, supporting list size up to 1,8,32 and code length up to 2 15 ,2 14 ,2 11 respectively. This chip is fabricated in a 16nm TSMC FinFET technology, and can be clocked at 1 Ghz. Optimization techniques are proposed and employed to increase throughput. Experiment result shows that the throughput can achieve up to 5.16Gbps. Compared with fabricated AISC decoder and synthesized decoder in literature, the flexible decoder achieves higher area efficiency.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Field trial on TDD massive MIMO system with polar code
A large scale field trial is conducted to investigate the integrated performance of massive multiple-input multiple-output (MIMO) and polar code, which are two key technologies for 5th generation (5G) mobile system. A more simple and effective algorithm named polarization weight (PW) is used in polar construction. Based on uplink and downlink channel reciprocity in the time-division duplex (TDD) mode, the practical performance of single user (SU) massive MIMO prototype with 64 independent RF channels and 200 MHz bandwidth is investigated under different user equipment (UE) deployments, different layer numbers and moving speeds. Compared to massive MIMO with turbo code, it is shown that significant performance gains can be obtained in TDD massive MIMO system with polar code. For 3 layers scheduled in massive MIMO system with polar code, the maximum user throughput of 1.64 Gbps and spectrum efficiency of 11.64 bit/s/Hz can be achieved. Based on these observations, the feasibility and performance of TDD massive MIMO system with polar code are verified.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Field trial on TDD massive MIMO system with polar code
A large scale field trial is conducted to investigate the integrated performance of massive multiple-input multiple-output (MIMO) and polar code, which are two key technologies for 5th generation (5G) mobile system. A more simple and effective algorithm named polarization weight (PW) is used in polar construction. Based on uplink and downlink channel reciprocity in the time-division duplex (TDD) mode, the practical performance of single user (SU) massive MIMO prototype with 64 independent RF channels and 200 MHz bandwidth is investigated under different user equipment (UE) deployments, different layer numbers and moving speeds. Compared to massive MIMO with turbo code, it is shown that significant performance gains can be obtained in TDD massive MIMO system with polar code. For 3 layers scheduled in massive MIMO system with polar code, the maximum user throughput of 1.64 Gbps and spectrum efficiency of 11.64 bit/s/Hz can be achieved. Based on these observations, the feasibility and performance of TDD massive MIMO system with polar code are verified.