請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/96782完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.advisor | 鄭皓中 | zh_TW |
| dc.contributor.advisor | Hao-Chung Cheng | en |
| dc.contributor.author | 劉俊廷 | zh_TW |
| dc.contributor.author | JYUN-TING LIU | en |
| dc.date.accessioned | 2025-02-21T16:31:43Z | - |
| dc.date.available | 2025-02-22 | - |
| dc.date.copyright | 2025-02-21 | - |
| dc.date.issued | 2025 | - |
| dc.date.submitted | 2025-01-13 | - |
| dc.identifier.citation | [1] X. Ma, F. Xu, H. Xu, X. Tan, B. Qi and H.-K. Lo, "Postprocessing for quantum random-number generators: entropy evaluation and," 2013.
[2] Z. Zheng, Y. Zhang, W. Huang, S. Yu and H. Guo, "6 Gbps real-time optical quantum random number generator based on vacuum fluctuation," 2019. [3] ITL Computer Security Division, "Random Bit Generation|CSRC," National Institute of Standards and Technology, [Online]. Available: https://csrc.nist.gov/projects/random-bit-generation/documentation-and-software. [4] "Nyquist–Shannon sampling theorem," Wikipedia, [Online]. Available: https://en.wikipedia.org/wiki/Nyquist%E2%80%93Shannon_sampling_theorem. [5] Y. Shen, L. Tian and H. Zou, "Practical quantum random number generator based on measuring the shot noise of vacuum states," 2010. [6] F. Raffaelli, "Quantum Random Number Generators in Integrated Photonics," 2019. [7] "Rényi entropy," Wikipedia, [Online]. Available: https://en.wikipedia.org/wiki/R%C3%A9nyi_entropy. [8] V. Guruswami, J. Hastad, M. Sudan and D. Zuckerman, "Combinatorial bounds for list decoding," in IEEE Transactions on Information, 2002. [9] N. Nisan and A. Wigderson, "Hardness vs randomness," in Journal of computer, 1994. [10] W. Mauerer, C. Portmann and V. B. Scholz, "A modular framework for randomness extraction based on Trevisans construction," 2012. [11] Y.-R. Chen, "Quantum Random Number Generator by Sampling Vacuum Noise," 2023. [12] X. Ma, X. Yuan, Z. Cao, B. Qi and Z. Zhang, "Quantum random number generation," 2016. [13] W. Mauerer, C. Portmann and B. V. Scholz, "A modular framework for randomness extraction based on Trevisan construction," 2012. [14] F. Xu, B. Qi, X. Ma, H. Xu, H. Zheng and H.-K. Lo, "Ultrafast quantum random number generation based on qunatum phase fluctuations," 2012. [15] C. Gabriel, C. Wittmann, D. Sych, R. Dong, W. Mauerer, U. L. Andersen, C. Marquardt and G. Leuchs, "A generator for unique quantum random numbers based on vacuum states," 2010. [16] J. Cheng, S. Liang, J. Qin, J. Li, Z. Yan, X. Jia, C. Xic and K. Peng, "Semi-device-independent quantum random number generator with a broadband squeezed state of light," 2024. [17] . L. Trevisan, "Extractors and Pseudorandom Generators," 1999. [18] J. Cheng, S. Liang, J. Qin, J. Li, Z. Yan, X. Jia, C. Xie and K. Peng, "Supplementary Information for "Semi-device-independent quantum random number generator with a broadband squeezed state of light"," 2024. [19] T. Symul, S. M. Assad and P. K. Lam, "Real time demonstration of high bitrate quantum random number generation with coherent laser light," 2011. [20] T. Michel, J. Y. Haw, D. G. Marangon, O. Thearle, G. Vallone, P. Villoresi, P. K. Lam and S. M. Assad, "Real-Time Source-Independent Quantum Random-Number Generator with Squeezed States," 2019. | - |
| dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/96782 | - |
| dc.description.abstract | 在通訊科技發達的現代,亂數的存在變得愈來愈重要,很多加密演算法其實就會需要亂數來讓其加密的結果更不容易被破解,所以亂數的品質就變得愈來愈重要,傳統的電腦習慣使用偽亂數,但偽亂數最大的問題就是背後有公式,一旦被發現公式整套亂數系統就不能使用,所以我們希望可以找到一個能產生足夠亂且背後無公式的亂數產生方法。
我們使用的方法是利用量子的技巧去產生亂數,因為量子本身就有隨機性存在,所以利用這種自然性質產生的亂數就符合無公式的要求,然而產生出來的亂數還是有可能不夠亂,所以這時候就需要萃取器去把亂數再進一步打亂,我們這邊比較了兩種萃取器,Hashing和Trevisan,結果Hashing在萃取結果上不但不輸Trevisan,效率還遠超過後者。 同時我們也分析源頭在怎麼樣的設定下可以產生出品質比較好的原始亂數,這樣再配上我們的萃取器就可以錦上添花,讓亂數的品質提升再提升,首先我們理論推導出光源愈squeeze萃取出來的有效位元數就愈多,第二個發現是在沒有鎖頻的情況下,頻寬愈高產生出來的亂數愈好,鎖頻的情況則無明顯差異,第三個發現是取樣頻率愈慢產生出來的亂數品質也會愈好,第四個發現是1055nm的光源會比1064nm的光源表現得更好,最後把取樣頻率設定成兩倍的低通濾波器頻率也會讓產生出來的亂數品質比較好。 最後我們評價亂數品質是使用autocorrelation和NIST的亂數標準,在我們的實驗中不管亂數原始的品質如何,在經過我們萃取之後autocorrelation幾乎都可以獲得改善,NIST的測試也會因為萃取過而有獲得改善。 | zh_TW |
| dc.description.abstract | In the modern era of advanced communication technology, the presence of random number has become increasingly important. Many encryption algorithms actually rely on random number to make their encryption results harder to crack. Therefore, the quality of random number is becoming more and more crucial. Traditional computers typically use pseudorandom numbers, but the biggest problem with pseudorandom numbers is that they are generated based on formulas. Once the formula is discovered, the entire random number system becomes compromised. Therefore, we aim to find a method that can produce sufficiently random numbers without any underlying formula.
The method we use is based on quantum techniques to generate random number. Since quantum mechanics inherently involves randomness, random number generated through these natural properties meets the requirement of having no underlying formula. However, the generated randomness may still not be sufficiently random, so a random number extractor is needed to further shuffle the random number. We compared two types of extractors: Hashing and Trevisan, and found that Hashing not only performs as well as Trevisan in terms of the extraction result but is also much more efficient. At the same time, we analyzed the conditions under which the source can generate better-quality raw random number. With our extractor, we can further enhance the quality of random number. First, we theoretically deduced that the more the light source is squeezed, the more effective bits can be extracted. The second finding is that in the absence of frequency locking, higher bandwidth produces better random number. However, there is no significant difference when frequency locking is applied. The third finding is that a slower sampling frequency results in better-quality random number. The fourth finding is that a 1055nm light source performs better than a 1064nm light source. Finally, setting the sampling frequency to twice the low-pass filter cutoff frequency also improves the quality of the generated random number. Lastly, we evaluate the quality of the random numbers using autocorrelation and the NIST random number standard. In our experiments, regardless of the original quality of the random numbers, the autocorrelation is almost always improved after our extraction process, and the NIST tests also show improvement due to the extraction. | en |
| dc.description.provenance | Submitted by admin ntu (admin@lib.ntu.edu.tw) on 2025-02-21T16:31:43Z No. of bitstreams: 0 | en |
| dc.description.provenance | Made available in DSpace on 2025-02-21T16:31:43Z (GMT). No. of bitstreams: 0 | en |
| dc.description.tableofcontents | Acknowledgement i
摘要 ii Abstract iii Table of graphs vii Table of tables xii Chapter 1 Introduction 1 Chapter 2 Preliminaries 4 2.1 Nyquist Theorem 4 2.2 Min-entropy 5 2.3 Autocorrelation 6 2.4 NIST 7 Chapter 3 Related works 10 3.1 Hashing extractor 10 3.2 Trevisan 13 Chapter 4 Numerical Experiment 16 4.1 Experimental Architecture 16 4.2 Nyquist Theorem 17 4.3 Bandwidth 19 4.4 Sampling rate 20 4.5 Signal to noise ratio 23 4.6 Laser wavelength 30 4.7 Squeeze parameter 32 Chapter 5 Extractors 35 5.1 Hashing extractor 35 5.2 Trevisan extractor 50 5.3 Single-bit extractor 52 Chapter 6 Conclusions 54 Reference 57 | - |
| dc.language.iso | en | - |
| dc.subject | Hashing | zh_TW |
| dc.subject | Trevisan | zh_TW |
| dc.subject | NIST | zh_TW |
| dc.subject | 亂數 | zh_TW |
| dc.subject | 量子 | zh_TW |
| dc.subject | Trevisan | en |
| dc.subject | quantum | en |
| dc.subject | random number | en |
| dc.subject | NIST | en |
| dc.subject | Hashing | en |
| dc.title | 量子隨機亂數之數值分析與亂數萃取器軟體實作和比較 | zh_TW |
| dc.title | Numerical Analysis of Quantum Random Numbers and Implementation and Comparison of Random number Extractor Software | en |
| dc.type | Thesis | - |
| dc.date.schoolyear | 113-1 | - |
| dc.description.degree | 碩士 | - |
| dc.contributor.oralexamcommittee | 李明昌;李瑞光 | zh_TW |
| dc.contributor.oralexamcommittee | Ming-Chang Lee;Ray-Kuang Lee | en |
| dc.subject.keyword | 量子,亂數,NIST,Hashing,Trevisan, | zh_TW |
| dc.subject.keyword | quantum,random number,NIST,Hashing,Trevisan, | en |
| dc.relation.page | 58 | - |
| dc.identifier.doi | 10.6342/NTU202500082 | - |
| dc.rights.note | 同意授權(限校園內公開) | - |
| dc.date.accepted | 2025-01-13 | - |
| dc.contributor.author-college | 電機資訊學院 | - |
| dc.contributor.author-dept | 電信工程學研究所 | - |
| dc.date.embargo-lift | 2025-02-22 | - |
| 顯示於系所單位: | 電信工程學研究所 | |
文件中的檔案:
| 檔案 | 大小 | 格式 | |
|---|---|---|---|
| ntu-113-1.pdf 授權僅限NTU校內IP使用(校園外請利用VPN校外連線服務) | 2.87 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。
