CN116760545B - Smart community data encryption method and system based on quantum random number verification - Google Patents
Smart community data encryption method and system based on quantum random number verification Download PDFInfo
- Publication number
- CN116760545B CN116760545B CN202311019303.3A CN202311019303A CN116760545B CN 116760545 B CN116760545 B CN 116760545B CN 202311019303 A CN202311019303 A CN 202311019303A CN 116760545 B CN116760545 B CN 116760545B
- Authority
- CN
- China
- Prior art keywords
- entropy
- random number
- quantum
- quantum random
- representing
- 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 37
- 238000012795 verification Methods 0.000 title claims abstract description 23
- 239000002096 quantum dot Substances 0.000 claims description 18
- 239000011159 matrix material Substances 0.000 claims description 12
- 238000005259 measurement Methods 0.000 claims description 12
- ZPUCINDJVBIVPJ-LJISPDSOSA-N cocaine Chemical compound O([C@H]1C[C@@H]2CC[C@@H](N2C)[C@H]1C(=O)OC)C(=O)C1=CC=CC=C1 ZPUCINDJVBIVPJ-LJISPDSOSA-N 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000009827 uniform distribution Methods 0.000 abstract description 3
- 238000012545 processing Methods 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000005610 quantum mechanics Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- HOWHQWFXSLOJEF-MGZLOUMQSA-N systemin Chemical compound NCCCC[C@H](N)C(=O)N[C@@H](CCSC)C(=O)N[C@@H](CCC(N)=O)C(=O)N[C@@H]([C@@H](C)O)C(=O)N[C@@H](CC(O)=O)C(=O)OC(=O)[C@@H]1CCCN1C(=O)[C@H]1N(C(=O)[C@H](CC(O)=O)NC(=O)[C@H](CCCN=C(N)N)NC(=O)[C@H](CCCCN)NC(=O)[C@H](CO)NC(=O)[C@H]2N(CCC2)C(=O)[C@H]2N(CCC2)C(=O)[C@H](CCCCN)NC(=O)[C@H](CO)NC(=O)[C@H](CCC(N)=O)NC(=O)[C@@H](NC(=O)[C@H](C)N)C(C)C)CCC1 HOWHQWFXSLOJEF-MGZLOUMQSA-N 0.000 description 1
- 108010050014 systemin Proteins 0.000 description 1
- 238000010200 validation analysis Methods 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
-
- 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/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- 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/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Theoretical Computer Science (AREA)
- Power Engineering (AREA)
- Complex Calculations (AREA)
Abstract
The invention discloses a smart community data encryption method and system based on quantum random number verification, which relate to the field of smart community computing and comprise the following steps: receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG); calculating the conditional minimum entropy of the quantum random number; calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition; calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key; the advantages of increasing entropy for assessing the operating condition of a quantum random number generator QRNG can be divided into the following: reducing deviation and correlation of the QRNG output, so that the QRNG output is more similar to ideal uniform distribution and independence; increasing the amount and complexity of information output by QRNG, making it more difficult to compress or analyze; improving the attack resistance of the QRNG, and making it more difficult to tamper with or steal.
Description
Technical Field
The invention relates to the technical field of intelligent communities, in particular to an intelligent community data encryption method and system based on quantum random number verification.
Background
With the development of information technology and Internet of things technology, smart communities are becoming a novel community mode and are receiving wide attention and popularization gradually. The aim of the intelligent community is to optimize and promote the aspects of community management, service, safety, environment and the like by utilizing various intelligent and digital means, so that the life quality and happiness of community residents are enhanced. However, smart communities are also faced with some challenges and risks, one of which is a network security problem. Because the intelligent community involves a large amount of data transmission, storage and processing, if no effective security guarantee measures are available, serious consequences such as hacking, data leakage, identity theft and the like can be caused, and the privacy and property of community residents are endangered. Therefore, how to ensure the network security of the intelligent community is a problem to be solved urgently. In order to solve this problem, quantum random numbers have attracted attention and research as an emerging technical means. Quantum random number is an unpredictable random number generated by utilizing inherent uncertainty of quantum mechanics, has high safety and true randomness, and is an ideal random number source at present. The quantum random number has wide application in the fields of cryptography, communication security, data encryption and the like, and can effectively prevent the defects of predictability, reproducibility, aggressiveness and the like of the traditional random number generator. In addition, the quantum random number plays an important role in the fields of lottery, games, artificial intelligence and the like, and can increase interestingness, fairness and innovation. The quantum random number has irreplaceable value in the fields of scientific research, numerical simulation and the like, and can improve the calculation precision and efficiency. Therefore, the quantum random number can provide higher security, better service quality and more development opportunities for the smart community.
In most cases we generally expect random numbers to be highly random, and how to verify the randomness of random numbers in practical tasks is very important and challenging. In fact, over the last decade, many Quantum Random Number Generator (QRNG) schemes have been proposed, some of which have also been commercialized. Entropy is considered an ideal and effective tool for how to evaluate the operation of QRNG.
Disclosure of Invention
In order to solve the above-mentioned shortcomings in the background art, the present invention aims to provide a smart community data encryption method and system based on quantum random number verification.
The aim of the invention can be achieved by the following technical scheme: receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
calculating the conditional minimum entropy of the quantum random number;
calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
Preferably, the process of obtaining the quantum random number comprises:
extracting length according to the residual hash quotationA uniform random number of bits.
Preferably, the conditional minimum entropy formula is as follows:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is defined in the following.
Preferably, the lower bound of the conditional minimum entropy is verified by a three-dimensional entropy uncertainty relationship.
Preferably, the three-body entropy uncertainty relationship is obtained by using an uncertainty relationship between maximum entropy and minimum entropy:
(1.2)
the lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->Indicating (I)>Representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system a, system C, are legitimate users Alice, charlie, and system E is an eavesdropper Eve.
Preferably, consider thatIn the case of neglecting the system EAnd additional constraintsAnd comparing with formula (1.2),
the method comprises the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is used to determine the minimum non-zero eigenvalue of (c),similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is thatOrder Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship is obtained:
(1.6)
and
(1.7)
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
Preferably, the process of verifying the randomness of the quantum random numbers is performed by using three-quantum-bit symmetric mixed state, and the formula is as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Respectively two state parameters of (a)/>、/>。
In order to achieve the above object, the present invention discloses a smart community data encryption system based on quantum random number verification, which is characterized in that the smart community data encryption system comprises:
and a receiving module: receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
and an entropy calculation module: calculating the conditional minimum entropy of the quantum random number;
and (3) a verification module: calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
an encryption module: and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
Preferably, the smart community data encryption system based on quantum random number verification obtains the quantum random number by the following steps:
extracting length according to the residual hash quotationA uniform random number of bits.
Preferably, the conditional minimum entropy formula is as follows:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is defined in the following.
Preferably, the lower bound of the conditional minimum entropy is verified by a three-dimensional entropy uncertainty relationship.
Preferably, the three-body entropy uncertainty relationship is obtained by using an uncertainty relationship between maximum entropy and minimum entropy:
(1.2)
the lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->Indicating (I)>Representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system a, system C, are legitimate users Alice, charlie, and system E is an eavesdropper Eve.
Preferably, consider thatIn the case of neglecting the system EAnd additional constraintsAnd comparing with formula (1.2),
the method comprises the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is used to determine the minimum non-zero eigenvalue of (c),similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is thatOrder Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship is obtained:
(1.6)
and
(1.7)
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
Preferably, the process of verifying the randomness of the quantum random numbers is performed by using three-quantum-bit symmetric mixed state, and the formula is as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Two state parameters of (a) are +.>、/>。
In a further aspect of the present invention, in order to achieve the above object, there is disclosed an apparatus comprising:
one or more processors;
a memory for storing one or more programs;
when one or more of the programs are executed by one or more of the processors, the one or more of the processors implement a smart community data encryption method based on quantum random number verification as described above.
In another aspect of the present invention, in order to achieve the above object, a storage medium containing computer executable instructions, characterized in that the computer executable instructions, when executed by a computer processor, are for performing a smart community data encryption method based on quantum random number verification as described above.
The invention has the beneficial effects that:
the invention adopts entropy to verify the Quantum Random Number Generator (QRNG), the security and the reliability of the QRNG can be enhanced by improving the entropy, and the advantages of improving the entropy for evaluating the running condition of the QRNG can be divided into the following three aspects: (1) reducing deviation and correlation of the QRNG output, so that the QRNG output is more similar to ideal uniform distribution and independence; (2) increasing the amount and complexity of information output by QRNG, making it more difficult to compress or analyze; (3) improving the attack resistance of the QRNG, and making it more difficult to tamper with or steal.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described, and it will be obvious to those skilled in the art that other drawings can be obtained according to these drawings without inventive effort;
FIG. 1 is a schematic flow chart of the method of the present invention;
FIG. 2 is a schematic diagram of the system architecture of the present invention;
FIG. 3 is a graph comparing the lower bound of the conditional minimum entropy of the present invention with the lower bound of Vallone et al.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1, a smart community data encryption method based on quantum random number verification comprises the following steps:
receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
calculating the conditional minimum entropy of the quantum random number;
calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
From the remaining hash quotation we can extract a length of aboutA uniform random number of bits. Here we introduce minimum entropy->. It can be seen that the minimum entropy is directly related to the probability of guessing. When the probability of guessing is small, the output of random numbers is nearly uniform. Usually, system->Not isolated but rather +_ to an external system>And (5) correlation. Therefore, we have to consider the presence of an eavesdropper +.>The security of the random number is extracted. It is therefore necessary to introduce conditional minimum entropy:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is defined in the following. In principle, perfect randomness can be obtained if the conditional minimum entropy is large enough. Interestingly, the three-body entropy uncertainty relationship is well suited to be used to verify the lower bound of conditional minimum entropy. Vallone et al, 2014, originally utilized the uncertainty relationship between maximum entropy and minimum entropy
(1.2)
The lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->Indicating (I)>Representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system a, system C, are legitimate users Alice, charlie, and system E is an eavesdropper Eve. That is, if the lower bound is large enough, the true quantum randomness can be ensured.
Taking into account that(in the case of neglecting System E)) And additional constraintsAnd comparing with formula (1.2),
the method can obtain the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is used to determine the minimum non-zero eigenvalue of (c),similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is thatOrder Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship can be obtained:
(1.6)
and
(1.7)
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
Furthermore, to demonstrate that our lower bound is tighter than Vallone et al, we choose to use a three-qubit symmetric family mixture for validation as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Two state parameters of (a) are +.>、/>. And a comparison of our lower bound and Vallone et al lower bound is shown (as shown in fig. 3). Clearly, the lower bound of our conditional minimum entropy is always larger than Vallone et al, which suggests that our conclusion improves the verification of quantum randomness.
It should be further noted that, in the implementation, entropy is a measure of uncertainty or complexity of information, and may also be understood as a degree of disorder in a system. The higher the entropy, the more uncertain the information and the more complex the system, while in the quantum random number field, the better the randomness of the QRNG output, the more difficult it is to predict or attack. Thus, increasing entropy may enhance the security and reliability of QRNGs. In particular, the advantages of increasing entropy for assessing the operational condition of QRNGs can be divided into three aspects: (1) reducing deviation and correlation of the QRNG output, so that the QRNG output is more similar to ideal uniform distribution and independence; (2) increasing the amount and complexity of information output by QRNG, making it more difficult to compress or analyze; (3) improving the attack resistance of the QRNG, and making it more difficult to tamper with or steal.
In another aspect, as shown in fig. 2, an embodiment of the present invention discloses a smart community data encryption system based on quantum random number verification, which is characterized by comprising:
and a receiving module: receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
and an entropy calculation module: calculating the conditional minimum entropy of the quantum random number;
and (3) a verification module: calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
an encryption module: and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
Extracting length according to the residual hash quotationA uniform random number of bits.
Preferably, the conditional minimum entropy formula is as follows:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is defined in the following.
Preferably, the lower bound of the conditional minimum entropy is verified by a three-dimensional entropy uncertainty relationship.
Preferably, the three-body entropy uncertainty relationship is obtained by using an uncertainty relationship between maximum entropy and minimum entropy:
(1.2)
the lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->The representation is made of a combination of a first and a second color,/>representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system a, system C, are legitimate users Alice, charlie, and system E is an eavesdropper Eve.
Preferably, consider thatIn neglecting the systemIn the case of EAnd additional constraintsAnd comparing with formula (1.2),
the method comprises the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is used to determine the minimum non-zero eigenvalue of (c),similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is thatOrder Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship is obtained:
(1.6)
and
(1.7)。
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
Preferably, the process of verifying the randomness of the quantum random numbers is performed by using three-quantum-bit symmetric mixed state, and the formula is as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Two state parameters of (a) are +.>、/>。
Based on the same inventive concept, the present invention also provides a computer apparatus comprising: one or more processors, and memory for storing one or more computer programs; the program includes program instructions and the processor is configured to execute the program instructions stored in the memory. The processor may be a central processing unit (Central Processing Unit, CPU), but may also be other general purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application SpecificIntegrated Circuit, ASIC), field-Programmable gate arrays (FPGAs) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., which are the computational core and control core of the terminal for implementing one or more instructions, in particular for loading and executing one or more instructions within a computer storage medium to implement the methods described above.
It should be further noted that, based on the same inventive concept, the present invention also provides a computer storage medium having a computer program stored thereon, which when executed by a processor performs the above method. The storage media may take the form of any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electrical, magnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
In the description of the present specification, the descriptions of the terms "one embodiment," "example," "specific example," and the like, mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present disclosure. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing has shown and described the basic principles, principal features, and advantages of the present disclosure. It will be understood by those skilled in the art that the present disclosure is not limited to the embodiments described above, which have been described in the foregoing and description merely illustrates the principles of the disclosure, and that various changes and modifications may be made therein without departing from the spirit and scope of the disclosure, which is defined in the appended claims.
Claims (8)
1. The smart community data encryption method based on quantum random number verification is characterized by comprising the following steps of:
receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
calculating the conditional minimum entropy of the quantum random number;
calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
the conditional minimum entropy formula is as follows:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is the infinitesimal of (2);
the lower bound of the minimum entropy of the condition is verified through a relation of uncertainty of the three-dimensional entropy;
the three-body entropy uncertainty relationship is obtained by utilizing an uncertainty relationship between maximum entropy and minimum entropy:
(1.2)
the lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->Indicating (I)>Representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system A, system C are legal users Alice, charlie, system E is eavesdropper Eve;
and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
2. The smart community data encryption method based on quantum random number verification according to claim 1, wherein the quantum random number obtaining process is as follows:
extracting length according to the residual hash quotationA uniform random number of bits.
3. The smart community data encryption method based on quantum random number verification according to claim 1, wherein the method is characterized in thatIn the case of neglecting the system EAnd additional constraintsAnd comparing with formula (1.2),
the method comprises the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is the minimum non-zero eigenvalue of +.>Similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is->Order Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship is obtained:
(1.6)
and
(1.7)
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
4. The smart community data encryption method based on quantum random number verification according to claim 1, wherein the process of verifying the randomness of the quantum random number is performed by using three-quantum-bit symmetric mixed state, and the formula is as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Two state parameters of (a) are +.>、/>。
5. An intelligent community data encryption system based on quantum random number verification is characterized by comprising:
and a receiving module: receiving a quantum random number, wherein the collection process of the quantum random number is generated by a Quantum Random Number Generator (QRNG);
and an entropy calculation module: calculating the conditional minimum entropy of the quantum random number;
and (3) a verification module: calculating the lower bound of the minimum entropy of the condition, and verifying the randomness of the quantum random number according to the calculated lower bound of the minimum entropy of the condition;
the conditional minimum entropy formula is as follows:
(1.1)
wherein ,for conditional minimum entropy, quantum state->Satisfy->System A is a legal user Alice and holds a quantum state +.>System E is an eavesdropper Eve and holds the quantum states +.>Satisfy->，/>Is Hilbert space>Representation and->Identity matrix of the same size, +.>Representing more than all->Is (are) upper bound, is (are) lower bound>Representing get set element +.>Is the infinitesimal of (2);
the lower bound of the minimum entropy of the condition is verified through a relation of uncertainty of the three-dimensional entropy;
the three-body entropy uncertainty relationship is obtained by utilizing an uncertainty relationship between maximum entropy and minimum entropy:
(1.2)
the lower bound of conditional minimum entropy is derived:
(1.3)
wherein Represents the maximum overlap of two measurements, negative logarithm based on two +.>Usually with the symbol->Indicating (I)>Representing observability amount +.>Right-vector form of eigenvectors of (a) can be understood as a column vector,/a->Representing observability amount +.>The left-vector form of eigenvectors of (a) can be understood as a row vector,/a->The larger the lower bound of the minimum entropy, the more true quantum randomness can be guaranteed, representing the inner product of two observably measured eigenvectors, +.>Representing conditional minimum entropy, < >>Is the conditional maximum entropy, in neglecting the system +.>In the case of (2), the conditional maximum entropy is expressed as R nyi entropy of 1/2 th order->，/> and />Two different observables of system A, system C are legal users Alice, charlie, system E is eavesdropper Eve;
an encryption module: and calculating the verified quantum random number to obtain a quantum key, and encrypting the intelligent community data by using the quantum key.
6. The smart community data encryption system based on quantum random number verification of claim 5, wherein the process of obtaining the quantum random number comprises:
extracting length according to the residual hash quotationA uniform random number of bits.
7. The smart community data encryption system based on quantum random number verification of claim 5, wherein the system is characterized in thatIn the case of neglecting the system EAnd additional constraintsAnd comparing with formula (1.2),
the method comprises the following steps:
(1.4)
and
(1.5)
wherein Representing the minimum entropy of system A, +.>Representing +.>Minimum entropy after measurement, minus infinity entropy of system E +.>Defined as->，/>Is->Is the minimum non-zero eigenvalue of +.>Similarly, let go of>Representation system->The minimum entropy of (2) and the maximum entropy are expressed as +.>Is->Order Renyi entropy->；
If the systemIs a trivial space and subtracts ++for both sides of equation (1.4) simultaneously>The following improved relationship is obtained:
(1.6)
and
(1.7)
indicating when->Taking ∈0 when the weight is greater than 0>Otherwise, take 0, & gt>Only for replacing the right part of formula (1.7).
8. The smart community data encryption system based on quantum random number verification according to claim 5, wherein the process of verifying the randomness of the quantum random number is performed by using three-quantum-bit symmetric family mixed state, and the formula is as follows:
(1.8)
representing a selected three-qubit symmetry family of mixed states with density matrices of GHZ states thereinAnd density matrix of W state->And the expression of GHZ state is written asThe expression of the W state is written asWherein 0 and 1 respectively represent two states of a single qubit, and quantum state +.>Two state parameters of (a) are +.>、/>。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019303.3A CN116760545B (en) | 2023-08-14 | 2023-08-14 | Smart community data encryption method and system based on quantum random number verification |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311019303.3A CN116760545B (en) | 2023-08-14 | 2023-08-14 | Smart community data encryption method and system based on quantum random number verification |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116760545A CN116760545A (en) | 2023-09-15 |
| CN116760545B true CN116760545B (en) | 2023-10-17 |
Family
ID=87949985
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311019303.3A Active CN116760545B (en) | 2023-08-14 | 2023-08-14 | Smart community data encryption method and system based on quantum random number verification |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116760545B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112468292A (en) * | 2020-11-16 | 2021-03-09 | 南京大学 | High-efficiency quantum digital signature method and system |
| CN115361127A (en) * | 2022-08-23 | 2022-11-18 | 中国科学院计算技术研究所 | Quantum random number post-processing method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102308245B1 (en) * | 2019-09-17 | 2021-10-01 | 주식회사 이와이엘 | Method and system of providing quantum random numbers based on quantum entropy source |
-
2023
- 2023-08-14 CN CN202311019303.3A patent/CN116760545B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112468292A (en) * | 2020-11-16 | 2021-03-09 | 南京大学 | High-efficiency quantum digital signature method and system |
| CN115361127A (en) * | 2022-08-23 | 2022-11-18 | 中国科学院计算技术研究所 | Quantum random number post-processing method and device |
Non-Patent Citations (4)
| Title |
|---|
| B. Solymos et al ; .Efficiency improvement of photon arrival time based quantum random number generator with hashing.IEEE.2023,第53-58页. * |
| Fei Ming et al.Improved tripartite uncertainty relation with quantum memory.arXiv.2020,第1-7页. * |
| 于全福.基于量子效应的随机数产生研究.中国优秀硕士学位论文全文数据库信息科技辑（月刊）.2013,第I136-121页. * |
| 李丽娟 ; 明飞 ; 宋学科 ; 叶柳 ; 王栋.熵不确定度关系综述.物理学报.2022,71(007),第1-17页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116760545A (en) | 2023-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Dembo et al. | Gibbs measures and phase transitions on sparse random graphs | |
| Jung et al. | Accounttrade: Accountability against dishonest big data buyers and sellers | |
| US20220100473A1 (en) | Generation of certified random numbers using an untrusted quantum computer | |
| Gong et al. | Homomorphic evaluation of the integer arithmetic operations for mobile edge computing | |
| Zhang et al. | Image encryption algorithm based on image hashing, improved chaotic mapping and DNA coding | |
| CN111611621A (en) | Block chain based distributed data encryption storage method and electronic equipment | |
| Stoyanov et al. | A novel pseudorandom bit generator based on Chirikov standard map filtered with shrinking rule | |
| CN115309861A (en) | Ciphertext retrieval system, method, computer equipment and storage medium | |
| Wang et al. | CrabNet for explainable deep learning in materials science: bridging the gap between academia and industry | |
| CN113806350A (en) | Management method and system for improving security of big data transaction platform | |
| CN116760545B (en) | Smart community data encryption method and system based on quantum random number verification | |
| Vidick | From operator algebras to complexity theory and back | |
| CN115174451B (en) | Message encryption detection method, device, equipment and storage medium | |
| CN111859424A (en) | Data encryption method, system, terminal and storage medium of physical management platform | |
| CN116361813A (en) | Perception method, device and equipment for risk attack | |
| Wang et al. | A privacy-preserving cross-media retrieval on encrypted data in cloud computing | |
| US11537742B2 (en) | Sampling from a remote dataset with a private criterion | |
| CN111213146B (en) | Pseudo data generating apparatus, method thereof, and recording medium | |
| Li et al. | Post-Quantum Privacy-Preserving Provable Data Possession Scheme Based on Smart Contracts | |
| JPWO2015008605A1 (en) | Calculation device, calculation method, and program | |
| Ganescu et al. | Trust the Process: Zero-Knowledge Machine Learning to Enhance Trust in Generative AI Interactions | |
| CN117792800B (en) | Information verification method and system based on Internet of things security evaluation system | |
| Han et al. | Differential Privacy Technology of Big Data Information Security based on ACA-DMLP | |
| Li et al. | A novel computational model for SRAM PUF min-entropy estimation | |
| US20240048354A1 (en) | Electronic device using homomorphic encryption and encrypted data processing method thereof |
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 |