US10103881B2 - Permutation method for correcting bit error in quantum key distribution protocol - Google Patents
Permutation method for correcting bit error in quantum key distribution protocol Download PDFInfo
- Publication number
- US10103881B2 US10103881B2 US14/694,742 US201514694742A US10103881B2 US 10103881 B2 US10103881 B2 US 10103881B2 US 201514694742 A US201514694742 A US 201514694742A US 10103881 B2 US10103881 B2 US 10103881B2
- Authority
- US
- United States
- Prior art keywords
- reconciliation
- bit
- bit string
- bits
- length
- 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.)
- Active, expires
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
- H04L9/0858—Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/34—Encoding or coding, e.g. Huffman coding or error correction
Definitions
- the present disclosure in one or more embodiments relates to a permutation method for reconciling bit errors in a quantum key distribution protocol.
- QKD Quantum key distribution
- a transmitter generates a random number sequence (sequence of 1s and 0s: transmission data), and randomly determines a transmission code (+: corresponding to a measuring apparatus capable of identifying light polarized in horizontal and vertical directions, x: corresponding to a measuring apparatus capable of identifying light polarized in diagonal directions).
- the polarization direction of transmitted light is automatically determined by using a combination of the random number sequence and the transmission code.
- This stage performs transmission of quantum signals such as horizontally polarized light with a combination of 0 and +, vertically polarized light with a combination of 1 and +, 45°-diagonally polarized light with a combination of 0 and x, and 135°-diagonally polarized light with a combination of 1 and x.
- a receiver randomly determines a reception code (as described above, +: capable of identifying light polarized in horizontal and vertical directions, x: capable of identifying light polarized in diagonal directions), and measures light on the quantum channel to obtain reception data (raw key).
- a reception code as described above, +: capable of identifying light polarized in horizontal and vertical directions, x: capable of identifying light polarized in diagonal directions
- the probability that the transmission and reception codes are identical to each other is 1/2, since the transmitter and the receiver have arbitrarily determined the transmission and reception codes, respectively. If or when the codes are identical, the receiver obtains the same bits as those in the random number sequence generated by the transmitter, as reception data.
- the receiver obtains 0 with a combination of horizontally polarized light and reception code +, 1 with a combination of vertically polarized light and reception code +, 0 with a combination of 45°-diagonally polarized light and reception code x, and 1 with a combination of 135°-diagonally polarized light and reception code x.
- the codes are not identical, there is no correlation between the random number sequence generated by the transmitter and the reception data measured by the receiver due to quantum mechanical characteristics.
- the transmitter and the receiver then exchange and share code information to determine whether the transmission and reception codes are identical, and maintain only the random number sequence and the reception data corresponding to the identical part.
- the transmitter and the receiver open a certain randomly determined part (e.g., half) of the residual random number sequence and the reception data to check a quantum bit error rate (abbreviated below as QBER), thereby determining whether any attacker eavesdrops.
- QBER quantum bit error rate
- the remaining random number sequence and the reception data will be completely identical to each other when the transmission and reception systems and the channel have no error, in practical QKD systems QBER of about 3 to 7% usually occurs due to the imperfection of the transmission and reception systems and the channel.
- an eavesdropping attack of an attacker increases the QBER to 25% or above (when the whole bit string is eavesdropped) based on the principle of quantum mechanics
- an appropriate reference value e.g., 8%
- the inventor(s) has noted that since the sifted key generated through the QKD protocol has bit errors of about 3 to 7% due to the imperfection of the channel and the transmission and reception systems, it is necessary to implement a post-processing protocol consisting of a reconciliation process for reconciling or removing bit errors and a privacy amplification process for removing information leaked in a quantum communication process and information leaked in the reconciliation process.
- a post-processing protocol consisting of a reconciliation process for reconciling or removing bit errors and a privacy amplification process for removing information leaked in a quantum communication process and information leaked in the reconciliation process.
- the inventor(s) has experienced that the efficiency of a post-processing procedure in terms of operation and communication needs to be maximized to increase the key generation speed of a QKD protocol including the post-processing procedure.
- a permutation method for reconciling bit errors in a quantum key reconciliation protocol performing an iterative reconciliation process comprises: obtaining a bit string through a previous reconciliation step; and permuting bits in the bit string obtained from the previous reconciliation step before a subsequent reconciliation step by performing a linear modulo operation based on a length of the bit string and a length of a block for the subsequent reconciliation step.
- a method for reconciling bit errors in a sifted key generated through a quantum key distribution (QKD) protocol includes: repeatedly performing a reconciliation step including the substeps of: dividing a bit string subject to bit error reconciliation into one or more blocks having a predetermined length; searching for a block containing an odd number of bit errors among the divided one or more blocks by performing a parity check on each of the divided one or more blocks; and (3) performing a predetermined operation according to a reconciliation protocol on the block containing the odd number of the bit errors.
- bits in a bit string reconciled in a previous reconciliation step are permuted before a subsequent reconciliation step by performing a linear modulo operation based on a length of the reconciled bit string and a length of a block for the subsequent reconciliation step.
- a non-transitory computer-readable medium having instructions stored thereon, which, when executed by at least one processor, cause the processor to perform permutation operations for reconciling bit errors in a quantum key reconciliation protocol performing an iterative reconciliation process, the permutation operations comprising: obtaining a bit string through a previous reconciliation step; and permuting bits in the bit string obtained from the previous reconciliation step before a subsequent reconciliation step by performing a linear modulo operation based on a length of the bit string and a length of a block for the subsequent reconciliation step.
- FIGS. 1A and 1B are diagrams showing Cascade protocol and Winnow protocol, respectively.
- FIG. 2 is a diagram of a reconciliation process according to Winnow protocol.
- FIG. 3 is a flowchart of a permutation algorithm according to at least one embodiment of the present disclosure.
- FIG. 4 is a diagram of an exemplary method for permuting bits in a bit string by using a linear modulo operation according to at least one embodiment of the present disclosure.
- Some embodiments of the present disclosure provide a permutation method using only a linear modulo operation instead of random permutation to arbitrarily rearrange bit errors in a reconciliation process of a QKD post-processing procedure.
- a permutation algorithm corresponds to a method for permuting bits in a reconciled bit string before a subsequent unit reconciliation process in a quantum key reconciliation protocol performing an iterative reconciliation process.
- a description thereof is now given using a reconciliation process according to Winnow protocol as an example.
- the reconciliation process uses a variety of key reconciliation protocols.
- Some examples of the key reconciliation protocols include Cascade, Winnow and low density parity check (LDPC) protocols, and schemes capable of improving the efficiency of those protocols are currently suggested.
- LDPC low density parity check
- FIGS. 1A and 1B are diagrams showing Cascade protocol and Winnow protocol, respectively.
- the Cascade protocol is adapted to divide a bit string into blocks having appropriate sizes, and reconcile or remove error bits included in each block by detecting the error bits through a binary search based on the parity operation of the respective blocks.
- the Cascade protocol is not appropriate to implement a high-speed QKD protocol: although the Cascade protocol does not generate additional bit errors during the reconciliation process, a single reconciliation process can reconcile a single bit error only in a block including an odd number of bit errors and thus should be repeated an enormous number of times to reconcile all bit errors.
- the Winnow protocol illustrated in FIG. 1B is a scheme for using syndrome of a Hamming code to reconcile error bits in blocks having different parity bit, instead of binary search.
- Table 1 organizes the features of the Cascade, Winnow and LDPC protocols.
- Bit errors remaining in each block after every unit reconciliation process need to be present only in an even number. If or when such a bit error distribution is constantly maintained, the residual bit errors will not be removed even after a subsequent unit reconciliation process. Considering this, random shuffling needs to be performed before the subsequent unit reconciliation process to arbitrarily relocate the bit errors.
- permutation information is generated in one party using a True Random Number Generator (TRNG) or a Pseudo Random Number Generator (PRNG) to provide n! permutation variabilities for a key bit string of length n generated in each unit reconciliation process, and is transmitted to an opposite party.
- TRNG True Random Number Generator
- PRNG Pseudo Random Number Generator
- the inventor(s) has noted that the goal of permutation or shuffling in reconciliation is not to achieve randomness but to efficiently change an even number of bit errors in a block to an odd number.
- FIG. 2 is a diagram of a reconciliation process according to Winnow protocol.
- a transmitter and a receiver of a QKD system divide a sifted key into blocks having an appropriate size, calculate parity of each of the divided blocks, and compare the calculated parity to that calculated by the other communication party.
- a block having different parity values calculated includes an odd number of error bits, and the error bits of this block are found using Hamming syndrome.
- Such error bit reconciliation through block division and Hamming syndrome is repeatedly performed after bits in a bit string are permuted.
- the length ‘a’ of the divided block is a multiple of 2 and is, for example, a ⁇ 8, 16, 32, 64, 128, 256, 512 ⁇ .
- bits in a bit string are permuted by using a linear modulo operation based on the length ‘n’ of the bit string and the length ‘a’ of a block for a subsequent unit reconciliation process.
- FIG. 3 is a flowchart of a permutation algorithm according to at least one embodiment of the present disclosure.
- the permutation algorithm according to at least one embodiment of the present disclosure includes the following four main steps.
- Step 1 Whether the length of a bit string subject to bit error reconciliation is an even number or an odd number is determined (S 310 ).
- Step 2 If or when the length of the bit string subject to bit error reconciliation is an even number, for example, the last bit is removed to change the bit string to an odd number length (n ⁇ n ⁇ 1) (S 315 ). If or when the length of the bit string is an odd number, no change is made.
- Step 3 Bits in the bit string are permuted by performing a linear modulo operation given by Equation 1 for the location ‘x’ of an input bit string and the size ‘a’ of a block to be divided in a subsequent unit reconciliation process (S 320 ).
- ‘a’ is a multiple of 2 and is, for example, a ⁇ 8, 16, 32, 64, 128, 256, 512 ⁇ .
- Equation 1 x denotes the location of a bit, a denotes the size of a block for a subsequent unit reconciliation process, and n denotes the length of a bit string.
- Equation 2 the linear modulo operation ‘F’ of Equation 1 is replaced by Equation 2 for an arbitrary integer ‘b’ since the effect of the linear modulo operation is not changed even when the result of the linear modulo operation is shifted by an arbitrary value.
- a(x ⁇ y) is a multiple of ‘n’ due to the properties of a modulo operation.
- ‘n’ is an odd number and ‘a’ is an even number
- the greatest common divisor of ‘n’ and ‘a’ is 1, and thus ‘x ⁇ y’ is a multiple of ‘n’.
- steps 1 and 2 make up a procedure for allowing the linear modulo operation ‘F’ to satisfy one-to-one correspondence condition, i.e., to be a one-to-one function.
- steps 1 and 2 is implemented using various other methods.
- At least one of the length ‘n’ of the bit string subject to bit error reconciliation and the length ‘a’ of the block for the subsequent unit reconciliation process may be increased or decreased.
- Four steps of the permutation algorithm of FIG. 3 are implemented by, for example, one or more processors and/or application-specific integrated circuits (ASICs) which are equipped with or included in a specific or dedicated device or computer to perform the permutation algorithm.
- ASICs application-specific integrated circuits
- FIG. 4 is a diagram of an exemplary method for permuting bits in a bit string with a linear modulo operation according to at least one embodiment of the present disclosure.
- FIG. 4 illustrates a method for permuting a bit at location ‘x’ to location F(x) using Equation 1 on the assumption that the size of a block for a subsequent unit reconciliation process is 8 bits.
- bits in the same block are rearranged to different blocks by performing a linear modulo operation. Therefore, error bits in the same block are also dispersed to different blocks. Particularly, it is shown that the linear modulo operation is very effective to distribute continuous error bits, i.e., burst bits.
- some embodiments of the present disclosure provide the permutation method that is as simple as ‘n’ linear modulo operations and allows the parallel operation processing to be used.
- permutation information such as a random number sequence does not need to be shared with the other communication party through a communication channel.
- the permutation algorithm is also applicable to quantum key reconciliation protocols performing an iterative reconciliation process and, more particularly, to all quantum key reconciliation protocols performing an iterative reconciliation process composed of multiple reconciliation steps each configured to divide a bit string into blocks and then to perform a predetermined operation for error bit reconciliation.
- each step in the flowchart of FIG. 3 are able to be implemented in the form of one or more program commands that can be read and executed by a variety of computer systems and be recorded in any non-transitory, computer-readable recording medium.
- the non-transitory computer-readable recording medium includes a program command, a data file, a data structure, etc. alone or in combination.
- the program commands written to the medium are designed or configured especially for the at least one embodiment, or known to those skilled in computer software.
- non-transitory computer-readable recording medium examples include magnetic media such as a hard disk, a floppy disk, and a magnetic tape, optical media such as a CD-ROM and a DVD, magneto-optical media such as an optical disk, and a hardware device configured especially to store and execute a program, such as a ROM, a RAM, an EPROM memory, an EEPROM memory, and a flash memory.
- a program command examples include a premium language code executable by a computer using an interpreter as well as a machine language code made by a compiler.
- the hardware device is configured to operate as one or more software modules to implement one or more embodiments of the present disclosure.
- one or more of the processes or functionality described herein is/are performed by specifically configured hardware (e.g., by one or more application specific integrated circuits or ASIC(s)). Some embodiments incorporate more than one of the described processes in a single ASIC. In some embodiments, one or more of the processes or functionality described herein is/are performed by at least one processor which is programmed for performing such processes or functionality.
- a transmitter and a receiver perform permutation using a linear modulo operation, unlike a known random permutation scheme, a random number sequence generated using a TRNG/PRNG is not required, and permutation information needs not be transmitted and thus there is no time delay.
- a permutation algorithm according to some embodiments of the present disclosure is very effective to disperse continuous error bits, i.e., burst bits.
- a known algorithm which has generated permutation information by repeatedly performing random number sequence call and bit memory swapping n times by using a TRNG/PRNG and applied the permutation information to each of n bits to perform n! random permutations, is replaced by a permutation method as simple as applying a linear modulo operation to each bit.
- parallel operation processing may be used in this method.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR10-2012-0118138 | 2012-10-23 | ||
KR20120118138A KR101479112B1 (ko) | 2012-10-23 | 2012-10-23 | 양자키 분배 프로토콜에서 비트 오류 수정을 위한 치환 방법 |
PCT/KR2013/007611 WO2014065497A1 (fr) | 2012-10-23 | 2013-08-26 | Procédé de permutation permettant de corriger une erreur de bit dans un protocole de distribution de clé quantique |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/KR2013/007611 Continuation WO2014065497A1 (fr) | 2012-10-23 | 2013-08-26 | Procédé de permutation permettant de corriger une erreur de bit dans un protocole de distribution de clé quantique |
Publications (2)
Publication Number | Publication Date |
---|---|
US20150312035A1 US20150312035A1 (en) | 2015-10-29 |
US10103881B2 true US10103881B2 (en) | 2018-10-16 |
Family
ID=50544843
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/694,742 Active 2034-03-03 US10103881B2 (en) | 2012-10-23 | 2015-04-23 | Permutation method for correcting bit error in quantum key distribution protocol |
Country Status (4)
Country | Link |
---|---|
US (1) | US10103881B2 (fr) |
KR (1) | KR101479112B1 (fr) |
CN (1) | CN104737495B (fr) |
WO (1) | WO2014065497A1 (fr) |
Families Citing this family (22)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP6359285B2 (ja) * | 2014-02-17 | 2018-07-18 | 株式会社東芝 | 量子鍵配送装置、量子鍵配送システムおよび量子鍵配送方法 |
JP6400441B2 (ja) * | 2014-11-19 | 2018-10-03 | 株式会社東芝 | 量子鍵配送装置、量子鍵配送システムおよび量子鍵配送方法 |
KR101924100B1 (ko) * | 2017-05-23 | 2019-02-22 | 경희대학교 산학협력단 | 복수의 기기들 간에 양자 키 분배를 수행하는 방법 및 기기 |
KR101992959B1 (ko) * | 2017-06-26 | 2019-06-26 | 고려대학교 산학협력단 | 연속 변수 양자키 분배의 정보 조정을 위한 이진 비트키 추정 방법 및 장치 |
US10855454B1 (en) | 2018-03-09 | 2020-12-01 | Wells Fargo Bank, N.A. | Systems and methods for quantum session authentication |
US11343087B1 (en) * | 2018-03-09 | 2022-05-24 | Wells Fargo Bank, N.A. | Systems and methods for server-side quantum session authentication |
US11025416B1 (en) | 2018-03-09 | 2021-06-01 | Wells Fargo Bank, N.A. | Systems and methods for quantum session authentication |
US10728029B1 (en) | 2018-03-09 | 2020-07-28 | Wells Fargo Bank, N.A. | Systems and methods for multi-server quantum session authentication |
US11240013B1 (en) | 2018-08-20 | 2022-02-01 | Wells Fargo Bank, N.A. | Systems and methods for passive quantum session authentication |
US10855453B1 (en) | 2018-08-20 | 2020-12-01 | Wells Fargo Bank, N.A. | Systems and methods for time-bin quantum session authentication |
US11095439B1 (en) | 2018-08-20 | 2021-08-17 | Wells Fargo Bank, N.A. | Systems and methods for centralized quantum session authentication |
US11190349B1 (en) | 2018-08-20 | 2021-11-30 | Wells Fargo Bank, N.A. | Systems and methods for providing randomness-as-a-service |
US10540146B1 (en) | 2018-08-20 | 2020-01-21 | Wells Fargo Bank, N.A. | Systems and methods for single chip quantum random number generation |
CN109639422B (zh) * | 2019-01-23 | 2021-04-20 | 哈尔滨工业大学 | 一种面向离散型量子密钥分发系统的误码协商方法及装置 |
US11048839B2 (en) | 2019-03-29 | 2021-06-29 | International Business Machines Corporation | Adaptive error correction in quantum computing |
WO2020228961A1 (fr) * | 2019-05-16 | 2020-11-19 | Huawei Technologies Duesseldorf Gmbh | Dispositif et procédé permettant d'effectuer une réconciliation d'informations dans un système de distribution quantique de clés |
KR20210045285A (ko) | 2019-10-16 | 2021-04-26 | 고태영 | 양자 엔트로피 운용 서비스 시스템 |
KR20230093242A (ko) * | 2020-11-02 | 2023-06-27 | 엘지전자 주식회사 | Qkd 시스템에서 신드롬 비교 기반 qber 추정 방법 및 장치 |
CN112769555B (zh) * | 2020-12-30 | 2022-11-22 | 华南师范大学 | 一种用于多自由度调制qkd的密钥协商方法 |
NL2032162B1 (en) | 2022-06-14 | 2023-12-21 | Univ Delft Tech | Segmented error correction for QKD post-processing |
FR3138593A1 (fr) * | 2022-07-28 | 2024-02-02 | Thales | Procédés de distribution quantique et dispositifs de télécommunication associés |
WO2024122693A1 (fr) * | 2022-12-09 | 2024-06-13 | 엘지전자 주식회사 | Procédé d'authentification faisant appel à une clé symétrique pré-partagée pour une sélection d'emplacement d'informations d'authentification dans un système de communication quantique, et appareil associé |
Citations (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2002351499A (ja) | 2001-05-29 | 2002-12-06 | Victor Co Of Japan Ltd | 音声符号化データの編集方法、及び音声符号化信号編集装置 |
US20030223579A1 (en) * | 2000-07-13 | 2003-12-04 | Eran Kanter | Secure and linear public-key cryptosystem based on parity-check error-correcting |
US20040109564A1 (en) * | 2002-07-05 | 2004-06-10 | Nicolas Cerf | High-rate quantum key distribution scheme relying on continuously phase and amplitude-modulated coherent light pulses |
JP2004349833A (ja) | 2003-05-20 | 2004-12-09 | Nippon Telegr & Teleph Corp <Ntt> | 量子匿名送信装置、量子匿名受信装置、量子状態配布装置、量子匿名通信方法、及びプログラム |
US20070009098A1 (en) * | 2005-07-08 | 2007-01-11 | Akihiro Tanaka | Communication system and method for controlling the same |
US20070014415A1 (en) * | 2005-06-16 | 2007-01-18 | Harrison Keith A | Quantum key distribution method and apparatus |
US20070230688A1 (en) * | 2005-08-18 | 2007-10-04 | Nec Corporation | Secret communication system and method for generating shared secret information |
US20080292102A1 (en) | 2007-05-25 | 2008-11-27 | Shuoqin Wang | Quantum key distribution system and method |
JP2009296217A (ja) | 2008-06-04 | 2009-12-17 | Hitachi Ltd | 暗号通信装置 |
US20100020964A1 (en) * | 2007-02-20 | 2010-01-28 | Oki Electric Industry Co., Ltd. | Key generation method using quadratic-hyperbolic curve group |
JP2011061833A (ja) | 2010-10-28 | 2011-03-24 | Mitsubishi Electric Corp | 量子暗号通信システムおよび送信装置 |
KR20110070694A (ko) | 2009-12-18 | 2011-06-24 | 한국전자통신연구원 | 다자간 양자 통신에서의 사용자 인증 방법 및 장치 |
US20110206204A1 (en) * | 2008-10-17 | 2011-08-25 | Dmitry Ivanovich Sychev | Methods and devices of quantum encoding on dwdm (roadm) network and fiber optic links . |
US20110311050A1 (en) * | 2009-03-11 | 2011-12-22 | Tatsuya Tomaru | Cryptographic communication system |
US20130101111A1 (en) * | 2011-10-20 | 2013-04-25 | Sandisk Technologies Inc. | Method for scrambling shaped data |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2023525A1 (fr) * | 2006-05-29 | 2009-02-11 | NEC Corporation | Système de désactivation de personne non autorisée, dispositif et procédé de chiffrement et programme |
CN101697512B (zh) * | 2009-11-09 | 2011-08-24 | 中国电子科技集团公司第三十研究所 | 一种抗干扰量子保密直接通信的方法及系统 |
-
2012
- 2012-10-23 KR KR20120118138A patent/KR101479112B1/ko active IP Right Grant
-
2013
- 2013-08-26 CN CN201380055185.XA patent/CN104737495B/zh active Active
- 2013-08-26 WO PCT/KR2013/007611 patent/WO2014065497A1/fr active Application Filing
-
2015
- 2015-04-23 US US14/694,742 patent/US10103881B2/en active Active
Patent Citations (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030223579A1 (en) * | 2000-07-13 | 2003-12-04 | Eran Kanter | Secure and linear public-key cryptosystem based on parity-check error-correcting |
JP2002351499A (ja) | 2001-05-29 | 2002-12-06 | Victor Co Of Japan Ltd | 音声符号化データの編集方法、及び音声符号化信号編集装置 |
US20040109564A1 (en) * | 2002-07-05 | 2004-06-10 | Nicolas Cerf | High-rate quantum key distribution scheme relying on continuously phase and amplitude-modulated coherent light pulses |
JP2004349833A (ja) | 2003-05-20 | 2004-12-09 | Nippon Telegr & Teleph Corp <Ntt> | 量子匿名送信装置、量子匿名受信装置、量子状態配布装置、量子匿名通信方法、及びプログラム |
US20070014415A1 (en) * | 2005-06-16 | 2007-01-18 | Harrison Keith A | Quantum key distribution method and apparatus |
US20070009098A1 (en) * | 2005-07-08 | 2007-01-11 | Akihiro Tanaka | Communication system and method for controlling the same |
US20070230688A1 (en) * | 2005-08-18 | 2007-10-04 | Nec Corporation | Secret communication system and method for generating shared secret information |
US20100020964A1 (en) * | 2007-02-20 | 2010-01-28 | Oki Electric Industry Co., Ltd. | Key generation method using quadratic-hyperbolic curve group |
US20080292102A1 (en) | 2007-05-25 | 2008-11-27 | Shuoqin Wang | Quantum key distribution system and method |
JP2009296217A (ja) | 2008-06-04 | 2009-12-17 | Hitachi Ltd | 暗号通信装置 |
US20110206204A1 (en) * | 2008-10-17 | 2011-08-25 | Dmitry Ivanovich Sychev | Methods and devices of quantum encoding on dwdm (roadm) network and fiber optic links . |
US20110311050A1 (en) * | 2009-03-11 | 2011-12-22 | Tatsuya Tomaru | Cryptographic communication system |
KR20110070694A (ko) | 2009-12-18 | 2011-06-24 | 한국전자통신연구원 | 다자간 양자 통신에서의 사용자 인증 방법 및 장치 |
US20140068765A1 (en) * | 2009-12-18 | 2014-03-06 | Electronics And Telecommunications Research Institute | Method and apparatus for authenticating user in multiparty quantum communications |
JP2011061833A (ja) | 2010-10-28 | 2011-03-24 | Mitsubishi Electric Corp | 量子暗号通信システムおよび送信装置 |
US20130101111A1 (en) * | 2011-10-20 | 2013-04-25 | Sandisk Technologies Inc. | Method for scrambling shaped data |
Non-Patent Citations (2)
Title |
---|
Chinese Office Action dated Feb. 17, 2017 in connection with the counterpart Chinese Patent Application No. 201380055185.X. |
International Search Report for PCT/KR2013/007611 dated Dec. 16, 2013. |
Also Published As
Publication number | Publication date |
---|---|
KR101479112B1 (ko) | 2015-01-07 |
KR20140051736A (ko) | 2014-05-02 |
CN104737495B (zh) | 2018-03-27 |
WO2014065497A1 (fr) | 2014-05-01 |
US20150312035A1 (en) | 2015-10-29 |
CN104737495A (zh) | 2015-06-24 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US10103881B2 (en) | Permutation method for correcting bit error in quantum key distribution protocol | |
JP4290401B2 (ja) | 量子鍵配送方法および通信装置 | |
US8693691B2 (en) | Embedded authentication protocol for quantum key distribution systems | |
JP5871142B2 (ja) | 暗号鍵共有システムにおける通信装置および暗号鍵生成方法 | |
US7587654B2 (en) | Quantum key distribution method and communication apparatus | |
CN110545160A (zh) | 启用签名的极化编码器和解码器 | |
US10872172B2 (en) | Apparatus and method for processing digital value | |
EP1603268A1 (fr) | Procede de remise de cle quantique et dispositif de transmission | |
JPWO2005076519A1 (ja) | 量子鍵配送方法および通信装置 | |
JP2008154019A (ja) | 共有情報の管理方法およびシステム | |
US11349668B2 (en) | Encryption device and decryption device | |
US20180054301A1 (en) | Method and device for data encryption | |
Mihaljević et al. | An approach for stream ciphers design based on joint computing over random and secret data | |
JP2007019789A (ja) | 乱数共有システムおよび方法 | |
JP4459526B2 (ja) | 量子鍵配送方法および通信装置 | |
US11177936B2 (en) | Message authenticator generation apparatus | |
KR101978684B1 (ko) | 재생 공격 방지가 가능한 부호 기반 암호화 장치 및 방법 | |
CN112653547B (zh) | 用于处理输入数据的设备和方法、车辆和存储介质 | |
Nikiforov et al. | Side-channel analysis of privacy amplification in postprocessing software for a quantum key distribution system | |
US20190065776A1 (en) | Method and apparatus for securing data | |
KR100822507B1 (ko) | 양자 키 배송 방법 및 통신 장치 | |
Levina et al. | Wavelet Codes and Their Implementation for Protection of NAND Flash Memory | |
KR101575123B1 (ko) | 워드 마스크를 이용한 고속 병렬 비트오류 보정방법 | |
Timofeev et al. | On the privacy-preserving cascade method for correcting errors in primary keys in quantum cryptography | |
Alawadhi et al. | A Crypto-System with Embedded Error Control for Secure and Reliable Communication |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: SK TELECOM CO., LTD., KOREA, REPUBLIC OF Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:CHOI, JEONG-WOON;REEL/FRAME:035484/0065 Effective date: 20141219 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
AS | Assignment |
Owner name: ID QUANTIQUE, SWITZERLAND Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:SK TELECOM CO., LTD.;REEL/FRAME:047859/0961 Effective date: 20181220 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 4 |