Comparison of cuFHE vs TFHE on Arithmetic Circuit Computation

Abstract

This is an extension of the ongoing research project on Fully Homomorphic Encryption. Arithmetic Circuit Homomorphic Encryption (ACHE) was implemented based on the Fast Fully Homomorphic Encryption over the Torus (TFHE). This paper focuses on not just comparing the latency of the digital gates between cuFHE and TFHE, but the differences for the Public/Private key generations, the security bits size, the actual default generated key size and transmission latency. At the same time, new Arithmetic Circuits on Addition, Subtraction and Multiplication will be constructed on cuFHE. The new Circuits are compared and analysed against earlier implementation in TFHE with and without enhancements.