Fahong Zhang

Orcid: 0009-0006-9711-0549

Affiliations:
  • Xi'an Jiaotong University, Xi'an, China


According to our database1, Fahong Zhang authored at least 12 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
STEED: Space and Time-Efficient Encrypted Database Using FHE.
IEEE Trans. Dependable Secur. Comput., 2026

2025
An Efficient Polynomial Multiplication Accelerator for Lattice-Based Cryptography With a 2-D Winograd-Based Divide-and-Conquer Method.
IEEE Trans. Very Large Scale Integr. Syst., December, 2025

PBSAcc: A High-Performance Hardware Accelerator for FHE With Improved Batch Programmable Bootstrapping.
IEEE Trans. Circuits Syst. II Express Briefs, November, 2025

A Scalable and Efficient Architecture for Binary Polynomial Multiplication in BIKE Utilizing Inter-/Inner-Wise Sparsity and Block-by-Block Pipeline.
IEEE Trans. Very Large Scale Integr. Syst., May, 2025

A Reconfigurable and Area-Efficient Polynomial Multiplier Using a Novel In-Place Constant-Geometry NTT/INTT and Conflict-Free Memory Mapping Scheme.
IEEE Trans. Circuits Syst. I Regul. Pap., March, 2025

A Compact and Efficient Hardware Accelerator for RNS-CKKS En/Decoding and En/Decryption.
IEEE Trans. Circuits Syst. II Express Briefs, January, 2025

An Efficient and Parallelism-Scalable Large Integer Multiplier Architecture Using Least-Positive Form and Winograd Fast Algorithm.
IEEE Trans. Circuits Syst. II Express Briefs, January, 2025

Low Multiplicative Depth Polynomial Evaluation Architectures for Homomorphic Encrypted Data.
Proceedings of the 30th Asia and South Pacific Design Automation Conference, 2025

2024
A High-Throughput and Scalable Schoolbook Polynomial Multiplier for Accelerating Saber on FPGA Using a Novel Winograd-Based Architecture.
IEEE Trans. Circuits Syst. II Express Briefs, April, 2024

A High-Throughput Toom-Cook-4 Polynomial Multiplier for Lattice-Based Cryptography Using a Novel Winograd-Schoolbook Algorithm.
IEEE Trans. Circuits Syst. I Regul. Pap., January, 2024

An Efficient and Scalable FHE-Based PDQ Scheme: Utilizing FFT to Design a Low Multiplication Depth Large-Integer Comparison Algorithm.
IEEE Trans. Inf. Forensics Secur., 2024

2023
TCPM: A Reconfigurable and Efficient Toom-Cook-Based Polynomial Multiplier Over Rings Using a Novel Compressed Postprocessing Algorithm.
IEEE Trans. Very Large Scale Integr. Syst., August, 2023


  Loading...