Accelerating integer-based fully homomorphic encryption using Comba multiplication

By Ciara Moore, Máire O’neill, Neil Hanley, Elizabeth O'Sullivan. 2014

19 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

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

1. Kim Laine
2. Blake Pelton
3. M. Sadegh Riazi
4. Mauro Conti
5. Wei Dai
6. Hidayet Aksu
7. Abbas Acar
8. Selcuk Uluagac

In Information Systems

1. Blake Pelton
2. M. Sadegh Riazi
3. Mauro Conti
4. Wei Dai
5. Hidayet Aksu
6. Abbas Acar
7. Kim Laine
8. Selcuk Uluagac

Citations in the corpus

• HEAX: An Architecture for Computing on Encrypted Data (2019, methodology): “In [46] and [37, 47], authors focus on designing hardware architecture for the encryption operation only, by leveraging Karatsuba and Comba multiplication algorithms, respectively.”
• A Survey on Homomorphic Encryption Schemes (2017, background): “…by FPGAs motivates many researchers to speed up the practicality of FHE schemes [Cousins et al. 2012; Wang and Huang 2013; Cao et al. 2013; Moore et al. 2013; Chen et al. 2015; Cao et al. 2014; Moore et al. 2014a; Cousins et al. 2014; Roy et al. 2015; Pöppelmann et al. 2015; Öztürk et al. 2015].”
• 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].”