Guang Fan
Research Subjects
Guang Fan has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Mingzhe Zhang
Institute of Information Engineering, CAS
6 shared publications - Shoumeng Yan
Ant Group
6 shared publications - Shengyu Fan
State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, CAS, China
5 shared publications - Xianglong Deng
State Key Laboratory of Cyberspace Security Defense, Institute of Information Engineering, CAS, China
5 shared publications - Fangyu Zheng
School of Cryptology, University of Chinese Academy of Sciences, Beijing, China
4 shared publications - Yilan Zhu
Ant Group, China
4 shared publications
Latest Publications
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
OmniCifro: A Heterogeneous Acceleration System with PIM for Encrypted Computation
Fully Homomorphic Encryption (FHE) offers unparalleled data security guarantees for privacy-sensitive applications, but its widespread adoption is hindered by prohibitively high computation and memory capacity overheads compared to conventional computation on plaintext data. These inefficiencies create critical performance bottlenecks, limiting FHE’s practicality in real-world scenarios. To enhance performance, we systematically characterize FHE workloads, noting that existing accelerators struggle with state-of-the-art FHE schemes due to bandwidth constraints and the diverse computation patterns of different FHE primitives. In this work, we propose OmniCifro, a heterogeneous FHE acceleration framework that addresses performance bottlenecks through architectural design and dataflow optimization. OmniCifro combines a specialized Homomorphic Processing Unit (HPU) for compute-intensive kernels with Processing-in-Memory (PIM) modules for memory-bound operations, featuring dedicated functional units for polynomial arithmetic and element-wise operations. We further optimize the kernel mapping strategy for advanced FHE algorithms to reduce communication overhead between HPU and PIM. Experimental evaluations demonstrate that OmniCifro achieves a 1.6× performance improvement over ARK.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. PP (02780070) , 1
OmniCifro: A Heterogeneous Acceleration System with PIM for Encrypted Computation
Fully Homomorphic Encryption (FHE) offers unparalleled data security guarantees for privacy-sensitive applications, but its widespread adoption is hindered by prohibitively high computation and memory capacity overheads compared to conventional computation on plaintext data. These inefficiencies create critical performance bottlenecks, limiting FHE’s practicality in real-world scenarios. To enhance performance, we systematically characterize FHE workloads, noting that existing accelerators struggle with state-of-the-art FHE schemes due to bandwidth constraints and the diverse computation patterns of different FHE primitives. In this work, we propose OmniCifro, a heterogeneous FHE acceleration framework that addresses performance bottlenecks through architectural design and dataflow optimization. OmniCifro combines a specialized Homomorphic Processing Unit (HPU) for compute-intensive kernels with Processing-in-Memory (PIM) modules for memory-bound operations, featuring dedicated functional units for polynomial arithmetic and element-wise operations. We further optimize the kernel mapping strategy for advanced FHE algorithms to reduce communication overhead between HPU and PIM. Experimental evaluations demonstrate that OmniCifro achieves a 1.6× performance improvement over ARK.
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-40
A Framework for Developing and Optimizing Fully Homomorphic Encryption Programs on GPUs
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 25-40
Open AccessA Framework for Developing and Optimizing Fully Homomorphic Encryption Programs on GPUs
- Open Access
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 715-731
Falcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption Accelerator
Fully homomorphic encryption (FHE) enables computation on encrypted data without compromising privacy, positioning it as a promising solution for secure cloud computing. However, its substantial computational overhead impedes practical deployment, prompting the development of dedicated hardware accelerators. In practice, when deploying cryptographic algorithm optimizations on FHE accelerators, hardware constraints typically such as limited memory capacity, often lead to a disparity between theoretical algorithmic advantage and achievable hardware efficiency. We present Falcon, an algorithm-hardware co-design for efficient FHE acceleration. We first conduct computational analysis of the prevalent minimum key-switching method, and propose hardware-oriented algorithmic optimizations that substantially reduce computational overhead. We then introduce further refinements to decrease the inherent inter-cluster communication overhead in multi-cluster architectures, while preserving computational advantages. By characterizing the arithmetic patterns intrinsic to primary primitives, we devise hardware-specific arithmetic fusion and functional reuse across computational units. Finally, we present a memory-adaptive strategy to effectively deploy Falcon to prior accelerators under constrained on-chip memory budgets. Experimental results demonstrate that applying our algorithm–hardware co-design delivers up to a 1.48× speedup with a negligible area overhead (only a 0.8% increase).
- 22 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 715-731
Open AccessFalcon: Algorithm-Hardware Co-Design for Efficient Fully Homomorphic Encryption Accelerator
Fully homomorphic encryption (FHE) enables computation on encrypted data without compromising privacy, positioning it as a promising solution for secure cloud computing. However, its substantial computational overhead impedes practical deployment, prompting the development of dedicated hardware accelerators. In practice, when deploying cryptographic algorithm optimizations on FHE accelerators, hardware constraints typically such as limited memory capacity, often lead to a disparity between theoretical algorithmic advantage and achievable hardware efficiency. We present Falcon, an algorithm-hardware co-design for efficient FHE acceleration. We first conduct computational analysis of the prevalent minimum key-switching method, and propose hardware-oriented algorithmic optimizations that substantially reduce computational overhead. We then introduce further refinements to decrease the inherent inter-cluster communication overhead in multi-cluster architectures, while preserving computational advantages. By characterizing the arithmetic patterns intrinsic to primary primitives, we devise hardware-specific arithmetic fusion and functional reuse across computational units. Finally, we present a memory-adaptive strategy to effectively deploy Falcon to prior accelerators under constrained on-chip memory budgets. Experimental results demonstrate that applying our algorithm–hardware co-design delivers up to a 1.48× speedup with a negligible area overhead (only a 0.8% increase).
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1829-1843
ML-Cube: Accelerating Module-Lattice-Based Cryptography using Machine Learning Accelerators with a Memory-Less Design
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 1829-1843
Open AccessML-Cube: Accelerating Module-Lattice-Based Cryptography using Machine Learning Accelerators with a Memory-Less Design
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1719-1734
HAWK: Fully Homomorphic Encryption Accelerator with Fixed-Word Key Decomposition Switching
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 1719-1734
Open AccessHAWK: Fully Homomorphic Encryption Accelerator with Fixed-Word Key Decomposition Switching
- Open Access
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 92-106
FAST:An FHE Accelerator for Scalable-parallelism with Tunable-bit
- 20 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 92-106
Open AccessFAST:An FHE Accelerator for Scalable-parallelism with Tunable-bit
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (8) , 1524-1541
GIF-FHE: A Comprehensive Implementation and Evaluation of GPU-Accelerated FHE With Integer and Floating-Point Computing Power
Fully Homomorphic Encryption (FHE) allows computations on encrypted data without revealing the plaintext, garnering significant interest from both academic and industrial communities. However, its broader adoption has been hindered by performance limitations. Consequently, researchers have turned to GPUs for efficient FHE implementation. Nevertheless, most have predominantly favored integer units due to their ease of use, overlooking the considerable computational potential of floating-point units in GPUs. Recognizing this untapped floating-point computational power, our paper introduces GIF-FHE, an extensive exploration and implementation of FHE, leveraging GPUs' integer and floating-point instructions for FHE acceleration. We develop a comprehensive suite of low-level and middle-level FHE primitives, offering multiple implementation variants with support for three word size configurations ($64/52/32$-bit). Particularly, we make innovative use of floating-point implementations, employing a novel methodology to efficiently leverage the floating-point unit's fused multiply-add (FMA) instructions. This represents the pioneering integration of floating-point units into FHE acceleration. To bridge our highly-optimized FHE primitives with practical applications, this paper also provides a high-level FHE implementation and interfaces that can be directly applied by upper-level applications such as neural network inference. Finally, we undertake a comprehensive experiment evaluation and comparison involving three types of arithmetic: FP64/INT64/INT32 with varying word size configurations and computation units. Notably, our fundamental function implementations consistently outperform counterparts on the same platform, achieving speedups ranging from $2.0\times$ to $4.2\times$. In the context of CKKS FHE schemes, our homomorphic operation implementation surpasses the state-of-the-art GPU-based solution with a speedup of up to $3.8\times$, and exceeds the performance of the widely adopted CPU-based library, SEAL, with a remarkable speedup of over $300\times$.
- 28 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 36 (8) , 1524-1541
GIF-FHE: A Comprehensive Implementation and Evaluation of GPU-Accelerated FHE With Integer and Floating-Point Computing Power
Fully Homomorphic Encryption (FHE) allows computations on encrypted data without revealing the plaintext, garnering significant interest from both academic and industrial communities. However, its broader adoption has been hindered by performance limitations. Consequently, researchers have turned to GPUs for efficient FHE implementation. Nevertheless, most have predominantly favored integer units due to their ease of use, overlooking the considerable computational potential of floating-point units in GPUs. Recognizing this untapped floating-point computational power, our paper introduces GIF-FHE, an extensive exploration and implementation of FHE, leveraging GPUs' integer and floating-point instructions for FHE acceleration. We develop a comprehensive suite of low-level and middle-level FHE primitives, offering multiple implementation variants with support for three word size configurations ($64/52/32$-bit). Particularly, we make innovative use of floating-point implementations, employing a novel methodology to efficiently leverage the floating-point unit's fused multiply-add (FMA) instructions. This represents the pioneering integration of floating-point units into FHE acceleration. To bridge our highly-optimized FHE primitives with practical applications, this paper also provides a high-level FHE implementation and interfaces that can be directly applied by upper-level applications such as neural network inference. Finally, we undertake a comprehensive experiment evaluation and comparison involving three types of arithmetic: FP64/INT64/INT32 with varying word size configurations and computation units. Notably, our fundamental function implementations consistently outperform counterparts on the same platform, achieving speedups ranging from $2.0\times$ to $4.2\times$. In the context of CKKS FHE schemes, our homomorphic operation implementation surpasses the state-of-the-art GPU-based solution with a speedup of up to $3.8\times$, and exceeds the performance of the widely adopted CPU-based library, SEAL, with a remarkable speedup of over $300\times$.
- 10 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (2) , 356-370
AsyncGBP+: Bridging SSL/TLS and Heterogeneous Computing Power With GPU-Based Providers
The rapid evolution of GPUs has emerged as a promising solution for accelerating the worldwide used SSL/TLS, which faces performance bottlenecks due to its underlying heavy cryptographic computations. Nevertheless, substantial structural adjustments from the parallel mode of GPUs to the serial mode of the SSL/TLS stack are imperative, potentially constraining the practical deployment of GPUs. In this paper, we propose AsyncGBP${}^{+}$ , a three-level framework that facilitates the seamless conversion of cryptographic requests from synchronous to asynchronous mode. We conduct an in-depth analysis of the OpenSSL provider and cryptographic primitive features relevant to GPU implementations, aiming to fully exploit the potential of GPUs. Notably, AsyncGBP${}^{+}$ supports three working settings (offline/online/hybrid), finely tailored for various public key cryptographic primitives, including traditional ones like X25519, Ed25519, ECDSA, and the quantum-safe CRYSTALS-Kyber. A comprehensive evaluation demonstrates that AsyncGBP${}^{+}$ can efficiently achieve an improvement of up to 137.8$\times$ compared to the default OpenSSL provider (for X25519, Ed25519, ECDSA) and 113.30$\times$ compared to OpenSSL-compatible liboqs (for CRYSTALS-Kyber) in a single-process setting. Furthermore, AsyncGBP${}^{+}$ surpasses the current fastest commercial-off-the-shelf OpenSSL-compatible TLS accelerator with a 5.3$\times$ to 7.0$\times$ performance improvement.- 10 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 74 (2) , 356-370
AsyncGBP+: Bridging SSL/TLS and Heterogeneous Computing Power With GPU-Based Providers
The rapid evolution of GPUs has emerged as a promising solution for accelerating the worldwide used SSL/TLS, which faces performance bottlenecks due to its underlying heavy cryptographic computations. Nevertheless, substantial structural adjustments from the parallel mode of GPUs to the serial mode of the SSL/TLS stack are imperative, potentially constraining the practical deployment of GPUs. In this paper, we propose AsyncGBP${}^{+}$ , a three-level framework that facilitates the seamless conversion of cryptographic requests from synchronous to asynchronous mode. We conduct an in-depth analysis of the OpenSSL provider and cryptographic primitive features relevant to GPU implementations, aiming to fully exploit the potential of GPUs. Notably, AsyncGBP${}^{+}$ supports three working settings (offline/online/hybrid), finely tailored for various public key cryptographic primitives, including traditional ones like X25519, Ed25519, ECDSA, and the quantum-safe CRYSTALS-Kyber. A comprehensive evaluation demonstrates that AsyncGBP${}^{+}$ can efficiently achieve an improvement of up to 137.8$\times$ compared to the default OpenSSL provider (for X25519, Ed25519, ECDSA) and 113.30$\times$ compared to OpenSSL-compatible liboqs (for CRYSTALS-Kyber) in a single-process setting. Furthermore, AsyncGBP${}^{+}$ surpasses the current fastest commercial-off-the-shelf OpenSSL-compatible TLS accelerator with a 5.3$\times$ to 7.0$\times$ performance improvement.- 17 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (18) , 16850-16861
TEGRAS: An Efficient Tegra Embedded GPU-Based RSA Acceleration Server
Industrial Internet of Things (IIoT) has strict requirements on the performance and security of devices. Public-key cryptography, as a kind of computing resource-consuming algorithm, is widely used in the digital signature, key exchange, and so on. The embedded graphics processing units (GPUs) are now rapidly achieving extraordinary computing power, such as NVIDIA Tegra K1/X1/X2/Xavier, which are also treated as edge computing devices. They are widely used in IIoT environments, such as intelligent manufacturing, smart cities, and vehicle-mounted systems. The performance advantages endow embedded GPUs with the possibility of accelerating cryptography that also requires high-density computing. This article implements an efficient Tegra-based embedded GPU RSA acceleration server-oriented IIoT, named TEGRAS. Various optimization methods are employed to promote efficiency, including multithreaded Montgomery multiplication and Chinese Remainder Theorem implementation on the resource-constricted embedded GPUs. With about 40–50 W of power consumption, TEGRAS can deliver 34 kops/s of RSA2048 signature generation and 1007 kops/s of RSA signature verification, which outperforms implementations in the desktop GPUs and embedded CPUs in the perspective of performance-to-power ratio. To evaluate TEGRAS in real-world scenarios, we additionally build a network stack to deliver digital signature services, which can provide more than 34 and 978 kops of signature generation and signature verification, respectively. In a word, based on the embedded GPU, we provide a high-throughput, low-latency, and ready-to-use RSA accelerator-oriented IIoT.
- 17 February 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (18) , 16850-16861
TEGRAS: An Efficient Tegra Embedded GPU-Based RSA Acceleration Server
Industrial Internet of Things (IIoT) has strict requirements on the performance and security of devices. Public-key cryptography, as a kind of computing resource-consuming algorithm, is widely used in the digital signature, key exchange, and so on. The embedded graphics processing units (GPUs) are now rapidly achieving extraordinary computing power, such as NVIDIA Tegra K1/X1/X2/Xavier, which are also treated as edge computing devices. They are widely used in IIoT environments, such as intelligent manufacturing, smart cities, and vehicle-mounted systems. The performance advantages endow embedded GPUs with the possibility of accelerating cryptography that also requires high-density computing. This article implements an efficient Tegra-based embedded GPU RSA acceleration server-oriented IIoT, named TEGRAS. Various optimization methods are employed to promote efficiency, including multithreaded Montgomery multiplication and Chinese Remainder Theorem implementation on the resource-constricted embedded GPUs. With about 40–50 W of power consumption, TEGRAS can deliver 34 kops/s of RSA2048 signature generation and 1007 kops/s of RSA signature verification, which outperforms implementations in the desktop GPUs and embedded CPUs in the perspective of performance-to-power ratio. To evaluate TEGRAS in real-world scenarios, we additionally build a network stack to deliver digital signature services, which can provide more than 34 and 978 kops of signature generation and signature verification, respectively. In a word, based on the embedded GPU, we provide a high-throughput, low-latency, and ready-to-use RSA accelerator-oriented IIoT.