A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Performance of Hierarchical Transforms in Homomorphic Encryption: A case study on Logistic Regression inference
[article]
2022
IACR Cryptology ePrint Archive
Recent works challenged the Number-Theoretic Transform (NTT) as the most efficient method for polynomial multiplication in GPU implementations of Fully Homomorphic Encryption schemes such as CKKS and BFV. In particular, these works argue that the Discrete Galois Transform (DGT) is a better candidate for this particular case. However, these claims were never rigorously validated, and only intuition was used to argue in favor of each transform. This work brings some light on the discussion by
dblp:journals/iacr/AlvesOA22
fatcat:2mdv2u5kifbifa3dgnm2q6xuai