基于連續(xù)變量量子密鑰分發(fā)的高效LDPC解碼算法
發(fā)布時(shí)間：2018-12-08 11:47
【摘要】：當(dāng)今社會(huì)已經(jīng)跨入信息化時(shí)代,信息在流通中體現(xiàn)價(jià)值,而流通要求高效率、高質(zhì)量。經(jīng)典密碼學(xué)在保障信息安全方而起到了關(guān)鍵性作用,然而隨著現(xiàn)代計(jì)算機(jī)的快速發(fā)展,量子計(jì)算機(jī)應(yīng)運(yùn)而生。量子密碼學(xué)是量子理論和經(jīng)典密碼學(xué)相結(jié)合的新學(xué)科,被證明有絕對(duì)安全性,量子密鑰分發(fā)(Quantum Key Distribution,簡(jiǎn)稱QKD)是量子密碼學(xué)的一個(gè)重要分支。目前,量子密鑰分發(fā)協(xié)議分為離散變量量子密鑰分發(fā)(DV-QKD)、連續(xù)變量量子密鑰分發(fā)(CV-QKD)和分布式相位參考(DPR-QKD)三種協(xié)議。數(shù)據(jù)協(xié)調(diào)是量子密鑰分發(fā)中必不可少的一個(gè)環(huán)節(jié),它可判斷竊聽的存在,糾正通信中大量的誤碼,并通過密性放大實(shí)現(xiàn)密鑰蒸餾。數(shù)據(jù)協(xié)調(diào)是利用經(jīng)典通信技術(shù)對(duì)在量子信道傳輸中信源和信宿的不一致進(jìn)行糾正的一種協(xié)議,因此屬于量子通信技術(shù)范疇下的經(jīng)典通信技術(shù)。數(shù)據(jù)協(xié)調(diào)實(shí)際是一個(gè)信道編碼問題,本文我們選擇具有靈活校驗(yàn)矩陣,碼率靈活的低密度奇偶校驗(yàn)碼(LDPC)作為整個(gè)系統(tǒng)的糾錯(cuò)碼。本文主要工作內(nèi)容如下：為了解決隨著分組碼長(zhǎng)的增加,利用常規(guī)LDPC碼的編碼方法編碼對(duì)于計(jì)算機(jī)的內(nèi)存難以承擔(dān)的問題,提出兩種有效方案：首先,該數(shù)據(jù)協(xié)調(diào)方案不同于傳統(tǒng)校驗(yàn)位譯碼,而是利用邊信息和原始數(shù)據(jù)產(chǎn)生的校驗(yàn)子聯(lián)合譯碼,最終得到理想碼字；其次,該方案中將H矩陣以稀疏矩陣的形式存貯,利用雙向十字鏈表只記錄1的位置的方式存貯H矩陣,這樣可極大的節(jié)省內(nèi)存空間,從而提高編碼的時(shí)效性與有效性。提出基于LDPC碼的離散變量QKD(即單光子)和高斯連續(xù)變量QKD的協(xié)調(diào)方案,其中連續(xù)變量QKD是以離散變量為基礎(chǔ)。針對(duì)高斯量子密鑰分發(fā)的數(shù)據(jù)協(xié)調(diào)問題,對(duì)高斯連續(xù)變量進(jìn)行了最優(yōu)量化,實(shí)現(xiàn)了Alice和Bob之間的互信息量最大。在分層錯(cuò)誤校正協(xié)議(SEC)和多電平編碼／多級(jí)解碼(MLC/MSD)協(xié)議的基礎(chǔ)上,各級(jí)碼流采用了LDPC碼進(jìn)行錯(cuò)誤校正,并推出了一次硬信息級(jí)間迭代更新公式參與MSD譯碼算法。在2.4GHz CPU,32G內(nèi)存服務(wù)器平臺(tái)上,離散變量實(shí)驗(yàn)中選取碼長(zhǎng)為105為最佳碼長(zhǎng),誤碼率收斂于1.0dB,每一分組譯碼時(shí)問僅需4s,譯碼收斂后速率達(dá)到24.85kbits/s。高斯連續(xù)變量實(shí)驗(yàn)仿真結(jié)果表明該算法可在信噪比4.9dB以上實(shí)現(xiàn)2×105個(gè)連續(xù)變量序列的可靠協(xié)調(diào),協(xié)調(diào)效率達(dá)91.71%,安全密鑰量可達(dá)8.645kbits/s。
[Abstract]:Nowadays the society has stepped into the information age, the information embodies the value in the circulation, and the circulation requires high efficiency and high quality. Classical cryptography plays a key role in ensuring information security. However, with the rapid development of modern computers, quantum computers emerge as the times require. Quantum cryptography is a new subject combining quantum theory and classical cryptography. It has been proved to have absolute security. Quantum key distribution (Quantum Key Distribution,) is an important branch of quantum cryptography. At present, quantum key distribution protocols include discrete variable quantum key distribution (DV-QKD), continuous variable quantum key distribution (CV-QKD) and distributed phase reference (DPR-QKD). Data coordination is an essential link in quantum key distribution. It can judge the existence of eavesdropping, correct a large number of error codes in communication, and realize key distillation through dense amplification. Data coordination is a kind of protocol which uses classical communication technology to correct the inconsistency between source and receiver in quantum channel transmission, so it belongs to the classical communication technology under the category of quantum communication technology. Data coordination is a channel coding problem. In this paper, we choose the low density parity check (LDPC) code with flexible check matrix and flexible bit rate as the error correction code of the whole system. The main work of this paper is as follows: in order to solve the problem that the coding method of conventional LDPC code is difficult to bear the memory of computer with the increase of block code length, two effective schemes are put forward: first, The data coordination scheme is different from the traditional parity-bit decoding, but uses the parser generated by the edge information and the original data to decode, and finally obtains the ideal codeword. Secondly, the H matrix is stored in the form of sparse matrix in this scheme, and the H matrix is stored only in the position of 1 by using the bidirectional cross linked list, which can save the memory space greatly and improve the efficiency and efficiency of coding. A concordant scheme of discrete variable QKD (single photon) and Gao Si continuous variable QKD based on LDPC code is proposed, in which the continuous variable QKD is based on discrete variable. Aiming at the problem of data coordination of Gao Si's quantum key distribution, the optimal quantization of Gao Si continuous variables is carried out, and the maximum amount of mutual information between Alice and Bob is realized. On the basis of layered error correction protocol (SEC) and multilevel coding / multilevel decoding (MLC/MSD) protocol, LDPC codes are used for error correction in all levels of code streams, and an iterative updating formula between hard information levels is proposed to participate in the MSD decoding algorithm. On the platform of 2.4GHz CPU,32G memory server, the best code length is 10 ~ 5 code length in discrete variable experiment. The BER converges to 1.0 dB, and only 4 ss is required for each block decoding. The convergent rate of decoding is 24.85 kbit / s. The simulation results of Gao Si continuous variable experiment show that the proposed algorithm can achieve reliable coordination of 2 脳 105 sequence of continuous variables above SNR 4.9dB, and the coordination efficiency is 91.71, and the amount of secure key can reach 8.645 kbits / s / s.
【學(xué)位授予單位】：山西大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN918.4;TN911.22
本文編號(hào)：2368294
[Abstract]:Nowadays the society has stepped into the information age, the information embodies the value in the circulation, and the circulation requires high efficiency and high quality. Classical cryptography plays a key role in ensuring information security. However, with the rapid development of modern computers, quantum computers emerge as the times require. Quantum cryptography is a new subject combining quantum theory and classical cryptography. It has been proved to have absolute security. Quantum key distribution (Quantum Key Distribution,) is an important branch of quantum cryptography. At present, quantum key distribution protocols include discrete variable quantum key distribution (DV-QKD), continuous variable quantum key distribution (CV-QKD) and distributed phase reference (DPR-QKD). Data coordination is an essential link in quantum key distribution. It can judge the existence of eavesdropping, correct a large number of error codes in communication, and realize key distillation through dense amplification. Data coordination is a kind of protocol which uses classical communication technology to correct the inconsistency between source and receiver in quantum channel transmission, so it belongs to the classical communication technology under the category of quantum communication technology. Data coordination is a channel coding problem. In this paper, we choose the low density parity check (LDPC) code with flexible check matrix and flexible bit rate as the error correction code of the whole system. The main work of this paper is as follows: in order to solve the problem that the coding method of conventional LDPC code is difficult to bear the memory of computer with the increase of block code length, two effective schemes are put forward: first, The data coordination scheme is different from the traditional parity-bit decoding, but uses the parser generated by the edge information and the original data to decode, and finally obtains the ideal codeword. Secondly, the H matrix is stored in the form of sparse matrix in this scheme, and the H matrix is stored only in the position of 1 by using the bidirectional cross linked list, which can save the memory space greatly and improve the efficiency and efficiency of coding. A concordant scheme of discrete variable QKD (single photon) and Gao Si continuous variable QKD based on LDPC code is proposed, in which the continuous variable QKD is based on discrete variable. Aiming at the problem of data coordination of Gao Si's quantum key distribution, the optimal quantization of Gao Si continuous variables is carried out, and the maximum amount of mutual information between Alice and Bob is realized. On the basis of layered error correction protocol (SEC) and multilevel coding / multilevel decoding (MLC/MSD) protocol, LDPC codes are used for error correction in all levels of code streams, and an iterative updating formula between hard information levels is proposed to participate in the MSD decoding algorithm. On the platform of 2.4GHz CPU,32G memory server, the best code length is 10 ~ 5 code length in discrete variable experiment. The BER converges to 1.0 dB, and only 4 ss is required for each block decoding. The convergent rate of decoding is 24.85 kbit / s. The simulation results of Gao Si continuous variable experiment show that the proposed algorithm can achieve reliable coordination of 2 脳 105 sequence of continuous variables above SNR 4.9dB, and the coordination efficiency is 91.71, and the amount of secure key can reach 8.645 kbits / s / s.
【學(xué)位授予單位】：山西大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TN918.4;TN911.22
【參考文獻(xiàn)】
相關(guān)期刊論文 前1條
1 陳曉峰,王育民;公鑰密碼體制研究與進(jìn)展[J];通信學(xué)報(bào);2004年08期
，本文編號(hào)：2368294
本文鏈接：http://sikaile.net/kejilunwen/wltx/2368294.html
最近更新
教材專著
