Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/69114
Title: | 二元體上橢圓曲線密碼之多核處理器 A Multi-Core ECC Processor over Binary Fields |
Authors: | Yuan-Che Hsu 許遠哲 |
Advisor: | 鄭振牟 |
Keyword: | 橢圓曲線密碼,多核心處理器,快速相乘算法,現場可程式邏輯閘陣列, ECC,Multi-Core Processor,KOA,FPGA, |
Publication Year : | 2018 |
Degree: | 碩士 |
Abstract: | 橢圓曲線密碼是公鑰密碼系統中的一大基石,而美國政府將一系列的曲線制定為標準。針對二元體上最高的安全等級,我們提出了一個最快的橢圓曲線密碼多核心處理器,並實作於現場可程式邏輯閘陣列中。演算法的層面上,我們選擇了最具競爭力的一套運算公式,並設法找出對多核心最佳化的排程;數位電路的層面上,我們基於快速相乘算法設計了一個高吞吐量的乘法器作為運算核心,並比較不同形式乘法器之間的差異;計算機組織的層面上,我們採用了一個簡潔的架構,並將其擴充成多核心的版本。總而言之,我們實作了一個極高速的橢圓曲線密碼處理器,讓運算效能達到更高的境界。 Elliptic Curve Cryptography (ECC) is a popular building block of public key protocols. A set of curves are standardized by the National Institute of Standards and Technology (NIST). Aiming at the highest security level, we propose the fastest multi-core ECC implementation over binary fields on FPGAs. In the aspect of algorithm, we choose the most competitive laddering formula, and seek the optimal instruction sequences according to different number of cores. In the aspect of digital circuits, we design a high-throughput multiplier based on the Karatsuba-Ofman Algorithm (KOA), and make a thorough comparison among different styles of multipliers. In the aspect of computer architecture, we adopt a compact structure, and extend it to a multi-core version. In conclusion, we implement an extremely high-speed ECC processor for NIST curves, pushing the performance to the limits. |
URI: | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/69114 |
DOI: | 10.6342/NTU201800997 |
Fulltext Rights: | 有償授權 |
Appears in Collections: | 電機工程學系 |
Files in This Item:
File | Size | Format | |
---|---|---|---|
ntu-107-1.pdf Restricted Access | 2.36 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.