Please use this identifier to cite or link to this item:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/79583Full metadata record
| ???org.dspace.app.webui.jsptag.ItemTag.dcfield??? | Value | Language |
|---|---|---|
| dc.contributor.advisor | 黃俊郎(Jiun-Lang Huang) | |
| dc.contributor.author | Yun-Li Cheng | en |
| dc.contributor.author | 鄭允立 | zh_TW |
| dc.date.accessioned | 2022-11-23T09:04:22Z | - |
| dc.date.available | 2021-11-08 | |
| dc.date.available | 2022-11-23T09:04:22Z | - |
| dc.date.copyright | 2021-11-08 | |
| dc.date.issued | 2021 | |
| dc.date.submitted | 2021-09-16 | |
| dc.identifier.citation | [1]E. Alkim, D. Y.L. Cheng, C.M. M. Chung, H. Evkan, L. W.L. Huang, V. Hwang,C.L. T. Li, R. Niederhagen, C.J. Shih, J. Wälde, et al. Polynomial multiplication inntru prime.IACRTransactionsonCryptographicHardwareandEmbeddedSystems,pages 217–238, 2021. [2]D. J. Bernstein, C. Chuengsatiansup, T. Lange, and C. van Vredendaal. Ntru prime:reducing attack surface at low cost. InInternationalConferenceonSelectedAreasinCryptography, pages 235–260. Springer, 2017. [3]D. J. Bernstein and B.Y. Yang. Fast constanttime gcd computation and modularinversion.IACRTransactionsonCryptographicHardwareandEmbeddedSystems,pages 340–398, 2019. [4]C.M. M. Chung, V. Hwang, M. J. Kannwischer, G. Seiler, C.J. Shih, and B.Y. Yang.Ntt multiplication for nttunfriendly rings.IACRTransactionsonCryptographicHardwareandEmbeddedSystems, pages 159–188, 2021. [5]M. J. Kannwischer, J. Rijneveld, P. Schwabe, and K. Stoffelen. pqm4: Testing andbenchmarking nist pqc on arm cortexm4. 2019. [6]C.L. Li. Implementation of polynomial modular inversion inlattice based cryptograpgy on arm, 2021. | |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/79583 | - |
| dc.description.abstract | 隨著量子電腦的發展，傳統的密碼系統的安全性逐漸受到威脅，因此後量子密碼系統的重要性也相應提升。對於密碼系統來說，速度的快慢影響系統的安全性。更快的速度代表能在相同時間內使用更大的金鑰來進行加解密，所以如何有效實作一個密碼系統就顯得相當重要。而對於晶格密碼系統來說，多項式乘法的實作的重要性佔據了相當重要的地位。本篇論文將以NTRU Prime密碼系統在ARM Cortex-M4處理器上的實作為主軸，來探討多項式乘法在各種條件需求下的有效率的作法。 | zh_TW |
| dc.description.provenance | Made available in DSpace on 2022-11-23T09:04:22Z (GMT). No. of bitstreams: 1 U0001-1509202116353700.pdf: 12633509 bytes, checksum: d2defa7bf5e3c1fb0b9a15da1e7c0acf (MD5) Previous issue date: 2021 | en |
| dc.description.tableofcontents | " Page 誌謝 iii 摘要 v Abstract vii Contents ix Chapter 1 Introduction 1 1.1 Motivation. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Related work. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Contributions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Chapter 2 Background3 2.1 NTRU Prime. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2.1.1 Streamlined NTRU Prime. . . . . . . . . . . . . . . . . . . . . . . 4 2.1.2 NTRU LPRime. . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.2 Number Theoretic Transform (NTT). . . . . . . . . . . . . . . . . . 6 2.2.1 Mixedradix NTT. . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2.2 Rader’s Algorithm. . . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.3 Good–Thomas Algorithm. . . . . . . . . . . . . . . . . . . . . . . 10 2.2.4 NTTs with unfriendly modulus. . . . . . . . . . . . . . . . . . . . 12 2.2.5 Chinese Remainder Theorem. . . . . . . . . . . . . . . . . . . . . 13 Chapter 3 Implementation 15 3.1 Rq_mult_small. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.1.1 (p, q) = (653, 4621). . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.1.2 (p, q) = (761, 4591). . . . . . . . . . . . . . . . . . . . . . . . . . 22 3.1.3 (p, q) = (857, 5167). . . . . . . . . . . . . . . . . . . . . . . . . . 24 3.1.4 (p, q) = (953, 6343). . . . . . . . . . . . . . . . . . . . . . . . . . 25 3.1.5 (p, q) = (1013, 7177). . . . . . . . . . . . . . . . . . . . . . . . . 27 3.1.6 (p, q) = (1277, 7879). . . . . . . . . . . . . . . . . . . . . . . . . 28 3.2 R3_mult. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30 3.3 Polymul_NxN. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32 Chapter 4 Result 35 Chapter 5 Conclusion and Future Work 37 References 39 Appendix A — ARM assembly code 41" | |
| dc.language.iso | en | |
| dc.title | ARM處理器上晶格密碼學中的數論轉換多項式乘法 | zh_TW |
| dc.title | Number Theoretic Transform for Polynomial Multiplication in Latticebased Cryptography on ARM Processors | en |
| dc.date.schoolyear | 109-2 | |
| dc.description.degree | 碩士 | |
| dc.contributor.oralexamcommittee | 楊柏因(Hsin-Tsai Liu),蕭旭君(Chih-Yang Tseng),鄭振牟 | |
| dc.subject.keyword | 後量子密碼學,晶格密碼系統,NTRU Prime,多項式乘法,數論轉換,ARM Cortex-M4, | zh_TW |
| dc.subject.keyword | Post-quantum cryptography,Lattice-based cryptography,NTRU Prime,Polynomial multiplication,NTT,ARM Cortex-M4, | en |
| dc.relation.page | 44 | |
| dc.identifier.doi | 10.6342/NTU202103195 | |
| dc.rights.note | 同意授權(全球公開) | |
| dc.date.accepted | 2021-09-17 | |
| dc.contributor.author-college | 電機資訊學院 | zh_TW |
| dc.contributor.author-dept | 電子工程學研究所 | zh_TW |
| Appears in Collections: | 電子工程學研究所 | |
Files in This Item:
| File | Size | Format | |
|---|---|---|---|
| U0001-1509202116353700.pdf | 12.34 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.