A million-bit multiplier architecture for fully homomorphic encryption
Microprocessors and Microsystems, vol.38, no.8, pp.766-775, 2014 (SCI-Expanded, Scopus)
- Publication Type: Article / Article
- Volume: 38 Issue: 8
- Publication Date: 2014
- Doi Number: 10.1016/j.micpro.2014.06.003
- Journal Name: Microprocessors and Microsystems
- Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
- Page Numbers: pp.766-775
- Keywords: Fully homomorphic encryption, Very-large number multiplication, Number theoretic transform
- İstanbul Ticaret University Affiliated: Yes
Abstract
In this work we present a full and complete evaluation of a very large multiplication scheme in custom hardware. We designed a novel architecture to realize a million-bit multiplication scheme based on the Schönhage-Strassen Algorithm. We constructed our scheme using Number Theoretical Transform (NTT). The construction makes use of an innovative cache architecture along with processing elements customized to match the computation and access patterns of the NTT-based recursive multiplication algorithm. We realized our architecture with Verilog and using a 90 nm TSMC library, we could get a maximum clock frequency of 666 MHz. With this frequency, our architecture is able to compute the product of two million-bit integers in 7.74 ms. Our data shows that the performance of our design matches that of previously reported software implementations on a high-end 3 GHz Intel Xeon processor, while requiring only a tiny fraction of the area. 1