Low-Complexity Integer Divider Architecture for Homomorphic Encryption

2024/01/19 by Sajjad Akherati, Akherati, Sajjad, Jiaxuan Cai +3
Computer Science · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptography and Data Security

paper · pdf · doi:10.48550/arxiv.2401.11064

Abstract

Homomorphic encryption (HE) allows computations to be directly carried out on ciphertexts and enables privacy-preserving cloud computing. The computations on the coefficients of the polynomials involved in HE are always followed by modular reduction, and the overall complexity of ciphertext multiplication can be reduced by utilizing the quotient. Our previous design considers the cases that the dividend is an integer multiple of the modulus and the modulus is in the format of 2^w-2^u±1, where u

Related

• Practical Homomorphic Encryption Over the Integers
• A new lightweight additive homomorphic encryption algorithm
• Homomorphic encryption schemes based on coding theory and polynomials
• Revisiting Fully Homomorphic Encryption Schemes
• On the Weakness of Fully Homomorphic Encryption