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 |
| Summary: | 碩士 === 國立臺灣大學 === 電子工程學研究所 === 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.
|
|---|