Bit-Level Bridging
Accelerating Fully Homomorphic Encryption by Bridging Modular and Bit-Level Arithmetic
We propose a novel method, dubbed \emph{bridging}, that blends faster and restricted modular computation with slower and comprehensive bit-level arithmetic, making them both usable within the same application and with the same cryptographic scheme instantiation.Experimental results show that bridging modular and bit-level arithmetic computation can lead to 1-2 orders of magnitude performance improvement for tested synthetic benchmarks, as well as two real-world fully homomorphic encryption applications : a url denylisting case study, and a genotype imputation application.
