CN114629628B - Quantum key synchronization method based on Merck algorithm - Google Patents
Quantum key synchronization method based on Merck algorithm Download PDFInfo
- Publication number
- CN114629628B CN114629628B CN202011467558.2A CN202011467558A CN114629628B CN 114629628 B CN114629628 B CN 114629628B CN 202011467558 A CN202011467558 A CN 202011467558A CN 114629628 B CN114629628 B CN 114629628B
- Authority
- CN
- China
- Prior art keywords
- quantum key
- key cache
- sequence number
- synchronization
- cache unit
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000001360 synchronised effect Effects 0.000 claims abstract description 58
- 239000003999 initiator Substances 0.000 claims description 44
- 230000001502 supplementing effect Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 230000003139 buffering effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
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
Abstract
The invention provides a quantum key synchronization method based on a merck algorithm, which is characterized in that quantum key cache units are organized into a logical tree structure, hash values of each quantum key cache unit are calculated by the tree structure, and gradual synchronization from a father node at the top layer to a child node at the bottom layer is completed through layering. Therefore, the consistency of the reading and writing positions of the synchronous quantum key caching unit can be ensured, and the synchronous quantum key caching unit can be ensured to be completely consistent. Meanwhile, the method also enables the upgrading of the quantum key caching mode.
Description
Technical Field
The invention relates to the field of quantum communication, in particular to a quantum key synchronization method based on a merck algorithm.
Background
In a quantum secret communication network, a quantum key service is required to be provided for a user based on a limited quantum key bit rate, and in order to ensure service quality, a quantum key scheduling function is required to be provided, and the current quantum key scheduling is based on a quantum key cache pool. The quantum key buffer pool is formed by buffering a quantum key generated in a Quantum Key Distribution (QKD) process. And then the quantum key scheduling service performs quantum key scheduling according to the cached quantum key and the service requirement of the quantum key, and finally schedules the quantum key generated by QKD to the hand of the user needing the quantum key.
In order to ensure the consistency of the cached quantum key, when the quantum key is cached, firstly, the received quantum key is stored in one caching unit, and then, the consistency comparison of the quantum key caching units and the synchronization process of the quantum key caching pool are carried out at the two ends of the generated quantum key.
As shown in fig. 1, the current quantum key buffer pool synchronization process adopts a means based on synchronization of offset positions, that is, two ends (KMT-a and KMT-B) of a buffered quantum key select an identical base address as a start synchronization position of the quantum key buffer pool, when the quantum key is read by a scheduling service, a quantum key reading pointer generates an offset with respect to the base address, and when two ends synchronize the quantum key buffer pools, only the offset of the base address is synchronized, and an available quantum key buffer unit is not checked, so that only the base address, reading offset and writing offset of the quantum key buffer pools at two ends after synchronization can be guaranteed to be consistent. Thus, the synchronization of the buffer pools at two ends is successful, and the quantum key buffer units in the quantum key buffer pools after synchronization cannot be guaranteed to be consistent.
According to the quantum key cache pool synchronization method based on the base address and the offset thereof, only the offset address and the base address are synchronized, and the quantum key cache units after synchronization cannot be guaranteed to be completely consistent, for example, the quantum key cache pool of the KMT-A is rewritten, but because of network delay, the quantum key cache pool of the KMT-B is not rewritten, and if the base address and the offset of the quantum key cache pool of the KMT-A are consistent with those before replacement, the quantum key cache units after synchronization cannot be used even if the synchronization of the offset of the quantum key cache pools is completed at two ends. The quantum key buffer pool which is finished synchronously by using the synchronous mode cannot be normally used when quantum key scheduling is carried out subsequently.
In addition, in the current implementation scheme, the quantum key is buffered in the quantum key buffer pool after being serialized in a fixed format, and the quantum key buffer mode cannot be upgraded. However, in view of the development of computer science, the manner in which the subsequent quantum key is cached may be changed to adapt to the changing external environment, and thus, it is necessary to provide the function of upgrading the quantum key caching manner.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a quantum key synchronization method based on the merck algorithm, which is characterized in that quantum key cache units are organized into a logical tree structure, the Hash value of each quantum key cache unit is calculated by the tree structure, and gradual synchronization from a father node at the top layer to a child node at the bottom layer is completed by layering. Therefore, the consistency of the reading and writing positions of the synchronous quantum key caching unit can be ensured, and the synchronous quantum key caching unit can be ensured to be completely consistent. Meanwhile, by means of the method and the device, upgrading of the quantum key caching mode is possible, for example, when the fact that the quantum key caching mode needs to be upgraded is detected, the original quantum key caching mode can be upgraded to the latest caching mode, and subsequent quantum keys can be cached according to the new caching mode.
Specifically, the quantum key synchronization method based on the merck algorithm of the present invention may include the steps of setting a global cache information management unit and a quantum key cache unit at a quantum key cache synchronization initiator and a quantum key cache synchronization receiver, where the global cache information management unit is configured to record a current quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number, and the quantum key cache unit is configured to store quantum key data and a Hash value of a next quantum key cache unit;
the quantum key synchronization method further comprises a quantum key cache unit sequence number synchronization step and a moek algorithm synchronization step, wherein:
in the step of synchronizing the sequence numbers of the quantum key cache units, a quantum key interval overlapped in the quantum key cache synchronization initiator and the quantum key cache synchronization receiver is determined, and a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the overlapped quantum key interval are synchronized into a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the quantum key cache synchronization initiator and the quantum key cache synchronization receiver;
in the step of the synchronization of the Morker algorithm, hash values of all quantum key cache units in the overlapped quantum key interval are calculated in the quantum key cache synchronization initiator, and a Merker tree is formed based on the Hash values; calculating Hash values of all quantum key cache units in the overlapped quantum key interval in the quantum key cache synchronous receiver, and forming a merck tree based on the Hash values; based on the merck algorithm, the merck tree in the quantum key cache synchronization initiator is compared with the merck tree in the quantum key cache synchronization receiver to determine unsynchronized quantum key cache units.
Further, the quantum key caching unit is further configured to store quantum key metadata describing properties of the quantum key; and/or the global cache information management unit is further configured to record a quantum key cache manner.
Further, the quantum key buffer unit sequence number synchronization step is further configured to:
the quantum key cache synchronous initiator acquires a current reading sequence number of the quantum key cache unit and a current writing sequence number of the quantum key cache unit from a global cache information management unit of the quantum key cache synchronous initiator, and sends the current reading sequence number and the writing sequence number of the quantum key cache unit to the quantum key cache synchronous receiver;
the quantum key cache synchronous receiver acquires a current quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number from a global cache information management unit thereof, and compares the current quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number sent by the quantum key cache synchronous initiator with the quantum key cache unit writing sequence number so as to judge whether a coincident quantum key interval exists between the quantum key cache synchronous initiator and the quantum key cache synchronous initiator.
Still further, the quantum key cache unit sequence number synchronization step is further configured to:
when judging that the coincident quantum key interval exists, the quantum key cache synchronous receiver determines a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the coincident quantum key interval and sends the sequence number and the sequence number to the quantum key cache synchronous initiator;
and the quantum key cache synchronous initiator determines the quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number of the coincident quantum key interval according to the received quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number of the coincident quantum key interval.
The step of synchronizing the sequence numbers of the quantum key buffer units may further include clearing the quantum keys not belonging to the overlapping quantum key intervals in the quantum key buffer synchronization receiver and the quantum key buffer synchronization sender.
Further, the moek algorithm synchronization step is further configured to: in the step of forming the merck tree based on the Hash value, taking the Hash value of the quantum key cache unit as a Hash node at the bottommost layer, and performing connection operation layer by layer from the Hash node at the bottommost layer in a mode of performing connection operation on the Hash values of the Hash nodes in pairs to form a Hash node at the upper level until a Hash node at the topmost layer is formed, wherein the number of the Hash nodes at the topmost layer is 1; the method comprises the steps of,
when the number of the Hash nodes at the bottommost layer is singular, supplementing one Hash node to participate in the connection operation, or enabling one Hash node at the bottommost layer to independently participate in the connection operation.
Preferably, the Hash value of the padded Hash node is all zero.
Further, in the quantum key cache synchronization initiator and the quantum key cache synchronization receiver, the unsynchronized quantum key cache unit is marked as unavailable or deleted.
Further, when the sequence number of the unsynchronized quantum key cache unit is the reading sequence number of the quantum key cache unit, synchronously increasing the reading sequence number of the quantum key cache unit by 1 in the quantum key cache synchronous initiator and the quantum key cache synchronous receiver; and/or the number of the groups of groups,
when the serial number of the unsynchronized quantum key cache unit is the written serial number of the quantum key cache unit, synchronously reducing the written serial number of the quantum key cache unit by 1 in the quantum key cache synchronous initiator and the quantum key cache synchronous receiver; and/or the number of the groups of groups,
when the sequence number of the unsynchronized quantum key cache unit is located between the reading sequence number of the quantum key cache unit and the writing sequence number of the quantum key cache unit, marking the unsynchronized quantum key cache unit as unavailable or deleting, or setting the Hash value of the unsynchronized quantum key cache unit to be all zero.
Further, the quantum key synchronization method of the present invention may further include a step of setting an upper limit for a difference between the read sequence number of the quantum key buffer unit and the write sequence number of the quantum key buffer unit.
Optionally, the Hash value of the quantum key buffer unit is calculated based on only the quantum key metadata and the quantum key data stored in the quantum key buffer unit. The quantum key metadata may include, among other things, the length of the quantum key, whether the quantum key is encrypted, an encryption algorithm, and an encryption mode.
Drawings
The following describes the embodiments of the present invention in further detail with reference to the drawings.
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 schematically illustrates a prior art quantum key cache pool synchronization process implemented based on offset location synchronization alone;
fig. 2 schematically illustrates an initialization process of a quantum key buffer unit number, a read number, and a write number in a quantum key synchronization method according to the present invention;
fig. 3 schematically illustrates a schematic diagram of sequence number synchronization steps in a quantum key synchronization method according to the present invention;
fig. 4 schematically illustrates a schematic diagram of forming a Hash tree structure in a quantum key synchronization method according to the present invention;
fig. 5 schematically illustrates an example of a merck algorithm synchronization procedure in a quantum key synchronization method according to the invention;
fig. 6 schematically illustrates another example of a merck algorithm synchronization process in a quantum key synchronization method according to the present invention;
fig. 7 schematically illustrates yet another example of the merck algorithm synchronization process in the quantum key synchronization method according to the present invention.
Detailed Description
Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. The following examples are provided by way of illustration to fully convey the spirit of the invention to those skilled in the art to which the invention pertains. Thus, the present invention is not limited to the embodiments disclosed herein.
According to the invention, in the quantum key synchronization method based on the merck algorithm, a global cache information management unit and a quantum key cache unit can be arranged in a quantum key cache synchronization initiator and a quantum key cache synchronization receiver (namely, two ends participating in synchronization).
The quantum key cache unit may include quantum key metadata, quantum key data, and a Hash value of a next quantum key cache unit.
Quantum key metadata is used to describe properties of the quantum key such as, but not limited to, the length of the quantum key, whether the quantum key is encrypted, the encryption algorithm employed, the encryption mode, and the like.
The quantum key data is the stored quantum key, wherein the length of the stored quantum key can be any value, and the quantum key can be in an encrypted or plaintext form.
By storing the Hash value of the next quantum key cache unit in the current quantum key cache unit, the purpose is to organize a plurality of quantum key cache units (cached quantum keys) into a chained structure, whereby quantum key synchronization can be performed by means of the chained structure using the merck algorithm. The Hash value of the first quantum key buffer unit may be stored in the global buffer information management unit, or may be stored separately, for example, in a memory.
In the invention, in a quantum key buffer unit, the calculation range of the Hash value can be selected in advance according to the requirement. As a preferred embodiment, the Hash value of the quantum key buffer unit may be calculated based on only the quantum key metadata and the quantum key data therein.
The global cache information management unit is used for recording information such as a current reading sequence number (pointer) of the quantum key cache unit (cached quantum key), a writing sequence number (pointer) of the quantum key cache unit (cached quantum key), a quantum key cache mode and the like, acquiring the reading sequence number and the writing sequence number of the quantum key cache unit (cached quantum key) after restarting, so as to synchronize the cached quantum key, and judging whether the quantum key cache mode is needed according to the quantum key cache mode in the global cache information management unit when the quantum key cache mode is updated, and carrying out the synchronization flow of the quantum key cache unit after the update.
In the synchronization method of the present invention, the read sequence number and the write sequence number of the quantum key buffer unit are also initialized. For example, as shown in fig. 2, the initial sequence numbers of the read sequence number and the write sequence number are generated by negotiations between the two ends participating in the synchronization. After initialization, a rule can be set according to a preset sequence number, and a corresponding sequence number can be provided for each cached quantum key caching unit. As one embodiment, the sequence number setting rule may be specified as: each time a quantum key cache unit is cached, the sequence number of the quantum key cache unit is increased, for example by 1, relative to the sequence number of the previous quantum key cache unit. Correspondingly, each time a quantum key cache unit is cached, the written sequence number is increased based on the original written sequence number, for example, the written sequence number is increased by 1; every time a quantum key buffer memory unit is read, the reading sequence number is increased based on the original reading sequence number, for example, 1 is increased. Thus, when the increment is set to 1, those skilled in the art will readily understand that when the read sequence number is equal to the write sequence number, meaning that the quantum key amount currently cached is 0, reading cannot be continued any more.
In order to ensure that the quantum key will not fill the cache, resulting in a host crash of the cached quantum key, an upper limit of the difference between the read sequence number and the write sequence number may be set, where the upper limit represents an upper limit of the quantum key cache pool, when the upper limit is exceeded, the caching of the quantum key is no longer performed (i.e., the quantum key cache unit is no longer cached), or according to the FIFO algorithm, the quantum key cache unit that is cached first is eliminated, and then the new quantum key cache unit is cached.
In order to more clearly understand the present invention, the working principle of the quantum key synchronization method of the present invention will be described further with reference to fig. 3 to 6.
According to the invention, a quantum key buffer unit sequence number synchronization step needs to be performed first.
As shown in fig. 3, in the step of synchronizing the sequence numbers of the quantum key cache units, the quantum key cache synchronization initiator may first acquire the current read sequence number and write sequence number of the quantum key cache unit from its global cache information management unit, and send the read sequence number and write sequence number to the quantum key cache synchronization receiver.
After receiving the quantum key cache synchronous command sent by the quantum key cache synchronous initiator, the quantum key cache synchronous receiver acquires the current reading sequence number and the writing sequence number of the quantum key cache unit from the global cache information management unit of the quantum key cache synchronous receiver, compares the current reading sequence number and the writing sequence number of the quantum key cache unit with the reading sequence number and the writing sequence number of the quantum key cache unit received from the quantum key cache synchronous initiator, and judges whether a coincident quantum key interval exists between the quantum key cache synchronous receiver and the quantum key cache synchronous initiator.
If the two ends participating in synchronization do not have coincident quantum key intervals, the quantum key cache synchronous receiving party replies a quantum key synchronization failure response to the quantum key cache synchronous initiator, and simultaneously clears the self-cached quantum key. After receiving the response of the quantum key synchronization failure, the quantum key cache synchronization initiator empties the self-cached quantum key.
If the two ends of the quantum key interval which participate in synchronization exist, a quantum key cache synchronous receiver empties the quantum key which is cached by the quantum key cache synchronous receiver and does not belong to the coincident quantum key interval, determines a reading sequence number and a writing sequence number of the coincident quantum key interval (a quantum key cache unit), and provides the reading sequence number and the writing sequence number to a quantum key cache synchronous initiator. And the quantum key cache synchronous initiator determines the overlapped quantum key interval according to the received reading sequence number and the received writing sequence number of the overlapped quantum key interval, and clears the quantum key which is cached by the quantum key cache synchronous initiator and does not belong to the overlapped quantum key interval.
After determining that the two ends participating in synchronization have coincident quantum key intervals and finishing synchronization of the reading sequence number and the writing sequence number of the quantum key buffer unit at the two ends participating in synchronization, the merck algorithm synchronization step can be executed.
In the merck algorithm synchronization step, the Hash values of all quantum key cache units between the read sequence number and the write sequence number of the quantum key cache unit may be calculated first.
Then, in the quantum key cache synchronization initiator and the receiver, the merck tree is built based on the Hash value of the quantum key cache unit respectively.
Specifically, firstly, the Hash value of the quantum key buffer unit is used as the lowest layer (L1) node, and the Hash value is connected in a pairwise operation mode, so that a new Hash value is obtained and used as the upper layer node. The construction of the merck tree is completed by repeating the step of performing the connection operation on the Hash value of the current uppermost node in a pairwise operation manner to form a node of a further upper layer until only a unique Hash value node is finally obtained in the uppermost layer (for example, the layer L4 in fig. 4), wherein the layer only having the unique Hash value node is the topmost layer of the merck tree, and the unique Hash value node is the father node of the merck tree, as shown in fig. 4.
Those skilled in the art will appreciate that in the merck tree, the number of nodes in the upper layer is 1/2 of the number of nodes in the lower layer. Therefore, when the number of the bottom Hash nodes (quantum key buffer units) is singular, a preset Hash value can be added as a node of the bottom Hash nodes to participate in the connection operation, or one of the Hash nodes (for example, the Hash value of the last quantum key buffer unit) can solely participate in the connection operation.
In a preferred embodiment, the preset Hash value may be an all-zero Hash value, so as to reduce the operand of the join operation.
After the merck tree is built in both ends participating in synchronization, the synchronization of the quantum key cache unit can be realized by comparing the merck tree in both ends.
Specifically, the quantum key cache synchronization initiator sends the Hash value of the parent node of its merck tree to the quantum key cache synchronization receiver.
The quantum key cache synchronous receiver compares the received Hash value of the father node with the Hash value of the father node of the merck tree of the receiver, and judges whether the two are identical.
If the comparison of the Hash values of the parent nodes fails (i.e., is different), then the left child node and the right child node of the parent node (i.e., the two nodes of the next layer) continue to be synchronously compared. If the left child node and/or the right child node fail to be compared, the two child nodes of the next layer of the node which is failed to be compared currently are continuously and synchronously compared. And recursively comparing from the topmost layer to the bottommost layer until the comparison of the Hash values of the bottommost layer nodes is completed, and determining the bottommost layer node with failed comparison, thereby determining the unsynchronized quantum key cache unit between the quantum key cache synchronous initiator and the receiver.
For a quantum key cache unit that is unsynchronized in both ends, the quantum key cache unit may be marked as unavailable (e.g., the Hash value of the quantum key cache unit is set to all zeros) in both the quantum key cache synchronization initiator and the receiver, or the quantum key cache unit may be deleted. Thereafter, synchronization is performed again, recursively, to all nodes being identical, wherein nodes having a previous synchronization success remain and nodes having a synchronization failure need to be recalculated.
In one example, as shown in fig. 5, when it is determined by recursion comparison that the lowest node that is not synchronized is the leftmost node of the merck tree (which is the quantum key cache unit corresponding to the current reading sequence number), the two ends participating in synchronization may synchronize the reading sequence number by 1 (i.e. delete the quantum key cache unit corresponding to the node), and then perform synchronization again, and recursion to all nodes are the same.
In another example, as shown in fig. 6, when it is determined by recursion comparison that the lowest node that is not synchronized is the rightmost node of the merck tree (which is the quantum key cache unit corresponding to the current writing sequence number), the two ends participating in synchronization may reduce the writing sequence number synchronization by 1 (i.e. delete the quantum key cache unit corresponding to the node), perform synchronization again, and recursion to all nodes are the same.
In yet another example, as shown in fig. 7, when it is determined by recursive alignment that the lowest node of the unsynchronization is a node other than the two sides (which is a quantum key buffer unit located between the read sequence number and the write sequence number), the quantum key buffer unit that is inconsistent (i.e., the alignment fails) may be marked and deleted (and the Hash value of the relevant node that fails to synchronize is recalculated), or the inconsistent quantum key buffer unit may be marked as unavailable, for example, using all zeros as the Hash value participating in the merck tree algorithm.
In the invention, a chain structure of a blockchain is adopted to cache the quantum key, wherein the former quantum key cache unit stores the Hash value of the latter quantum key cache unit. The chained structure can ensure the integrity of the quantum key caching unit and allow the quantum key caching unit to be acquired through the Hash value. In addition, a serial number synchronization mode is adopted to determine the maximum serial number (writing serial number) and the minimum serial number (reading serial number) of a quantum key cache unit participating in computing the merck tree, and the cached quantum keys are synchronized based on an algorithm of the merck tree, so that a small amount of computing resources can be occupied, and the consistency of the quantum keys after synchronization is fully ensured, and the synchronization of reading and writing offset is not only realized. In addition, the invention adopts a mode compatible with subsequent upgrading and caches the caching mode of the quantum key, thereby supporting the upgrading of the caching format of the quantum key and facilitating the subsequent updating of the caching format of the quantum key according to different evolution modes.
While the invention has been described in connection with the specific embodiments illustrated in the drawings, it will be readily appreciated by those skilled in the art that the above embodiments are merely illustrative of the principles of the invention, which are not intended to limit the scope of the invention, and various combinations, modifications and equivalents of the above embodiments may be made by those skilled in the art without departing from the spirit and scope of the invention.
Claims (11)
1. The quantum key synchronization method based on the merck algorithm comprises the steps of setting a global cache information management unit and a quantum key cache unit at a quantum key cache synchronization initiator and a quantum key cache synchronization receiver, wherein the global cache information management unit is used for recording a current reading sequence number of the quantum key cache unit and a writing sequence number of the quantum key cache unit, and the quantum key cache unit is used for storing quantum key data and a Hash value of a next quantum key cache unit;
the quantum key synchronization method further comprises a quantum key cache unit sequence number synchronization step and a moek algorithm synchronization step, wherein:
in the step of synchronizing the sequence numbers of the quantum key cache units, a quantum key interval overlapped in the quantum key cache synchronization initiator and the quantum key cache synchronization receiver is determined, and a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the overlapped quantum key interval are synchronized into a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the quantum key cache synchronization initiator and the quantum key cache synchronization receiver;
in the step of the synchronization of the Morker algorithm, hash values of all quantum key cache units in the overlapped quantum key interval are calculated in the quantum key cache synchronization initiator, and a Merker tree is formed based on the Hash values; calculating Hash values of all quantum key cache units in the overlapped quantum key interval in the quantum key cache synchronous receiver, and forming a merck tree based on the Hash values; based on a merck algorithm, comparing the merck tree in the quantum key cache synchronization initiator with the merck tree in the quantum key cache synchronization receiver to determine an unsynchronized quantum key cache unit; wherein,
when the sequence number of the unsynchronized quantum key cache unit is the reading sequence number of the quantum key cache unit, synchronously increasing the reading sequence number of the quantum key cache unit by 1 in the quantum key cache synchronous initiator and the quantum key cache synchronous receiver; and/or the number of the groups of groups,
when the serial number of the unsynchronized quantum key cache unit is the written serial number of the quantum key cache unit, synchronously reducing the written serial number of the quantum key cache unit by 1 in the quantum key cache synchronous initiator and the quantum key cache synchronous receiver; and/or the number of the groups of groups,
when the sequence number of the unsynchronized quantum key cache unit is located between the reading sequence number of the quantum key cache unit and the writing sequence number of the quantum key cache unit, marking the unsynchronized quantum key cache unit as unavailable or deleting, or setting the Hash value of the unsynchronized quantum key cache unit to be all zero.
2. The quantum key synchronization method of claim 1, wherein the quantum key caching unit is further configured to store quantum key metadata describing properties of the quantum key; and/or the global cache information management unit is further configured to record a quantum key cache manner.
3. The quantum key synchronization method of claim 1, wherein the quantum key cache unit sequence number synchronization step is further configured to:
the quantum key cache synchronous initiator acquires a current reading sequence number of the quantum key cache unit and a current writing sequence number of the quantum key cache unit from a global cache information management unit of the quantum key cache synchronous initiator, and sends the current reading sequence number and the writing sequence number of the quantum key cache unit to the quantum key cache synchronous receiver;
the quantum key cache synchronous receiver acquires a current quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number from a global cache information management unit thereof, and compares the current quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number sent by the quantum key cache synchronous initiator with the quantum key cache unit writing sequence number so as to judge whether a coincident quantum key interval exists between the quantum key cache synchronous initiator and the quantum key cache synchronous initiator.
4. A quantum key synchronisation method as claimed in claim 3, wherein the quantum key cache unit sequence number synchronisation step is further arranged to:
when judging that the coincident quantum key interval exists, the quantum key cache synchronous receiver determines a quantum key cache unit reading sequence number and a quantum key cache unit writing sequence number of the coincident quantum key interval and sends the sequence number and the sequence number to the quantum key cache synchronous initiator;
and the quantum key cache synchronous initiator determines the quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number of the coincident quantum key interval according to the received quantum key cache unit reading sequence number and the quantum key cache unit writing sequence number of the coincident quantum key interval.
5. The quantum key synchronization method of claim 4, wherein the quantum key buffer unit sequence number synchronization step includes clearing quantum keys not belonging to the coincident quantum key interval in the quantum key buffer synchronization receiver and the quantum key buffer synchronization sender.
6. The quantum key synchronization method of claim 1, wherein the moek algorithm synchronization step is further configured to:
in the step of forming the merck tree based on the Hash value, taking the Hash value of the quantum key cache unit as a Hash node at the bottommost layer, and performing connection operation layer by layer from the Hash node at the bottommost layer in a mode of performing connection operation on the Hash values of the Hash nodes in pairs to form a Hash node at the upper level until a Hash node at the topmost layer is formed, wherein the number of the Hash nodes at the topmost layer is 1; the method comprises the steps of,
when the number of the Hash nodes at the bottommost layer is singular, supplementing one Hash node to participate in the connection operation, or enabling one Hash node at the bottommost layer to independently participate in the connection operation.
7. The quantum key synchronization method of claim 6 wherein the Hash value of the padded Hash node is all zeros.
8. The quantum key synchronization method of claim 1, wherein the unsynchronized quantum key cache units are marked as unavailable or deleted in the quantum key cache synchronization initiator and the quantum key cache synchronization receiver.
9. The quantum key synchronization method of claim 1, further comprising the step of setting an upper limit for a difference between the quantum key cache unit read sequence number and the quantum key cache unit write sequence number.
10. The quantum key synchronization method of claim 2, wherein the Hash value of the quantum key buffer unit is calculated based only on quantum key metadata and quantum key data stored therein.
11. The quantum key synchronization method of claim 10, wherein the quantum key metadata comprises a length of a quantum key, whether the quantum key is encrypted, an encryption algorithm, and an encryption mode.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011467558.2A CN114629628B (en) | 2020-12-14 | 2020-12-14 | Quantum key synchronization method based on Merck algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011467558.2A CN114629628B (en) | 2020-12-14 | 2020-12-14 | Quantum key synchronization method based on Merck algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114629628A CN114629628A (en) | 2022-06-14 |
| CN114629628B true CN114629628B (en) | 2024-02-27 |
Family
ID=81897379
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011467558.2A Active CN114629628B (en) | 2020-12-14 | 2020-12-14 | Quantum key synchronization method based on Merck algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114629628B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106301769A (en) * | 2015-06-08 | 2017-01-04 | 阿里巴巴集团控股有限公司 | Quantum key output intent, storage consistency verification method, Apparatus and system |
| CN111159288A (en) * | 2019-12-16 | 2020-05-15 | 郑杰骞 | Method, system, device and medium for storing, verifying and realizing chain structure data |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9509506B2 (en) * | 2011-09-30 | 2016-11-29 | Los Alamos National Security, Llc | Quantum key management |
| US11943237B2 (en) * | 2019-05-24 | 2024-03-26 | International Business Machines Corporation | Malicious peer identification for database block sequence |
| US11362835B2 (en) * | 2019-06-28 | 2022-06-14 | Intel Corporation | Efficient post-quantum anonymous attestation with signature-based join protocol and unlimited signatures |
-
2020
- 2020-12-14 CN CN202011467558.2A patent/CN114629628B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106301769A (en) * | 2015-06-08 | 2017-01-04 | 阿里巴巴集团控股有限公司 | Quantum key output intent, storage consistency verification method, Apparatus and system |
| CN111159288A (en) * | 2019-12-16 | 2020-05-15 | 郑杰骞 | Method, system, device and medium for storing, verifying and realizing chain structure data |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114629628A (en) | 2022-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108810041B (en) | Data writing and capacity expansion method and device for distributed cache system | |
| US10452271B2 (en) | Reconstructing in-memory indices in a distributed data storage system | |
| US9697225B2 (en) | Method for synchronizing file | |
| US20160110109A1 (en) | Using scratch extents to facilitate copying operations in an append-only storage system | |
| CN103530362B (en) | A kind of computer data reading/writing method for many copies distributed system | |
| US9772783B2 (en) | Constructing an index to facilitate accessing a closed extent in an append-only storage system | |
| US20150254320A1 (en) | Using colocation hints to facilitate accessing a distributed data storage system | |
| CN103780638A (en) | Data synchronization method and system | |
| CN110362633B (en) | Block data storage method, device, computer equipment and storage medium | |
| US9720607B2 (en) | Append-only storage system supporting open and closed extents | |
| CN103856516A (en) | Data storage and reading method and data storage and reading device | |
| CN109597903A (en) | Image file processing apparatus and method, document storage system and storage medium | |
| CN110046062A (en) | Distributed data processing method and system | |
| KR101875763B1 (en) | The database management system and method for preventing performance degradation of transaction when table reconfiguring | |
| US8812468B2 (en) | Database management method | |
| CN107798063A (en) | Snap processing method and snapshot processing unit | |
| JP4971717B2 (en) | Directory distributed storage device and data processing request transfer program | |
| JP3756349B2 (en) | Database management apparatus and recording medium on which program is recorded | |
| CN114629628B (en) | Quantum key synchronization method based on Merck algorithm | |
| CN105630688A (en) | Aggregate file storage method and system as well as aggregate file compression method and system | |
| CN113553373A (en) | Data synchronization method and device, storage medium and electronic equipment | |
| CN113297156A (en) | Data synchronization method, device, equipment and medium | |
| CN112115001A (en) | Data backup method and device, computer storage medium and electronic equipment | |
| WO2008010473A1 (en) | Distributed file managing system | |
| CN113672591A (en) | Data migration method, system, storage medium and electronic device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |