透過您的圖書館登入
IP:18.118.140.108
  • 學位論文

量子通訊加密系統

Quantum communication encryption system

指導教授 : 周耀新

摘要


設計一個通訊系統,能被適用於大部分不同種類的量子位元雛形。遷就現有的科學技術,達到一個可運行的通訊加密系統。這系統希望達到One-time Pad的安全等級: 1. 隨機性 利用測量量子位元狀態時,若各狀態基底的系數大小相同,則各狀態被測量到的機率都相同,最終測量值為各種狀態公平的隨機挑選。 2. 無限長度的密碼對照表 每一個量子位元,被測量過後需要重新校正,而這校正的依據是根據當次的測量值決定。不斷的測量與校正,也不斷地產生新的量子位元狀態(新的編碼);因此,量子位元可以不斷地改變,密碼對照表也不斷地改變,相當於無限長度的密碼對照表。   雙方同步變動更新密碼表內容 . 每一個加密單元使用過後,將隨機改變 . 對應欄位的加密單元,會有相同的改變 . 同步的方法是依據相同的變化機率   雖然synchronous one-time Pad的欄位數目有現實的限制,但是每個欄位經過指令操作後會有變化;synchronous one-time Pad使用過後,又會變成不同原先的表,達到編碼符號對應具有隨機性,變化規則又不重複的設計目標。

並列摘要


We want to design a communication system which can be applied to most of the different types of quantum-bit prototype. By the existing science and technology, our communications encryption system can be made. The system hopes to achieve One-time Pad security level: 1. random If each base factor of the quantum bit state is the same, we will get the same probability value of every different quantum bit measured base. It means that the selection of quantum bit base is random. 2. the unlimited length password table Quantum bit need to be corrected after each measured action, and this way of correction is based on the last measured value. Every measuring and calibration also brings up a new state of quantum bits (new code). Therefore, as the quantum bit is changed constantly, the password table is constantly changing. This is the equivalent of an infinite length password table.   The content of synchronous one-time Pad . The encryption unit will be random changed after each using it. . Every encryption unit of the same fence has the same change. . The method of synchronization is according to the same probability of change.   Although there are practical number limitations of fence in the "synchronous one-time Pad, " but the fence will be changed after the operation. After using synchronous one-time Pad, the pad will turn into a different pad from original one. It approaches to our design goals of the random corresponding coded symbols without repeating.

參考文獻


〔1〕Quantum Computing, Part 1 , Andrew Glassner, Andrew Glassner’s Notebook, IEEE Computer Graphics and Applications,July/August 2001
〔2〕Quantum Computing, Part 2 , Andrew Glassner, Andrew Glassner’s Notebook, IEEE Computer Graphics and Applications,September/October 2001
〔3〕Quantum Computing, Part 3 , Andrew Glassner, Andrew Glassner’s Notebook, IEEE Computer Graphics and Applications,November/December 2001
〔4〕Application of Quantum Seal heory on Quantum Repeaters Guang Ping He School of Physics & Engineering and Advanced Research Center, Sun Yat-sen University, Guangzhou 510275, China
〔5〕Practical cryptography / Niels Ferguson, Bruce Schneier

被引用紀錄


Wu, Y. C. (2008). 集錦音樂自動作曲演算法之研究 [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2008.02236
柯佩芝(2009)。以旋律及和弦特徵分類曲風及和弦伴奏自動配置〔碩士論文,大同大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0081-3001201315104799

延伸閱讀


國際替代計量