CN111510286A - Error code negotiation method of quantum key distribution system - Google Patents
Error code negotiation method of quantum key distribution system Download PDFInfo
- Publication number
- CN111510286A CN111510286A CN202010188031.XA CN202010188031A CN111510286A CN 111510286 A CN111510286 A CN 111510286A CN 202010188031 A CN202010188031 A CN 202010188031A CN 111510286 A CN111510286 A CN 111510286A
- Authority
- CN
- China
- Prior art keywords
- error
- blocks
- block
- setpro
- round
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0061—Error detection codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0852—Quantum cryptography
- H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
- Error Detection And Correction (AREA)
Abstract
An error code negotiation method of a quantum key distribution system solves the problem that the negotiation efficiency is reduced due to collision in the error code negotiation process of the existing Cascade algorithm, and belongs to the technical field of quantum communication. The method comprises the following steps: s1, in the first round, the process of binary search parity error correction is processed in parallel; s2, in the second round, blocks containing odd errors are obtained, the blocks with the highest collision probability are placed in a processing set, and the blocks with the highest collision probability are placed in an error set; s3, calculating the collision probability of the error set and the blocks in the processing set, selecting n blocks with the minimum collision probability in the error set to be placed in the processing set, performing one-step binary search parity error correction on the blocks in the processing set each time, removing the blocks from the processing set when the error blocks are searched, backtracking the positions of the error blocks by a previous round, if the error blocks are in the error set, removing the error blocks, and if the error blocks are not in the error set, adding the error blocks into the error set; s4, repeating S3 until the error set is 0, and switching to S5; s5, all subsequent rounds as per S2 to S4.
Description
Technical Field
The invention relates to an error code negotiation algorithm, in particular to an improvement method of a Cascade error code negotiation algorithm, belonging to the technical field of quantum communication.
Background
The role of the error negotiation algorithm is to correct the error bits in the screening code in Quantum Key Distribution (QKD). Error negotiation is the most interesting link in QKD post-processing.
The error code negotiation algorithm mainly comprises two categories, one category is an interactive error code negotiation algorithm, and the other category is an error code negotiation algorithm based on a forward error correction code. The Cascade algorithm is an interactive-based error code negotiation algorithm with better performance at present.
The Cascade algorithm, proposed by Brassard et al in 1993, is an improvement of the BBBSS algorithm, and the core of both algorithms is a BINARY search (BINARY) process. The method comprises the following steps:
1) alice splits the a data string into two parts and sends the first part of the parity syndrome to Bob.
2) Bob divides the data string B into two parts in the same way, calculates the syndrome of the first part and compares it with the received data to determine in which part an odd number of errors are present.
3) The data string is continually partitioned until an error is found.
In the traditional BBBSS algorithm, data is scrambled in each round, then screening codes are blocked according to the block length, for each block, a parity check code is used for finding errors, and binary search positioning and turning over are used for correcting the errors. The Cascade algorithm is additionally provided with a backtracking mechanism on the basis of the thought, and can find a series of error positions through backtracking by recording historical block information when the ith (i is more than or equal to 2) round is positioned to a new error, so that the effect of correcting the error by less exposed information is achieved, and the negotiation efficiency is improved. The specific flow of the original Cascade algorithm is as follows: inputting: the initial key sequence A of Alice and the initial key sequence B of Bob have the sequence length of M and the error rate; and (3) outputting: a negotiated key sequence;
the process of carrying out error code negotiation by the Cascade algorithm comprises the following steps:
Step 2, in the first round of negotiation, the data is divided into blocks with the block length of N1Is totally divided
Block according to document N1And (4) keeping the number of error codes in each block to be less than or equal to 1 as much as possible, namely 0.73/. Denote the first block in a partition as
The v block is marked as
The superscript indicates the number of rounds of negotiation and the subscript indicates the number of blocks in that round. The v-th block contains bit information of which the position is { l | (v-1) N1＜l≤vN1}。
And 3, calculating the parity of each group of data by Alice, informing Bob through a public channel, comparing, correcting by using a binary parity error correction algorithm when the parity is inconsistent, and not discarding any data in the whole process unlike the binary parity error correction algorithm so as to correct more errors. After this round of error correction, all
There are only an even number of errors, including 0.
Step 4, carrying out second round error correction, wherein the block length is N2According to document Ni＝2×Ni-1Using a new scrambling function
Dividing M bits of data into
And (5) blocking. By using
Indicates the sequence of j blocks after the second round of blocks, at
The position of the data within the block is { l | f2(l) J, where l is the number already determined in step 1. And after the blocks are partitioned, carrying out parity check on each block, and when the blocks are partitioned with inconsistency between Alice and Bob, carrying out error correction by using a binary parity error correction method. If at
If an error is found in the first round, the block with the data number l in the first round of the block can be judged
There must be an additional odd number of errors. The binary parity error correction method is used again for this block to correct errors. Until no more new errors can be found, the second round of negotiation ends. The negotiated key may still contain an even number of errors, requiring a third or further round of negotiation.
And 5, repeating the step 4 to carry out block error correction. In the ith (i > 1) round of negotiation, a random function is adopted
Dividing the whole data into M/NiBlocks each of length NiPerforming parity comparison, and if the parity is not consistent, performing binary parity correction
The error code with the sequence number l is found in the code, and can be corrected in the block containing the sequence number l
And finding other odd error codes, and then correcting the error by a binary error correction method. When no new error is found, a new round of negotiation is entered.
And 6, repeating the negotiation step in the step 5 until the nth round, and finishing the negotiation process. Most documents adopt 14 rounds of negotiation, so that the frame error rate can be guaranteed to be low.
The Cascade algorithm generally has high negotiation efficiency, and meanwhile, the frame error rate is very low, and the calculation is simple. However, since multiple communication rounds are required, the communication resource demand of the Cascade algorithm is generally high, and when the channel environment is poor or the communication distance is long, the rate of the Cascade algorithm is limited. One solution is to process the binary search process in parallel, so that parity check information of different blocks can be sent simultaneously, the number of communication rounds can be effectively reduced, which means that the waiting time is reduced, because the network delay is often not effectively reduced. Doing so introduces new problems and parallel processing can reduce negotiation efficiency. In the serial processing, the interactive information is updated after each interaction and then the next step is carried out, but some information in the parallel process cannot be guaranteed to be updated before a certain block starts to correct errors. As shown in fig. 1, if the first block and the second block in the second round are error-corrected simultaneously and in parallel, the two blocks will be retrospectively located in the same block in the first round, and because two errors are found simultaneously, the block cannot be error-corrected by binary search. The block size shown in fig. one is 8, so the number of bits overhead is 2 × log28 to 6, and the serial process only consumes log28+log24-5, from which it can be seen: in the parallel process, as the information is not utilized in time, more bits are consumed for the whole error correction, the phenomenon is called as a collision phenomenon, the collision phenomenon is more and more severe along with the increase of the block length and the error rate, and the negotiation efficiency is also severely influenced.
Disclosure of Invention
Aiming at the problem that the negotiation efficiency is reduced due to collision in the error code negotiation process of the existing Cascade algorithm, the invention provides the error code negotiation method of the quantum key distribution system, which can prevent collision and reduce the loss of the negotiation efficiency.
The invention relates to an error code negotiation method of a quantum key distribution system, which comprises the following steps:
s1, carrying out first round error code negotiation, wherein the process of binary search parity error correction is processed in parallel;
s2, in the second round of error code negotiation, scrambling, blocking, comparing the parity check sums of all blocks, obtaining X blocks containing odd number of errors, making the initial value of a counter num be X, then selecting one block with the highest collision probability with other blocks from the X blocks, putting the block into a processing set setpro, and putting the rest X-1 blocks into an error set setwrong;
s3, calculating the collision probability between each block in the error set setwrung and the block in the processing set setpro, selecting n blocks with the minimum collision probability from the error set setwrung, putting the n blocks into the processing set setpro, and performing one-step binary search parity error correction on all the blocks in the processing set in parallel each time to enable the length of the blocks to be half of the original length; the magnitude of n is related to the severity of the collision; when two blocks in the processing set setpro find wrong bits, removing the block from the processing set setpro, reducing num by one, and tracing back to the position where the error is positioned in the previous round of error code negotiation, if the block containing the error is added into the processing set setwrong, removing the block, reducing num by one, otherwise, adding the block into the error set setwrong, and adding num by one;
s4, repeating S3 until num is 0, and switching to S5;
s5, performing the next round of error code negotiation according to the mode from S2 to S4 until the set round of error code negotiation is completed;
no data is discarded during the binary search parity error correction process.
Preferably, in S3, the method for calculating the collision probability between each block in the error set setwrong and the block in the processing set setpro includes:
the collision probability of each block blk in the error set setwrong and each block blk ' in the error set setpro is calculated respectively, and the calculation method of the collision probability dis (blk ', blk) of the block blk ' and the block blk is as follows:
len () is used to calculate the length of the block, and Crushtime is used to record the number of possible collisions in the current two blocks;
summing the calculated collision probabilities of the blocks blk in the error set setwrong and all the blocks in the error set setpro, namely: the collision probability of the block blk is obtained.
Preferably, in S3, the variation rule of the n value of the next binary search is:
next (n) represents the value of n for the next binary search, where size (setpro) is the size of the processing set setpro, α is a control parameter, and the initial value of n is 1.
The invention has the beneficial effects that the invention is a collision prevention mechanism, and has the following advantages:
1. the invention can convert the whole Cascade error code negotiation process into a parallel process to a certain degree, and is beneficial to improving the processing speed. And a large amount of error correction operations are processed in batches, the current information is utilized as much as possible, the error information obtained from setpro is updated in time, all current information is ensured to be updated during the processing of the following blocks, and meanwhile, if the collision phenomenon occurs, the collided blocks in setpro are removed, so that the loss is stopped in time, and the exposure of the information is reduced.
2. The invention utilizes a parameter α to control the number of blocks of the current parallel binary error correction, and selects a proper block process by calculating the collision probability, the invention has the advantages of minimizing the correlation of the blocks as much as possible, ensuring the results of the binary error correction not to influence each other in the backtracking process as much as possible, and reducing the occurrence of the collision phenomenon.
3. The method can more flexibly adjust the balance of processing speed and negotiation efficiency, the processing speed of the whole process can be adjusted by changing the parameter α, the speed is lower when α is smaller, the negotiation efficiency is higher, serial processing is carried out when α is equal to 1, and maximum parallel processing is carried out when α is equal to infinity, namely all blocks which can be processed currently are processed.
Drawings
Fig. 1 is a schematic flow chart of error negotiation of the Cascade algorithm.
Detailed Description
The embodiment is described with reference to fig. 1, and the error code negotiation method of a quantum key distribution system according to the embodiment of the present invention provides an optimization mechanism for collision prevention for solving the problem that the Cascade algorithm reduces negotiation efficiency due to collision during error code negotiation, so that loss of negotiation efficiency can be reduced as much as possible while the number of communication rounds is effectively reduced. For convenience of description, each of the binary lookups is referred to as a step in the present embodiment. And two sets are established, setwrong stores all blocks containing odd number of errors, setpro stores blocks for binary search. The method of the present embodiment includes: s1, carrying out first round error code negotiation, wherein the process of binary search parity error correction is processed in parallel; the first round has no backtracking process, so the collision problem can not occur, the parallel processing can be carried out, and the processing mode is consistent with the original Cascade.
S2, in the second round of error code negotiation, scrambling, blocking, comparing the parity check sums of all blocks, obtaining X blocks containing odd number of errors, making the initial value of a counter num be X, then selecting one block with the highest collision probability with other blocks from the X blocks, putting the block into a processing set setpro, and putting the rest X-1 blocks into an error set setwrong;
s3, for each step: calculating the collision probability of each block in the error set setwrong and the block in the processing set setpro, selecting n blocks with the minimum collision probability from the error set setwrong and putting the n blocks into the processing set setpro, and performing one-step binary search parity error correction on all the blocks in the processing set each time to enable the length of the blocks to be half of the original length; the magnitude of n is related to the severity of the collision;
when two blocks in the processing set setpro find wrong bits, removing the block from the processing set setpro, reducing num by one, and tracing back to the position where the error is positioned in the previous round of error code negotiation, if the block containing the error is added into the processing set setwrong, removing the block, reducing num by one, otherwise, adding the block into the error set setwrong, and adding num by one;
s4, repeating S3 until num is 0, and switching to S5;
s5, performing the next round of error code negotiation according to the mode from S2 to S4 until the set round of error code negotiation is completed;
no data is discarded during the binary search parity error correction process.
The embodiment measures the possibility of collision of two blocks by using the collision probability, supposing that the collision probability between the two blocks is very high, the two blocks are processed as far as possible at different times, if one block is added into the processing set setpro, the embodiment prevents the other block from being added into the processing set setpro before the processing is finished, and further prevents collision; the embodiment converts the whole Cascade error code negotiation process into a parallel process to a certain degree, and is favorable for improving the processing speed. And a large amount of error correction operations are processed in batches, the current information is utilized as much as possible, the error information obtained from setpro is updated in time, all current information is ensured to be updated during the processing of the following blocks, and meanwhile, if the collision phenomenon occurs, the collided blocks in setpro are removed, so that the loss is stopped in time, and the exposure of the information is reduced.
In a preferred embodiment, this embodiment provides a method of evaluating collision probability, in which two blocks blk1 and blk2 are assumed, and the number of possible collisions between the two blocks at present is recorded by Crushtime, and the initial value is 0. Each pair of bits in the two blocks is combined in the same block, by one plus Crushtime, in the previous error correction process. dis (blk1, blk2) is calculated as follows:
len () is used to calculate the length of a block;
smaller dis (blk1, blk2) represents lower collision probability. If dis (setpro, blk) is calculated for a block blk in the error set setwrong, i.e. for each block blk 'in the processing set setpro, the representative block blk calculates dis (blk', blk) for the entire processing set setpro, the method for calculating the collision probability dis (blk ', blk) between the block blk' and the block blk is as follows:
summing the calculated collision probabilities of the blocks blk in the error set setwrong and all the blocks in the error set setpro, namely: the collision probability dis (setpro, blk) of the block blk is obtained.
In order to reduce the occurrence of the collision phenomenon and improve the negotiation efficiency in a parallel state, the number of the blocks of the current parallel binary error correction is controlled by using a parameter α in the embodiment, and the appropriate block processing is selected by calculating the collision probability, so that the correlation of the blocks is reduced to the minimum as possible, the results of the binary error correction of the blocks cannot influence each other in the backtracking process as far as possible, and the occurrence of the collision phenomenon can be reduced.
next (n) represents the value of n for the next binary search, where size (setpro) is the size of the processing set setpro, α is a control parameter, and the initial value of n is 1.
The method can more flexibly adjust the balance of processing speed and negotiation efficiency, the processing speed of the whole process can be adjusted by changing the parameter α, the speed is lower when α is smaller, the negotiation efficiency is higher, serial processing is carried out when α is equal to 1, and maximum parallel processing is carried out when α is equal to infinity, namely all blocks which can be processed currently are processed.
In the above pre-collision avoidance mechanism, the parameter α determines the average degree of parallelism of the entire Cascade, which can seriously reduce the negotiation efficiency due to the high degree of parallelism in the same frame, in order to reduce the loss of negotiation efficiency, the invention does not select too large α, which is generally in the range of 1-127.
One specific example is given below:
in this embodiment, each frame is 64Kb long, the error rate is 3%, 16 frames are set in parallel, α is 64, and the negotiation process is as follows:
1) each round of block length is determined according to the error rate, where the first round is 32 block length, the second round is 256, and the 3 rd to 14 th rounds are half of the entire data length, i.e., 32 Kb.
2) The first round blocks the data by block length 32 and performs binary search error correction on the parity and different blocks. Because the first round does not backtrack, and has no relevance with other rounds during processing, the first round works independently and provides data for the second round as data preprocessing.
3) And in the second round, the preprocessed data in the first round are subjected to Arnold scrambling according to 64Kb, and the scrambling tables can share and save storage resources and are arranged in different frames. Each frame is partitioned into 256-length blocks. Then 16 frames start putting the parity and different blocks in parallel into respective setwrong. A counter num is initialized for each frame, the initial value being the number of parity and inconsistent blocks in the current frame.
4) For each step: calculating the collision probability of each block in setwrung by utilizing dis (setpro, blk) function from setwrung, selecting n blocks with the minimum collision probability from the collision probabilities and putting the n blocks into a processing set setpro. And performing one-step binary search on all the blocks in the processing set in parallel each time to enable the length of the blocks to become half of the original length. The variation of n is as follows.
Next (n) represents the value of n for the next step, where size (setpro) is the size of the processing set and α is the control parameter.
5) For each group, when a block in setpro finds an erroneous bit in two, that block is removed from setpro, num is reduced by one. And backtracking to the position of the first round positioning error, if the block containing the error is added into the setwrong set, moving the block out, and reducing num by one. Otherwise, the block is added into setwrong set, num is added with one
6) And repeating the steps 3-4 until num is 0. Start the next round
7) The third round to the tenth round are processed in the same way as the second round, but the block length of the block is half of the frame length, namely 32Kb, and positioning errors can be positioned in all the previous rounds during backtracking.
Although the invention herein has been described with reference to particular embodiments, it is to be understood that these embodiments are merely illustrative of the principles and applications of the present invention. It is therefore to be understood that numerous modifications may be made to the illustrative embodiments and that other arrangements may be devised without departing from the spirit and scope of the present invention as defined by the appended claims. It should be understood that features described in different dependent claims and herein may be combined in ways different from those described in the original claims. It is also to be understood that features described in connection with individual embodiments may be used in other described embodiments.
Claims (3)
1. An error code negotiation method of a quantum key distribution system, the method comprising:
s1, carrying out first round error code negotiation, wherein the process of binary search parity error correction is processed in parallel;
s2, in the second round of error code negotiation, scrambling, blocking, comparing the parity check sums of all blocks, obtaining X blocks containing odd number of errors, making the initial value of a counter num be X, then selecting one block with the highest collision probability with other blocks from the X blocks, putting the block into a processing set setpro, and putting the rest X-1 blocks into an error set setwrong;
s3, calculating the collision probability between each block in the error set setwrung and the block in the processing set setpro, selecting n blocks with the minimum collision probability from the error set setwrung, putting the n blocks into the processing set setpro, and performing one-step binary search parity error correction on all the blocks in the processing set in parallel each time to enable the length of the blocks to be half of the original length; the magnitude of n is related to the severity of the collision;
when two blocks in the processing set setpro find wrong bits, removing the block from the processing set setpro, reducing num by one, and tracing back to the position where the error is positioned in the previous round of error code negotiation, if the block containing the error is added into the processing set setwrong, removing the block, reducing num by one, otherwise, adding the block into the error set setwrong, and adding num by one;
s4, repeating S3 until num is 0, and switching to S5;
s5, performing the next round of error code negotiation according to the mode from S2 to S4 until the set round of error code negotiation is completed;
no data is discarded during the binary search parity error correction process.
2. The error code negotiation method of the quantum key distribution system according to claim 1, wherein in S3, the method for calculating the collision probability between each block in the error set setwrong and the block in the processing set setpro comprises:
the collision probability of each block blk in the error set setwrong and each block blk ' in the error set setpro is calculated respectively, and the calculation method of the collision probability dis (blk ', blk) of the block blk ' and the block blk is as follows:
len () is used to calculate the length of the block, and Crushtime is used to record the number of possible collisions in the current two blocks;
summing the calculated collision probabilities of the blocks blk in the error set setwrong and all the blocks in the error set setpro, namely: the collision probability of the block blk is obtained.
3. The error code negotiation method of the quantum key distribution system according to claim 1, wherein in S3, the n value variation law of the next binary search is:
next (n) represents the value of n for the next binary search, where size (setpro) is the size of the processing set setpro, α is a control parameter, and the initial value of n is 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010188031.XA CN111510286B (en) | 2020-03-17 | 2020-03-17 | Error code negotiation method of quantum key distribution system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010188031.XA CN111510286B (en) | 2020-03-17 | 2020-03-17 | Error code negotiation method of quantum key distribution system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111510286A true CN111510286A (en) | 2020-08-07 |
| CN111510286B CN111510286B (en) | 2022-12-09 |
Family
ID=71863983
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010188031.XA Active CN111510286B (en) | 2020-03-17 | 2020-03-17 | Error code negotiation method of quantum key distribution system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111510286B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112886970A (en) * | 2021-01-11 | 2021-06-01 | 哈尔滨工业大学 | Negotiation method for continuous variable quantum key distribution |
| CN114095164A (en) * | 2021-11-22 | 2022-02-25 | 西南大学 | Quantum key distribution method based on quantum entanglement digital compression |
| WO2024023234A1 (en) * | 2022-07-28 | 2024-02-01 | Thales | Quantum distribution methods and associated telecommunication devices |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040190719A1 (en) * | 2001-12-21 | 2004-09-30 | Hoi Kwong Lo | Decoupling error correction from privacy amplification in quantum key distribution |
| CN101217284A (en) * | 2008-01-11 | 2008-07-09 | 北京大学 | An encoding method, decoding method and decoder of LDPC cascade connection code |
| CN101345607A (en) * | 2008-08-14 | 2009-01-14 | 西安电子科技大学 | Encoding/decoding method of multidimensional crossing parallel cascade single-parity check code |
| US20130315395A1 (en) * | 2012-05-25 | 2013-11-28 | The Johns Hopkins University | Embedded Authentication Protocol for Quantum Key Distribution Systems |
| CN103501221A (en) * | 2013-09-29 | 2014-01-08 | 哈尔滨工业大学 | Evaluating method of error code negotiation algorithm for quantum communication |
| CN106027231A (en) * | 2015-03-28 | 2016-10-12 | 北京大学 | Method for carrying out cascading error correction for error code in quantum secret key distribution postprocessing |
| CN106161009A (en) * | 2016-08-19 | 2016-11-23 | 浙江神州量子网络科技有限公司 | Quantum key distribution system based on coding time phase and encoding apparatus and decoding apparatus |
| CN106506154A (en) * | 2016-12-09 | 2017-03-15 | 浙江神州量子网络科技有限公司 | A kind of QKD system and method based on COW agreements |
| CN106788984A (en) * | 2015-11-20 | 2017-05-31 | 华为技术有限公司 | A kind of quantum communications method and apparatus |
| CN107333337A (en) * | 2017-08-02 | 2017-11-07 | 北京邮电大学 | A kind of accidental access method and device being grouped based on space |
| CN107733441A (en) * | 2016-08-12 | 2018-02-23 | 中兴通讯股份有限公司 | Coding method and device, interpretation method and device |
-
2020
- 2020-03-17 CN CN202010188031.XA patent/CN111510286B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040190719A1 (en) * | 2001-12-21 | 2004-09-30 | Hoi Kwong Lo | Decoupling error correction from privacy amplification in quantum key distribution |
| CN101217284A (en) * | 2008-01-11 | 2008-07-09 | 北京大学 | An encoding method, decoding method and decoder of LDPC cascade connection code |
| CN101345607A (en) * | 2008-08-14 | 2009-01-14 | 西安电子科技大学 | Encoding/decoding method of multidimensional crossing parallel cascade single-parity check code |
| US20130315395A1 (en) * | 2012-05-25 | 2013-11-28 | The Johns Hopkins University | Embedded Authentication Protocol for Quantum Key Distribution Systems |
| CN103501221A (en) * | 2013-09-29 | 2014-01-08 | 哈尔滨工业大学 | Evaluating method of error code negotiation algorithm for quantum communication |
| CN106027231A (en) * | 2015-03-28 | 2016-10-12 | 北京大学 | Method for carrying out cascading error correction for error code in quantum secret key distribution postprocessing |
| CN106788984A (en) * | 2015-11-20 | 2017-05-31 | 华为技术有限公司 | A kind of quantum communications method and apparatus |
| CN107733441A (en) * | 2016-08-12 | 2018-02-23 | 中兴通讯股份有限公司 | Coding method and device, interpretation method and device |
| CN106161009A (en) * | 2016-08-19 | 2016-11-23 | 浙江神州量子网络科技有限公司 | Quantum key distribution system based on coding time phase and encoding apparatus and decoding apparatus |
| CN106506154A (en) * | 2016-12-09 | 2017-03-15 | 浙江神州量子网络科技有限公司 | A kind of QKD system and method based on COW agreements |
| CN107333337A (en) * | 2017-08-02 | 2017-11-07 | 北京邮电大学 | A kind of accidental access method and device being grouped based on space |
Non-Patent Citations (2)
| Title |
|---|
| BELLOT P: ""BB84 implementation and computer reality"", 《2009 IEEE-RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES》 * |
| 林毅: ""连续变量量子密钥分发后处理算法研究"", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112886970A (en) * | 2021-01-11 | 2021-06-01 | 哈尔滨工业大学 | Negotiation method for continuous variable quantum key distribution |
| CN112886970B (en) * | 2021-01-11 | 2022-07-01 | 哈尔滨工业大学 | Negotiation method for continuous variable quantum key distribution |
| CN114095164A (en) * | 2021-11-22 | 2022-02-25 | 西南大学 | Quantum key distribution method based on quantum entanglement digital compression |
| CN114095164B (en) * | 2021-11-22 | 2022-09-09 | 西南大学 | Quantum key distribution method based on quantum entanglement digital compression |
| WO2024023234A1 (en) * | 2022-07-28 | 2024-02-01 | Thales | Quantum distribution methods and associated telecommunication devices |
| FR3138593A1 (en) * | 2022-07-28 | 2024-02-02 | Thales | Quantum distribution methods and associated telecommunications devices |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111510286B (en) | 2022-12-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111510286B (en) | Error code negotiation method of quantum key distribution system | |
| CN107733446B (en) | Interpretation method and equipment, decoder | |
| CN102281123B (en) | Method for detecting the validity of downlink control information, decoder and baseband receiver for performing same | |
| CN106712898B (en) | Channel coding blind identification method based on Gaussian iteration column elimination element | |
| CN1196845A (en) | Method and apparatus for rate determination in communication system | |
| US20070266303A1 (en) | Viterbi decoding apparatus and techniques | |
| EP3032748B1 (en) | Coding and decoding with staggered parity | |
| RU2580797C1 (en) | Method of soft decoding of block codes | |
| CN1237300A (en) | Interference mitigation by joint detection of cochannel signals | |
| CN112260798B (en) | Physical layer control channel blind detection method based on polarization code | |
| CN107276725B (en) | Improved threshold-based SCMA low-complexity parallel multi-user detection method | |
| CN106452757B (en) | quantum secret sharing system and sharing method and error correction method thereof | |
| RU2438252C1 (en) | High correcting capacity decoder | |
| CN110661535B (en) | Method, device and computer equipment for improving Turbo decoding performance | |
| CN112821895B (en) | Code identification method for realizing high error rate of signal | |
| CN110798312A (en) | Secret negotiation method of continuous variable quantum key distribution system | |
| CN114421976B (en) | TPC iterative decoding method and decoder based on probability calculation | |
| CN110061747A (en) | A kind of bit reversal interpretation method based on threshold value of polarization code | |
| CN109639422B (en) | Error code negotiation method and device for discrete quantum key distribution system | |
| CN1309471A (en) | Viterbi decoder with reduced bit in branching metering computation processing | |
| JP7251615B2 (en) | ALIGNMENT PROCESSING DEVICE, ALIGNMENT PROCESSING METHOD, AND PROGRAM | |
| CN111342846B (en) | Decoding method, decoding device and computer readable storage medium | |
| CN111835363A (en) | LDPC code decoding method based on alternative direction multiplier method | |
| CN115088038A (en) | Improved quality value compression framework in aligned sequencing data based on new context | |
| CN115378582B (en) | Method and system for eliminating residual error code of continuous variable quantum key distribution |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |