Accelerating integer based fully homomorphic encryption using frequency domain multiplication

DOI10.1007/978-3-030-01950-1_10zbMATH Open1458.94241OpenAlexW2898205232MaRDI QIDQ2218945FDOQ2218945

Authors: Shakirah Hashim, Mohammed Benaissa 

Publication date: 18 January 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-01950-1_10

Recommendations

• Enhancing data parallelism of fully homomorphic encryption
• Accelerating LTV based homomorphic encryption in reconfigurable hardware
• An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers
• Accelerating homomorphic evaluation on reconfigurable hardware
• Fully homomorphic encryption over the integers with shorter public keys

zbMATH Keywords

fully homomorphic encryptionhardware implementationnumber theoretic transform

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer system organization (68M99)

Cited In (4)

• Faster Homomorphic Function Evaluation Using Non-integral Base Encoding
• Accelerating LTV based homomorphic encryption in reconfigurable hardware
• Enhancing data parallelism of fully homomorphic encryption
• Exploring the advantages and challenges of Fermat NTT in FHE acceleration

This page was built for publication: Accelerating integer based fully homomorphic encryption using frequency domain multiplication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2218945)