3 citations · 3 across the 15 of their papers we have counts for
Showing cs.CRShow all
2 papers · 1 filter
cs.CR2025
LaMoS: Enabling Efficient Large Number Modular Multiplication through SRAM-based CiM Acceleration
Haomin Li, Fangxin Liu, Chenyang Guan +3
Barrett's algorithm is one of the most widely used methods for performing modular multiplication, a critical nonlinear operation in modern privacy computing techniques such as homo…
cs.CR2025
ALLMod: Exploring rea-Efficiency of UT-based arge Number ular Reduction via Hybrid Workloads
Fangxin Liu, Haomin Li, Zongwu Wang +5
Modular arithmetic, particularly modular reduction, is widely used in cryptographic applications such as homomorphic encryption (HE) and zero-knowledge proofs (ZKP). High-bit-width…