کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10343012 | 696487 | 2014 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A million-bit multiplier architecture for fully homomorphic encryption
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
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
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Microprocessors and Microsystems - Volume 38, Issue 8, Part A, November 2014, Pages 766-775
Journal: Microprocessors and Microsystems - Volume 38, Issue 8, Part A, November 2014, Pages 766-775
نویسندگان
Yarkın Doröz, Erdinç Ãztürk, Berk Sunar,