Communication key updating method and related equipment

By acquiring bit sequences in quantum encryption devices, extracting and updating keys, the problem of insufficient number of keys in quantum encryption devices is solved, and multiple utilization and complexity of keys are achieved.

CN118659883BActive Publication Date: 2024-11-29CHINA TELECOM CORP LTD +1
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411124269.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-15
Publication Date
2024-11-29
Estimated Expiration
2044-08-15

AI Technical Summary

Technical Problem

The number of unused keys in quantum encryption devices is gradually decreasing, resulting in the inability of the device to continue quantum encryption.

Method used

The quantum key distribution device obtains the bit sequence, extracts the first key, and generates the first data sequence according to the first key. Finally, finds the corresponding bit value in the bit sequence according to the data order in the first data sequence to form the first data sequence. Two key.

Benefits of technology

It is implemented to obtain multiple keys from a bit sequence, increase the number of keys, and form a second key through discontinuous values, thereby increasing the complexity of the key.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118659883B_ABST
    Figure CN118659883B_ABST
Patent Text Reader

Abstract

The present disclosure provides a communication key update method and related equipment, which relate to the field of communication technology. The method includes: obtaining a bit sequence through a quantum key distribution device; extracting a first key from the bit sequence; generating a first data sequence according to the first key, the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key; according to the order of the data in the first data sequence, sequentially searching for the value of the corresponding position of each data in the bit sequence, and forming a second key based on the found value. According to an embodiment of the present disclosure, multiple keys are obtained from the bit sequence, which can increase the number of keys; in addition, when extracting the second key, the first data sequence is not an arithmetic sequence with a common difference of 1, so the value in the second key is not a continuous value in the above bit sequence, thereby increasing the complexity of the second key.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a communication key updating method and related equipment. Background Art

[0002] Quantum encryption devices use the superposition of quantum states and the principle of non-cloning to generate quantum keys through quantum key distribution technology, encrypt data once and for all, and greatly enhance the security of data transmission. However, this encryption method consumes a key each time it encrypts, resulting in a gradual decrease in the number of unused keys in the quantum encryption device. Once the unused keys in the device are exhausted, quantum encryption will no longer be possible. Therefore, ensuring an adequate supply of quantum keys in quantum encryption devices is the key to maintaining their stable operation.

[0003] It should be noted that the information disclosed in the above background technology section is only used to enhance the understanding of the background of the present disclosure, and therefore may include information that does not constitute the prior art known to ordinary technicians in the field. Summary of the invention

[0004] The present disclosure provides a communication key updating method and related devices, which at least to some extent solve the problem of insufficient number of keys in quantum encryption devices.

[0005] Other features and advantages of the present disclosure will become apparent from the following detailed description, or may be learned in part by the practice of the present disclosure.

[0006] According to one aspect of the present disclosure, a communication key updating method is provided, including: obtaining a bit sequence through a quantum key distribution device; extracting a first key from the bit sequence; generating a first data sequence according to the first key, the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key; according to the order of the data in the first data sequence, searching for the value of the corresponding position of each data in the bit sequence in turn, and constructing a second key based on the found value.

[0007] In one embodiment of the present disclosure, the first data sequence is an arithmetic sequence, and the common difference of the first data sequence is not 1; or, the first data sequence is a non-arithmetic sequence, and there is no repeated data in the first data sequence.

[0008] In one embodiment of the present disclosure, the method further includes: after generating a new key, recording the number of keys currently generated based on the bit sequence;

[0009] Generate a first data sequence according to a first key, including: obtaining first data in the first data sequence based on the number of keys generated by the bit sequence, the first data being greater than 0; and calculating data at a next position in the first data sequence according to data at a previous position in the first data sequence and the first key, until the first data sequence is obtained, wherein there is no repeated data in the first data sequence.

[0010] In one embodiment of the present disclosure, the method further includes: after generating a new key, recording the number of keys currently generated based on the bit sequence;

[0011] Generate a first data sequence according to a first key, including: obtaining a first data in the first data sequence based on the number of keys generated by the bit sequence, wherein the first data is greater than 0; determine a tolerance of the first data sequence according to the first key; and generate the first data sequence according to the first data in the first data sequence and the tolerance.

[0012] In one embodiment of the present disclosure, the first data sequence is an increasing sequence.

[0013] In one embodiment of the present disclosure, the value of the corresponding position of each data is searched in turn in the bit sequence, including: when the data in the first data sequence is greater than the number of bits of the bit sequence, the total number of bits of the bit sequence is subtracted from the data until the target data less than or equal to the number of bits of the bit sequence is obtained, and the value of the target data position is searched in the first data sequence based on the target data.

[0014] In one embodiment of the present disclosure, data at a next position in the first data sequence is calculated based on data at a previous position in the first data sequence and a first key, including: data at a next position in the first data sequence is calculated based on data at a previous position in the first data sequence, a first key and a preset natural number.

[0015] According to another aspect of the present disclosure, a communication key updating device is provided, comprising: a bit sequence acquisition module, a key extraction module, a data sequence generation module and a key updating module.

[0016] A bit sequence acquisition module, used to acquire a bit sequence through a quantum key distribution device;

[0017] A key extraction module, used for extracting a first key from a bit sequence;

[0018] A data sequence generating module, used for generating a first data sequence according to a first key, wherein the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key;

[0019] The key updating module is used to search for the value of the corresponding position of each data in the bit sequence in turn according to the order of the data in the first data sequence, and form a second key based on the searched value.

[0020] According to another aspect of the present disclosure, an electronic device is provided, including: a memory for storing instructions; and a processor for calling the instructions stored in the memory to implement the above-mentioned communication key update method.

[0021] According to another aspect of the present disclosure, a computer-readable storage medium is provided, on which computer instructions are stored, and when the computer instructions are executed by a processor, the above-mentioned communication key updating method is implemented.

[0022] According to another aspect of the present disclosure, a computer program product is provided. The computer program product stores instructions, and when the instructions are executed by a computer, the computer implements the above-mentioned communication key update method.

[0023] According to yet another aspect of the present disclosure, there is provided a chip, comprising at least one processor and an interface;

[0024] An interface for providing program instructions or data to at least one processor;

[0025] At least one processor is used to execute program instructions to implement the above communication key updating method.

[0026] The communication key updating method and related devices provided by the embodiments of the present disclosure obtain a bit sequence through a quantum key distribution device, and extract a first key from the bit sequence, and the second key updated subsequently is also obtained from the bit sequence, so that the bit sequence can be obtained once to obtain multiple keys, thereby increasing the number of keys. In addition, when extracting the second key, the first data sequence is not an arithmetic sequence with a common difference of 1, so the value in the second key is not a continuous value in the bit sequence, thereby increasing the complexity of the second key.

[0027] It is to be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present disclosure. BRIEF DESCRIPTION OF THE DRAWINGS

[0028] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and, together with the description, serve to explain the principles of the present disclosure.

[0029] Obviously, the drawings described below are only some embodiments of the present disclosure, and a person skilled in the art can obtain other drawings based on these drawings without any creative work.

[0030] Figure 1 A flow chart of a communication method in an embodiment of the present disclosure is shown;

[0031] Figure 2 A flow chart of a communication key updating method in an embodiment of the present disclosure is shown;

[0032] Figure 3 A portion of a bit sequence in an embodiment of the present disclosure is shown;

[0033] Figure 4 A flowchart of generating a first data sequence in an embodiment of the present disclosure is shown;

[0034] Figure 5 Another flowchart for generating a first data sequence in an embodiment of the present disclosure is shown;

[0035] Figure 6 Another communication method flow chart in the embodiment of the present disclosure is shown;

[0036] Figure 7 A schematic diagram of a communication key updating device in an embodiment of the present disclosure is shown;

[0037] Figure 8 A structural block diagram of an electronic device in an embodiment of the present disclosure is shown. DETAILED DESCRIPTION

[0038] In order to make the purpose, technical solutions and advantages of the embodiments of the present disclosure clearer, the technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, rather than all the embodiments.

[0039] The components of the embodiments of the present disclosure generally described and shown in the drawings herein may be arranged and designed in a variety of different configurations. Therefore, the following detailed description of the embodiments of the present disclosure provided in the drawings is not intended to limit the scope of the present disclosure claimed, but merely represents selected embodiments of the present disclosure.

[0040] Quantum encryption devices can use quantum keys of quantum key distribution (QKD) to encrypt data once and for all based on the superposition of quantum states and the principle of quantum non-cloning, thereby improving the security of the data transmission process. However, each time a quantum encryption device encrypts data, it consumes a key, which makes the number of unused keys stored in the quantum encryption device decrease. When the unused keys stored in the quantum encryption device are exhausted, the quantum encryption device will not be able to perform quantum encryption on the data. Therefore, how to prevent the quantum encryption device from having insufficient quantum keys is the key to ensuring the stable operation of the quantum encryption device.

[0041] In some embodiments, the process of quantum key distribution is roughly as follows: a single photon is usually used as a quantum bit of polarization or phase freedom, and the random number 0 or 1 to be transmitted can be encoded into this quantum superposition state. For example, it is agreed in advance that the circular polarization of the photon represents 1 and the linear polarization represents 0.

[0042] The light source emits a photon, and Party A randomly prepares each photon into a circular polarization state or a linear polarization state, and then sends it to the legitimate user Party B. Party B receives the photon and, in order to confirm its polarization state (i.e. 0 or 1), randomly uses a circular polarization analyzer or a linear polarization analyzer to measure it.

[0043] If the type of polarizer happens to be consistent with the polarization state of the photon being measured, the measured random number must be the same as the random number encoded by Party A. Otherwise, the random number measured by Party B will be different from the one emitted by Party A.

[0044] Party B measures the photons emitted by Party A one by one and records the measurement results. Party B then tells Party A the type of polarizer he uses through an open channel. At this time, Party A can know which photons were detected correctly and which were not detected correctly during Party B's detection, which may be wrong, so he tells Party B to only keep the correct detection results, where the correct detection results left correspond to a string of bit sequences, so that both parties have a completely consistent bit sequence (0, 1 random number sequence), and both parties can extract the first key from the above bit sequence.

[0045] Figure 1 A flow chart of a communication method in an embodiment of the present disclosure is shown as follows: Figure 1 As shown, the communication method provided in the embodiment of the present disclosure includes steps S101-S105.

[0046] In S101, the communication device 1 obtains a bit sequence (QK) through a quantum key distribution device (QKD device);

[0047] In S102, communication device 2 obtains the same bit sequence (QK) as quantum device 1 through a quantum key distribution device (QKD device);

[0048] In S103, communication device 1 and communication device 2 respectively extract a first key from the bit sequence.

[0049] In S104 , the communication device 1 encrypts the first communication message using the first key, and sends the encrypted message to the communication device 2 .

[0050] In S105 , the communication device 2 uses the first key to decrypt the encrypted first communication message.

[0051] In some embodiments, when the communication device 1 and the communication device 2 communicate next time, the key can be re-acquired based on the above S101-S103 to obtain the second key, and then the next communication can be performed based on steps similar to the above S104-S105. Since the above process of acquiring the bit sequence and extracting the first key from the bit sequence is relatively complicated, the frequent use of the above scheme to obtain a new key requires a large amount of calculation.

[0052] In some embodiments, if communication device 1 and communication device 2 use a used quantum key as a seed to derive a new key, it may introduce a risk of key reuse and reduce security.

[0053] Figure 2 A flow chart of a communication key updating method in an embodiment of the present disclosure is shown as follows: Figure 2 As shown, the communication key updating method provided in the embodiment of the present disclosure includes steps S201-S204. The communication key updating method can be executed by a communication device, and the communication device can be a sending end device or a receiving end device.

[0054] In S201, a bit sequence is obtained through a quantum key distribution device.

[0055] In S202, a first key is extracted from the bit sequence.

[0056] In S203, a first data sequence is generated according to the first key, the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key.

[0057] In S204, according to the order of the data in the first data sequence, the value of the corresponding position of each data is searched in the bit sequence in turn, and the second key is constructed based on the searched value.

[0058] In the above S201, the bit sequences obtained by the transmitting device and the receiving device are the same. The above processes of S201-S202 are similar to the previous embodiment and will not be repeated here.

[0059] In the above S203, the first data sequence may be generated according to the value of each bit in the first key. It should be noted that the generation process of the above first data sequence is not limited, the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key. It is understandable that the data in the above first data sequence is greater than 0.

[0060] In the above S204, the second key may be composed of the found value. As an example, the first key may have 16 bits, and the second key also has 16 bits.

[0061] The disclosed embodiment obtains a bit sequence through a quantum key distribution device, and extracts a first key from the bit sequence, and the second key subsequently updated is also obtained from the bit sequence, thereby realizing moderate reuse of the bit sequence. On the basis of ensuring security, the method can greatly increase the number of symmetric communication keys on the basis of the same bit sequence obtained by both communicating parties, thus solving the problem of insufficient key quantity.

[0062] In addition, when extracting the second key, the first data sequence is not an arithmetic sequence with a common difference of 1, so the values ​​in the second key are not continuous values ​​in the above bit sequence, which increases the complexity of the second key.

[0063] In some embodiments, a third key and a fourth key etc. can also be obtained based on steps similar to the above S203-S204. That is, the above-mentioned bit sequence can be obtained once to obtain multiple keys, thereby increasing the number of keys.

[0064] As an example, the above-mentioned communication key updating method may also include generating a second data sequence based on the second key, the second data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the second data sequence is the same as the number of bits of the first key; according to the order of the data in the second data sequence, searching the bit sequence for the value of the corresponding position of each data in the second data sequence in turn, and constructing a third key based on the found value.

[0065] As a transitional solution to the current insufficient code rate of quantum key distribution, the disclosed embodiment realizes the appropriate reuse of quantum keys, so that the application scenarios of quantum key distribution can be expanded, and has industry promotion value. In addition, the disclosed embodiment is relatively simple to modify the communication process and the communication party system, which is conducive to implementation.

[0066] Figure 3 shows a part of a bit sequence, and the first key can be composed of the values ​​of the first to the 16th bits of the bit sequence, Figure 3 The numbers are underlined, that is, 1010 1110 1001 0100.

[0067] In some embodiments, according to the first key, the first data sequence determined may be [2, 4, 5, 7, 8, 10, 12, 14, 15, 17, 18, 19, 21, 23, 24, 25]. Then, in S204, according to the order of the data in the first data sequence, the first data sequence is first Figure 3 Search the value of position 2 in the bit sequence and get 0; then search the value of position 4 and get 0; then search the value of position 5 and get 1; then search the value of position 7 and get 1, and similarly, search for the values ​​corresponding to the remaining data (already in Figure 3, where the underline corresponding to the second key is below the underline of the first key), and the second key is 00110011 0111 1100.

[0068] It can be understood that if the first data sequence is an arithmetic sequence with a tolerance of 1, for example [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17], then the second key is 0101 1101 0010 1001. The second key has a high degree of repetition with the first key and is easy to crack. However, in the embodiment of the present disclosure, the first data sequence is not an arithmetic sequence with a tolerance of 1. Therefore, the second key in the above text and the third key and fourth key obtained based on the above scheme are not continuous values ​​in the above bit sequence, which can increase the complexity of the second key and make it difficult to crack.

[0069] In some embodiments, the first data sequence may be an arithmetic sequence, and the common difference of the first data sequence is not 1. The first data sequence may also not be an arithmetic sequence, and when the first data sequence is not an arithmetic sequence, there is no repeated data in the first data sequence. The above scheme can further ensure that the second key is not completely continuous values ​​in the above bit sequence, thereby increasing the complexity of the second key.

[0070] In some embodiments, the communication key update method may further include: after generating a new key, recording the number of keys currently generated based on the bit sequence. After generating the first key, the number of keys generated by the bit sequence is 1, and after generating the second key, the number of keys generated by the bit sequence is 2. Figure 4 As shown, in the above embodiment, S203 generates a first data sequence according to a first key, which may include S401-S402.

[0071] In S401, based on the number of keys generated by the bit sequence, the first data in the first data sequence is obtained, wherein the first data is greater than 0;

[0072] In S402, data at a next position in the first data sequence is calculated based on data at a previous position in the first data sequence and the first key, until the first data sequence is obtained, wherein there is no repeated data in the first data sequence.

[0073] In some embodiments, the data at the next position in the first data sequence is calculated based on the data at the previous position in the first data sequence and the first key, which may be the data at the next position in the first data sequence calculated based on the data at the previous position in the first data sequence, the first key and a preset natural number.

[0074] In some embodiments, the first data sequence may be an increasing sequence.

[0075] In some embodiments, searching for the value of the corresponding position of each data in the bit sequence in turn in S402 may include, when the data in the first data sequence is greater than the number of bits of the bit sequence, subtracting the total number of bits of the bit sequence from the data until target data less than or equal to the number of bits of the bit sequence is obtained, and searching for the value of the target data position in the first data sequence based on the target data.

[0076] It is understandable that the above S401 is only an embodiment of the present disclosure. The first data in the first data sequence in the present disclosure is not necessarily determined based on the number of keys generated by the bit sequence. The first data in the first data sequence in the present disclosure only needs to be greater than 0, and the first data in the first data sequence can also be less than or equal to the number of bits in the bit sequence. It should be noted that when generating different keys, the first data in the first data sequence is not exactly the same.

[0077] In one embodiment, assuming that the bit length of each key is n, the key sequence is N, KN represents the updated Nth key, and the key address is K represents the total number of quantum key bits (i.e. the number of bits in the bit sequence) is S. At the same time, assuming the key length is 16, the bit sequence can be as follows Figure 3 shown.

[0078] As an example, when N>1, , n>1;

[0079]

[0080] K1 obtains the n-bit key in address order according to the key length n agreed by both parties, that is, ;

[0081] The K2 address is obtained based on the K1 value. , when n>1, the address of each bit of K2 is as follows:

[0082] If K1=1010 1110 1001 0100;

[0083] but ; ; ; ......

[0084] so ;

[0085] from Get the K2 key from K2, that is, K2=0011 0011 0111 1100;

[0086] When the key address hour, , thereby realizing cyclic key update.

[0087] The disclosed embodiment calculates the address of each bit of the next quantum key based on the value of each bit of the current key, thereby avoiding the problem of large-scale continuous bit duplication of the quantum key and ensuring the randomness of the key. In addition, in the disclosed embodiment, if the quantum key bit address is greater than the total number of quantum key bits obtained / stored, the update operation is cyclically performed starting from the first bit of the total quantum key, so that the quantum key can be continuously updated without affecting user use due to insufficient quantum key surplus.

[0088] As an example, when N>1, , n≥1;

[0089]

[0090] K1 obtains the n-bit key in address order according to the key length n agreed by both parties, that is, ;

[0091] The K2 address is obtained based on the K1 value. , when n≥1, the address of each bit of K2 is as follows:

[0092]

[0093] If K1=1010 1110 1001 0100 ;

[0094] but ; ; ; ; …

[0095] so ;

[0096] from The K2 key is obtained from K2, that is, K2=0111 0110 1101 1011;

[0097] When the key address hour, , thereby realizing cyclic key update.

[0098] In the disclosed embodiment, the communicating parties calculate the address of the next key based on the current key content and generate the next quantum key. There is no problem of security reduction caused by the repeated use of consecutive quantum keys, which improves the utilization rate of quantum keys. At the same time, the key can be updated cyclically, which solves the problem of communication being affected by insufficient remaining keys. In addition, the disclosed embodiment updates the address of the next key (K2) according to the current key content (K1), obtains the value of the K2 key from the K2 key address, and then updates the K3 key according to the strategy, and circulates in sequence.

[0099] In some embodiments, the communication key update method may further include recording the number of keys currently generated based on the bit sequence after generating a new key. After generating the first key, the number of keys generated by the bit sequence is 1, and after generating the second key, the number of keys generated by the bit sequence is 2. Figure 5 As shown, in the above embodiment, S203 generates a first data sequence according to a first key, which may include S501-S503.

[0100] In S501, based on the number of keys generated by the bit sequence, the first data in the first data sequence is obtained, and the first data is greater than 0;

[0101] In S502, a tolerance of a first data sequence is determined according to a first key;

[0102] In S503, a first data sequence is generated according to the first data in the first data sequence and the tolerance.

[0103] In some embodiments, the tolerance of the data sequence is different when generating different keys.

[0104] In some embodiments, the tolerance of the first data sequence may be the sum of the values ​​of the preset bits in the first key. As an example, the tolerance may be the sum of the first four bits. In this way, the tolerance is different each time the key is generated, thereby increasing the complexity of the key.

[0105] In some embodiments, the first data sequence is an increasing sequence.

[0106] In some embodiments, the value of the corresponding position of each data is searched in turn in the bit sequence. When the data in the first data sequence is greater than the number of bits of the bit sequence, the total number of bits of the bit sequence is subtracted from the data until the target data less than or equal to the number of bits of the bit sequence is obtained, and the value of the target data position is searched in the first data sequence based on the target data.

[0107] The disclosed embodiments can achieve moderate reuse of quantum keys while ensuring that there will be no duplication of multiple consecutive quantum keys. They can also improve the key update frequency and ensure security when the quantum key quantity is the same. The communication device does not need to have QKD capabilities. After obtaining the quantum key through the QKD device, the quantum key can be updated based on the key update method of the disclosed embodiment, which makes the communication process and communication device modification relatively simple.

[0108] Figure 6 A flow chart of a communication method in an embodiment of the present disclosure is shown as follows: Figure 6 As shown, communication device 1 and communication device 2 call the QKD device to obtain the quantum key QK of the same length (the bit sequence QK in the previous text), which is usually an integer multiple of 1024 bytes.

[0109] Before the communication device 1 and the communication device 2 call the QKD device, the communication device 1 and the communication device 2 can register on the QKD device respectively. Figure 1 As shown, the QKD device called by communication device 1 and communication device 2 can be the same device. Figure 6 As shown, the QKD device called by communication device 1 and communication device 2 may not be the same device. Figure 2 The executor of the embodiment may be communication device 1. The QKD device called by communication device 1 and communication device 2 is not the same device. Communication device 1 may send a quantum key application to QKD device 1. The quantum key application carries the identification of QKD device 2. Then, when the quantum key is distributed, QKD device 1 may notify QKD device 2 to issue a quantum key QK of the same length to communication device 2 (the bit sequence QK in the previous text).

[0110] Then, communication device 1 and communication device 2 agree on the cryptographic algorithm to be used, and obtain the same current key K1 (the first key in the previous text) from QK to encrypt the communication information. In subsequent messages, communication devices 1 and 2 update the quantum key to encrypt the communication information. The communication key update method is as described in the previous embodiment. In subsequent messages, the same method is used to update the key to encrypt the communication message. If If the address is greater than the total address, the loop starts from the beginning, that is, .

[0111] In some embodiments, the above-mentioned communication key update method can be used for encrypted communication between data centers and high-security dedicated line nodes. The communication equipment is directly connected to the QKD device, which has higher security than using the same key for a long time.

[0112] In some embodiments, the above-mentioned communication key update method can be used for a cross-domain key management system that provides key services for business applications based on quantum key distribution, and the quantum keys provided to the outside are synchronized between two key management systems.

[0113] In some embodiments, the above-mentioned communication key update method is applicable to the use scenario of obtaining a large number of quantum keys by filling or online, which can greatly increase the number of quantum keys and ensure security.

[0114] In the embodiments of the present disclosure, the terms “first”, “second” and “third” are used for descriptive purposes only and should not be understood as indicating or implying relative importance.

[0115] The term "and / or" in this disclosure is only a description of the association relationship of associated objects, indicating that there may be three relationships. For example, A and / or B can represent: A exists alone, A and B exist at the same time, and B exists alone. In addition, the character " / " in this article generally indicates that the associated objects before and after are in an "or" relationship.

[0116] Furthermore, although the steps of the method in the present disclosure are described in a particular order in the drawings, this does not require or imply that the steps must be performed in this particular order or that all the steps shown must be performed to achieve the desired results.

[0117] In some embodiments, certain steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0118] Based on the same inventive concept, the present disclosure also provides a communication key update device, as described in the following embodiments. Since the principle of solving the problem in the device embodiment is similar to that in the above method embodiment, the implementation of the device embodiment can refer to the implementation of the above method embodiment, and the repeated parts will not be repeated.

[0119] Figure 7 A schematic diagram of a communication key updating device in an embodiment of the present disclosure is shown. Figure 7 As shown, the communication key updating device includes a bit sequence acquisition module 701, a key extraction module 702, a data sequence generation module 703 and a key updating module 704.

[0120] A bit sequence acquisition module 701 is used to acquire a bit sequence through a quantum key distribution device;

[0121] The key extraction module 702 is used to extract a first key from a bit sequence;

[0122] A data sequence generating module 703 is used to generate a first data sequence according to the first key, where the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key;

[0123] The key updating module 704 is used to search for the value of the corresponding position of each data in the bit sequence in turn according to the order of the data in the first data sequence, and form a second key based on the searched value.

[0124] In some embodiments, the first data sequence is an arithmetic sequence, and the common difference of the first data sequence is not 1; or, the first data sequence is not an arithmetic sequence, and there is no repeated data in the first data sequence.

[0125] In some embodiments, the communication key updating device may further include a key quantity recording module.

[0126] The key quantity recording module is used to record the number of keys currently generated based on the bit sequence after generating a new key.

[0127] The above-mentioned data sequence generation module 703 is used to obtain the first data in the first data sequence based on the number of keys generated by the bit sequence, and the first data is greater than 0; according to the data at the previous position in the first data sequence and the first key, the data at the next position in the first data sequence is calculated until the first data sequence is obtained, wherein there is no repeated data in the first data sequence.

[0128] In some embodiments, the communication key updating device may further include a key quantity recording module.

[0129] The key quantity recording module is used to record the number of keys currently generated based on the bit sequence after generating a new key.

[0130] The above-mentioned data sequence generation module 703 is used to obtain the first data in the first data sequence based on the number of keys generated by the bit sequence, and the first data is greater than 0; determine the tolerance of the first data sequence according to the first key; and generate the first data sequence according to the first data in the first data sequence and the tolerance.

[0131] In some embodiments, the first data sequence is an increasing sequence.

[0132] In some embodiments, the value of the corresponding position of each data is searched in the bit sequence in turn, including: when the data in the first data sequence is greater than the number of bits of the bit sequence, the total number of bits of the bit sequence is subtracted from the data until the target data less than or equal to the number of bits of the bit sequence is obtained, and the value of the target data position is searched in the first data sequence based on the target data.

[0133] In some embodiments, the data at the next position in the first data sequence is calculated based on the data at the previous position in the first data sequence and the first key, including: the data at the next position in the first data sequence is calculated based on the data at the previous position in the first data sequence, the first key and a preset natural number.

[0134] The concepts of “first”, “second”, etc. mentioned in the present disclosure are only used to distinguish different devices, modules or units, and are not used to limit the order or interdependence of the functions performed by these devices, modules or units.

[0135] Regarding the communication key updating device in the above embodiment, the specific manner in which each module performs operations has been described in detail in the embodiment of the communication key updating method, and will not be elaborated here.

[0136] It should be noted that, although several modules or units of the device for action execution are mentioned in the above detailed description, such division is not mandatory.

[0137] In fact, according to the embodiments of the present disclosure, the features and functions of two or more modules or units described above can be embodied in one module or unit. Conversely, the features and functions of one module or unit described above can be further divided into multiple modules or units to be embodied.

[0138] Some of the blocks shown in the accompanying drawings are functional entities that do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0139] Refer to the following Figure 8 To describe the electronic device provided by the embodiment of the present disclosure. Figure 8 The electronic device 800 shown is merely an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0140] Figure 8 FIG. 8 is a schematic diagram showing the architecture of an electronic device 800 provided by an embodiment of the present disclosure. Figure 8 As shown, the electronic device 800 includes but is not limited to: at least one processor 810 and at least one memory 820.

[0141] The memory 820 is used to store instructions.

[0142] In some embodiments, the memory 820 may include a readable medium in the form of a volatile memory unit, such as a random access memory unit (RAM) 8201 and / or a cache memory unit 8202 , and may further include a read-only memory unit (ROM) 8203 .

[0143] In some embodiments, the memory 820 may also include a program / utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0144] In some embodiments, the memory 820 may store an operating system, which may be a real-time operating system (RTX), LINUX, UNIX, WINDOWS, or OS X.

[0145] In some embodiments, data may also be stored in the memory 820 .

[0146] As an example, the processor 810 may read data stored in the memory 820 , where the data may be stored at the same storage address as the instruction, or the data may be stored at a different storage address than the instruction.

[0147] The processor 810 is configured to call the instructions stored in the memory 820 to implement the steps of various exemplary embodiments of the present disclosure described in the above “Exemplary Method” section of this specification. For example, the processor 810 may execute the steps of the above communication key update method embodiment.

[0148] It should be noted that the processor 810 may be a general-purpose processor or a special-purpose processor. The processor 810 may include one or more processing cores, and the processor 810 executes various functional applications and data processing by running instructions.

[0149] In some embodiments, the processor 810 may include a central processing unit (CPU) and / or a baseband processor.

[0150] In some embodiments, the processor 810 may determine an instruction according to the priority identifier and / or function category information carried in each control instruction.

[0151] In the present disclosure, the processor 810 and the memory 820 may be provided separately or integrated together.

[0152] As an example, the processor 810 and the memory 820 may be integrated on a single board or a system on chip (SOC).

[0153] like Figure 8 As shown, the electronic device 800 is in the form of a general-purpose computing device. The electronic device 800 may further include a bus 830 .

[0154] Bus 830 may be a bus representing one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, or a local bus using any of a variety of bus architectures.

[0155] The electronic device 800 may also communicate with one or more external devices 840 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), one or more devices that enable a user to interact with the electronic device 800, and / or any device that enables the electronic device 800 to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed through an input / output (I / O) interface 850.

[0156] Furthermore, the electronic device 800 can also communicate with one or more networks (eg, a local area network (LAN), a wide area network (WAN) and / or a public network, such as the Internet) through the network adapter 860 .

[0157] like Figure 8 As shown, the network adapter 860 communicates with other modules of the electronic device 800 via the bus 830 .

[0158] It should be understood that although not shown in the figure, other hardware and / or software modules can be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0159] It is understood that the structure shown in the embodiment of the present disclosure does not constitute a specific limitation on the electronic device 800. In other embodiments of the present disclosure, the electronic device 800 may include: Figure 8 More or fewer components may be shown, or some components may be combined or separated, or the components may be arranged differently. Figure 8 The components shown may be implemented in hardware, software or a combination of software and hardware.

[0160] The present disclosure also provides a computer-readable storage medium on which computer instructions are stored. When the computer instructions are executed by a processor, the communication key updating method described in the above method embodiment is implemented.

[0161] The computer-readable storage medium in the embodiments of the present disclosure is a computer instruction that can be sent, propagated or transmitted for use by or in conjunction with an instruction execution system, apparatus or device.

[0162] As one example, computer readable storage media are non-volatile storage media.

[0163] In some embodiments, more specific examples of computer-readable storage media in the present disclosure may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, a USB flash drive, a mobile hard disk, or any suitable combination of the above.

[0164] In the embodiments of the present disclosure, the computer-readable storage medium may include a data signal propagated in a baseband or as a part of a carrier wave, in which computer instructions (readable program codes) are carried.

[0165] Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.

[0166] In some examples, computing instructions contained on a computer-readable storage medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0167] The embodiment of the present disclosure also provides a computer program product, which stores instructions. When the instructions are executed by a computer, the computer implements the communication key updating method described in the above method embodiment.

[0168] The above instructions may be program codes. In specific implementation, the program codes may be written in any combination of one or more programming languages.

[0169] The programming language includes object-oriented programming languages, such as Java, C++, etc., and also includes conventional procedural programming languages, such as "C" language or similar programming languages.

[0170] The program code may execute entirely on the user's computing device, partly on the user's computing device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device or entirely on the remote computing device or server.

[0171] Where a remote computing device is involved, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0172] The embodiment of the present disclosure also provides a chip, including at least one processor and an interface;

[0173] An interface for providing program instructions or data to at least one processor;

[0174] At least one processor is used to execute program instructions to implement the communication key updating method described in the above method embodiment.

[0175] In some embodiments, the chip may further include a memory, which is used to store program instructions and data, and the memory is located inside or outside the processor.

[0176] Those skilled in the art will appreciate that all or part of the steps to implement the above embodiments may be implemented in the following forms, namely: a complete hardware implementation, a complete software implementation (including firmware, microcode, etc.), or a combination of hardware and software implementations, which may be collectively referred to herein as "circuits", "modules" or "systems".

[0177] Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein.

[0178] The present disclosure is intended to cover any variation, use or adaptation of the present disclosure, which follows the general principles of the present disclosure and includes common knowledge or customary technical means in the technical field not disclosed in the present disclosure. The description and examples are to be regarded as exemplary only, and the true scope and spirit of the present disclosure are indicated by the appended claims.

Claims

1. A communication key updating method, characterized in that: include: Obtaining bit sequences through a quantum key distribution device; Extracting a first key from the bit sequence; Generate a first data sequence according to the first key, where the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key; According to the order of the data in the first data sequence, the value of the corresponding position of each data is searched in the bit sequence in turn, and the second key is constructed based on the searched value.

2. The method according to claim 1, characterized in that The first data sequence is an arithmetic sequence, and the common difference of the first data sequence is not 1; or, the first data sequence is a non-arithmetic sequence, and there is no repeated data in the first data sequence.

3. The method according to claim 1, characterized in that: The method further comprises: After generating a new key, recording the number of keys currently generated based on the bit sequence; The step of generating a first data sequence according to the first key includes: Based on the number of keys generated by the bit sequence, obtain first data in the first data sequence, where the first data is greater than 0; The data at the next position in the first data sequence is calculated based on the data at the previous position in the first data sequence and the first key, until the first data sequence is obtained, wherein there is no repeated data in the first data sequence.

4. The method according to claim 1, characterized in that The method further comprises: After generating a new key, recording the number of keys currently generated based on the bit sequence; The step of generating a first data sequence according to the first key includes: Based on the number of keys generated by the bit sequence, obtain first data in the first data sequence, where the first data is greater than 0; Determining a tolerance of the first data sequence according to the first key; The first data sequence is generated according to the first data in the first data sequence and the tolerance.

5. The method according to claim 3 or 4, characterized in that: The first data sequence is an increasing sequence.

6. The method according to claim 5, characterized in that The step of sequentially searching for a value of a corresponding position of each of the data in the bit sequence comprises: In the case that the data in the first data sequence is greater than the number of bits of the bit sequence, the total number of bits of the bit sequence is subtracted from the data until target data less than or equal to the number of bits of the bit sequence is obtained, and the value of the target data position is searched in the first data sequence based on the target data.

7. The method according to claim 3, characterized in that The step of calculating the data at the next position in the first data sequence according to the data at the previous position in the first data sequence and the first key includes: The data at the next position in the first data sequence is calculated based on the data at the previous position in the first data sequence, the first key and a preset natural number.

8. A communication key updating device, characterized in that: include: A bit sequence acquisition module, used to acquire a bit sequence through a quantum key distribution device; A key extraction module, used to extract a first key from the bit sequence; A data sequence generating module, configured to generate a first data sequence according to the first key, wherein the first data sequence is not an arithmetic sequence with a common difference of 1, and the number of data in the first data sequence is the same as the number of bits of the first key; The key updating module is used to search for the value of the corresponding position of each data in the bit sequence in turn according to the order of the data in the first data sequence, and form a second key based on the searched value.

9. An electronic device, characterized in that: include: A memory for storing instructions; A processor, configured to call instructions stored in the memory to implement the communication key updating method according to any one of claims 1 to 7.

10. A computer-readable storage medium having computer instructions stored thereon, characterized in that: When the computer instructions are executed by a processor, the communication key updating method described in any one of claims 1 to 7 is implemented.

Citation Information

Patent Citations

  • Quantum key distribution network routing method and device, equipment and medium

    CN117792626A

  • High -efficient stable differential phase and compound quantum key distribution system of polarization code

    CN205647538U