A High-Speed Accelerator for Homomorphic Encryption using the Karatsuba Algorithm
By Vincent Migliore, Cédric Seguin, Maria Mendez Real, Vianney Lapôtre, Arnaud Tisserand, Caroline Fontaine, Guy Gogniat, Russell Tessier. 2017
15 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
Citations in the corpus
- HEAX: An Architecture for Computing on Encrypted Data (2019, background): “In [46] and [37, 47], authors focus on designing hardware architecture for the encryption operation only, by leveraging Karat-suba and Comba multiplication algorithms, respectively.”
- F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (2021, unknown): “Limitations of prior accelerators: Prior work has proposed several FHE accelerators for FPGAs [20, 22, 27, 52, 53, 65, 66, 71].”
- HEAX: High-Performance Architecture for Computation on Homomorphically Encrypted Data in the Cloud (2019, methodology): “These co-processors work in conjunction with CPUs and accelerate one or more of the homomorphic operations [45, 55, 21, 38, 56, 49].”
- Faster CryptoNets: Leveraging Sparsity for Real-World Encrypted Inference (2018, methodology): “Additionally, [49] suggests that there are very significant drawbacks to batching, including having to select more numerous and on accelerating neural networks neglect batching for similar reasons as ours ( [59] does not use batching, and [11]. uses batching to compress messages but not to improve…”