Fast constant-time modular inversion on FPGA
碩士 === 國立臺灣大學 === 電子工程學研究所 === 107 === Because of the development of the quantum computer, current cryptographic algorithms are getting insecure. The NIST has initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptographic algorithms. NTRU Prime is on...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/fem7j9 |
id |
ndltd-TW-107NTU05428065 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-107NTU054280652019-11-16T05:27:58Z http://ndltd.ncl.edu.tw/handle/fem7j9 Fast constant-time modular inversion on FPGA 在FPGA上實作快速恆定時間之模反元素計算 Wei-Chen Pai 白暐辰 碩士 國立臺灣大學 電子工程學研究所 107 Because of the development of the quantum computer, current cryptographic algorithms are getting insecure. The NIST has initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptographic algorithms. NTRU Prime is one of the submissions that have advanced into the 2nd round of the project. This thesis implements the algorithm on FPGA. Furthermore, inside the algorithm, the function used to compute the reciprocal of the polynomial cost most of the time in key generation. We try to use the variant of Euclid’s algorithm to optimize the function for accelerating. Chen-Mou Cheng 鄭振牟 2019 學位論文 ; thesis 23 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立臺灣大學 === 電子工程學研究所 === 107 === Because of the development of the quantum computer, current cryptographic algorithms are getting insecure. The NIST has initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptographic algorithms. NTRU Prime is one of the submissions that have advanced into the 2nd round of the project. This thesis implements the algorithm on FPGA. Furthermore, inside the algorithm, the function used to compute the reciprocal of the polynomial cost most of the time in key generation. We try to use the variant of Euclid’s algorithm to optimize the function for accelerating.
|
author2 |
Chen-Mou Cheng |
author_facet |
Chen-Mou Cheng Wei-Chen Pai 白暐辰 |
author |
Wei-Chen Pai 白暐辰 |
spellingShingle |
Wei-Chen Pai 白暐辰 Fast constant-time modular inversion on FPGA |
author_sort |
Wei-Chen Pai |
title |
Fast constant-time modular inversion on FPGA |
title_short |
Fast constant-time modular inversion on FPGA |
title_full |
Fast constant-time modular inversion on FPGA |
title_fullStr |
Fast constant-time modular inversion on FPGA |
title_full_unstemmed |
Fast constant-time modular inversion on FPGA |
title_sort |
fast constant-time modular inversion on fpga |
publishDate |
2019 |
url |
http://ndltd.ncl.edu.tw/handle/fem7j9 |
work_keys_str_mv |
AT weichenpai fastconstanttimemodularinversiononfpga AT báiwěichén fastconstanttimemodularinversiononfpga AT weichenpai zàifpgashàngshízuòkuàisùhéngdìngshíjiānzhīmófǎnyuánsùjìsuàn AT báiwěichén zàifpgashàngshízuòkuàisùhéngdìngshíjiānzhīmófǎnyuánsùjìsuàn |
_version_ |
1719292363039309824 |