# US 2015/0312035 A1 · Permutation method for correcting bit error in quantum key distribution protocol

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0312035 A1
- Document ID: US20150312035A1
- Status: Published application
- Kind: A1
- Application number: 14/694,742
- Filed: 2015-04-23
- Published: 2015-10-29
- Earliest claimed: 2012-10-23
- Assignees: SK Telecom Co., Ltd.
- Applicants: SK Telecom Co., Ltd.
- Inventors: Jeong-woon CHOI
- Web page: https://patentgrep.com/patent/US20150312035A1

## CPC

- H04L 9/0858: {Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding}
- H04L 2209/34: Encoding or coding, e.g. Huffman coding or error correction
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A permutation method for reconciling bit errors in a quantum key reconciliation protocol performing an iterative reconciliation process, includes: obtaining a bit string through a previous reconciliation step; and permuting bits in athe bit string obtained from athe 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.

## Claims

### Claim 1

A permutation method for reconciling bit errors in a quantum key reconciliation protocol performing an iterative reconciliation process, the permutation method 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.

### Claim 2 (depends on 1)

The permutation method of claim 1, wherein the linear modulo operation is given by F:x→ax+b(mod n), where ‘x’ denotes the location of a bit, ‘a’ denotes the length of the block for the subsequent reconciliation step, ‘b’ denotes an arbitrary integer, and ‘n’ denotes the length of the bit string.

### Claim 3 (depends on 1)

The permutation method of claim 1, further comprising:
changing at least one of the length (n) of the bit string and the length (a) of the block for the subsequent reconciliation step to satisfy gcd(n,a)=1.

### Claim 4 (depends on 3)

The permutation method of claim 3, wherein the changing of at least one of ‘n’ and ‘a’ comprises changing ‘n’ into an odd number if ‘a’ is a power of 2.

### Claim 5 (depends on 1)

The permutation method of claim 1, wherein the quantum key reconciliation protocol is a scheme for dividing a bit string resulting from each reconciliation step into blocks, and performing a predetermined operation on each block.

### Claim 6

A method for reconciling bit errors in a sifted key generated through a quantum key distribution (QKD) protocol, the method comprising:
repeatedly performing a reconciliation step comprising 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
performing a predetermined operation according to a reconciliation protocol on the block containing the odd number of the bit errors,
wherein 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.

### Claim 7

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.

### Claim 8 (depends on 7)

The non-transitory computer-readable medium of claim 7, wherein the linear modulo operation is given by F:x→ax+b(mod n), where ‘x’ denotes the location of a bit, ‘a’ denotes the length of the block for the subsequent reconciliation step, ‘b’ denotes an arbitrary integer, and ‘n’ denotes the length of the bit string.

### Claim 9 (depends on 7)

The non-transitory computer-readable medium of claim 7, further comprising:
changing at least one of the length (n) of the bit string and the length (a) of the block for the subsequent reconciliation step to satisfy gcd(n,a)=1.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the changing of at least one of ‘n’ and ‘a’ comprises changing ‘n’ into an odd number if ‘a’ is a power of 2.

### Claim 11 (depends on 7)

The non-transitory computer-readable medium of claim 7, wherein the quantum key reconciliation protocol is a scheme for dividing a bit string resulting from each reconciliation step into blocks, and performing a predetermined operation on each block.
