High-Speed Fully Homomorphic Encryption Over the Integers

摘要: A fully homomorphic encryption (FHE) scheme is envisioned as a key cryptographic tool in building secure and reliable cloud computing environment, it allows arbitrary evaluation of ciphertext without revealing the plaintext. However, existing FHE implementations remain impractical due to very high time resource costs. To authors’ knowledge, this paper presents first hardware implementation full primitive for over integers using FPGA technology. large-integer multiplier architecture utilising Integer-FFT multiplication proposed, Barrett modular reduction module designed incorporating proposed multiplier. The used integer-based employing modules. designs are verified Xilinx Virtex-7 platform. Experimental results show that speed improvement factor up 44 achievable when compared its corresponding software implementation. Moreover, performance analysis shows further improvements primitives may still be possible, example through optimisations or by targeting an ASIC