用于全同态加密的高效密钥交换加速器.pdf

1、Efficient Key Switching Accelerator for Fully Homomorphic EncryptionSeoyoon Jang,Sungjin Park,Dongsuk JeonSeoul National UniversitySeoul,South KoreaASP-DAC 2025Motivation Advent of FHE Fully Homomorphic Encryption(FHE)The savior of privacy-preserving computation in cloud service The main bottleneck

2、operation,Key-Switching(KS)BottleneckMotivation What makes KS expensive?Expensive Number Theoretic Transform(NTT)and inverse-NTT operations in KS =()=01 At least log computations Irregular memory access pattern 0 1 2 3 4 5 6 701234567Stage 1Stage 2Stage 3Motivation What makes KS expensive?Expensive

3、Number Theoretic Transform(NTT)and inverse-NTT operations in KS Frequent transitions in data access patterns(Element/Ring/Coefficient-wise)Element-wiseMotivation What makes KS expensive?Element-wiseData access within each polynomial(NTT/INTT,)Ring-wise Expensive Number Theoretic Transform(NTT)and in

4、verse-NTT operations in KS Frequent transitions in data access patterns(Element/Ring/Coefficient-wise)Motivation What makes KS expensive?Ring-wiseElement-wiseRing-wiseRing-wiseCoefficient-wise Expensive Number Theoretic Transform(NTT)and inverse-NTT operations in KS Frequent transitions in data acce

5、ss patterns(Element/Ring/Coefficient-wise)Motivation What makes KS expensive?Expensive Number Theoretic Transform(NTT)and inverse-NTT operations in KS Frequent transitions in data access patterns(Element/Ring/Coefficient-wise)Overall KS dataflowMotivation What makes KS expensive?Expensive Number The

6、oretic Transform(NTT)and inverse-NTT operations in KS Frequent transitions in data access patterns(Element/Ring/Coefficient-wise)Overall KS dataflowRing-wiseRing-wiseCoefficient-wiseElement-wise Redundant external memory access Motivation What makes KS expensive?Expensive Number Theoretic Transform(