TPU作为密码学加速器
TPU as Cryptographic Accelerator
AI总结:
本文研究利用TPU/NPU等AI加速器加速FHE和ZKP中的多项式乘法,提出适配技术并初步评估其有效性,以提升密码学方案性能。
摘要:
全同态加密(FHE)和零知识证明(ZKP)等密码学方案虽然提供了强大的隐私保护能力,但往往受限于其计算复杂度。多项式乘法作为这些方案中的核心运算,是主要的性能瓶颈。尽管算法进步以及GPU和FPGA等专用硬件已在加速这些计算方面展现出潜力,但近期AI加速器(TPU/NPU)的兴起带来了新的机遇。本文探讨了利用TPU/NPU加速多项式乘法的潜力,从而提升FHE和ZKP方案的性能。我们提出了将多项式乘法适配到这些以AI为中心的架构上的技术,并对其有效性进行了初步评估。我们还讨论了当前的局限性,并概述了进一步性能提升的未来方向,为更广泛地采用先进密码学工具铺平道路。
英文摘要:
Cryptographic schemes like Fully Homomorphic Encryption (FHE) and Zero-Knowledge Proofs (ZKPs), while offering powerful privacy-preserving capabilities, are often hindered by their computational complexity. Polynomial multiplication, a core operation in these schemes, is a major performance bottleneck. While algorithmic advancements and specialized hardware like GPUs and FPGAs have shown promise in accelerating these computations, the recent surge in AI accelerators (TPUs/NPUs) presents a new opportunity. This paper explores the potential of leveraging TPUs/NPUs to accelerate polynomial multiplication, thereby enhancing the performance of FHE and ZKP schemes. We present techniques to adapt polynomial multiplication to these AI-centric architectures and provide a preliminary evaluation of their effectiveness. We also discuss current limitations and outline future directions for further performance improvements, paving the way for wider adoption of advanced cryptographic tools.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。