CN115883081B - Quantum security hash computing system based on quantum security network and working method thereof - Google Patents

Quantum security hash computing system based on quantum security network and working method thereof Download PDF

Info

Publication number
CN115883081B
CN115883081B CN202211515407.9A CN202211515407A CN115883081B CN 115883081 B CN115883081 B CN 115883081B CN 202211515407 A CN202211515407 A CN 202211515407A CN 115883081 B CN115883081 B CN 115883081B
Authority
CN
China
Prior art keywords
quantum
hash
module
random number
hashed
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
Application number
CN202211515407.9A
Other languages
Chinese (zh)
Other versions
CN115883081A (en
Inventor
杨鸽
李亦
李超龙
何旭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Matrix Time Digital Technology Co Ltd
Original Assignee
Matrix Time Digital Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Matrix Time Digital Technology Co Ltd filed Critical Matrix Time Digital Technology Co Ltd
Priority to CN202211515407.9A priority Critical patent/CN115883081B/en
Publication of CN115883081A publication Critical patent/CN115883081A/en
Application granted granted Critical
Publication of CN115883081B publication Critical patent/CN115883081B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Storage Device Security (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a quantum secure hash computing system based on a quantum secure network and a working method thereof, wherein the system comprises a user side, a quantum encryption and decryption server and a quantum secure hash computing center; the user side is used for carrying out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, transmitting the first ciphertext to the quantum encryption and decryption server through the Internet, and relaying the first quantum key to the quantum encryption and decryption server through a quantum security network; and receiving a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypting the second ciphertext by using the second quantum key to obtain a final quantum security hash value. Under the condition of high concurrency of the hash we ask you, the hash function based on the linear feedback shift register can be generated through the random number and the irreducible polynomial which are generated in advance, so that the quantum secure hash is calculated more efficiently, and the operation efficiency can be improved.

Description

Quantum security hash computing system based on quantum security network and working method thereof
Technical Field
The invention relates to the field of quantum security communication, in particular to a quantum security hash computing system based on a quantum security network and a working method thereof.
Background
The concept of hash values and hash functions is two keywords that blockchain researchers often hear, and hash values are very important for security. For a decentralised network of thousands of nodes, it is desirable to find a way to encode information into a compact form while allowing participants to verify safely and quickly. For example, a key ring of security in a blockchain is: the method can compress the massive information expressing the global state of the network into a short message, and can efficiently verify the integrity of the message when the need exists. This is done using a hash function and the result is a hash value. Even if only one character in the input message is changed, the hash value corresponding to the message obtained last is completely different.
In order to ensure the integrity of data transmission, a hash operation mode is adopted, and the effect of protecting the integrity of the communication message is achieved by transmitting a hash value which is the result of the hash operation, namely, a binary value with any length is mapped into a binary value with a shorter fixed length, and the binary value with the fixed length is the hash value. However, with the increase of computer power, the results of conventional hash algorithms such as MD4, SHA-1, etc. may eventually collide, so that the integrity of the content of the encrypted communication cannot be protected. It is therefore desirable to find a more secure hash algorithm to ensure the integrity of the communication.
Secondly, as the number of users increases, the high concurrency of multi-user simultaneous request hash operations becomes a more common situation in the communications industry, in which case the existing hash computation is far from efficient, and we need to introduce efficient hash computation to support.
Disclosure of Invention
The invention aims to: the invention aims to provide a quantum security hash computing system based on a quantum security network and a working method thereof, which solve the problem that the integrity of the content of encrypted communication cannot be protected due to the fact that collision possibly occurs to the current hash operation result; and the problem that the existing hash calculation efficiency is far from sufficient under the condition of high concurrency is solved. The invention generates a hash function based on a linear feedback shift register by utilizing a pre-generated irreducible polynomial and a random number, and then calculates and regenerates a hash value, so that the security of the hash value is higher, and the collision rate is low; and under the condition of high concurrency of the hash we ask you, the hash operation efficiency can be improved, and the calculation efficiency is greatly improved.
The technical scheme is as follows: the invention relates to a quantum security hash computing system based on a quantum security network, which comprises a user side, a quantum encryption and decryption server and a quantum security hash computing center;
The user side is used for carrying out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, transmitting the first ciphertext to a quantum encryption and decryption server through the Internet, and relaying the first quantum key to the quantum encryption and decryption server through a quantum security network; receiving a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypting the second ciphertext by using the second quantum key to obtain a final quantum security hash value;
The quantum encryption and decryption server is used for receiving a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypting the first ciphertext by using the first quantum key to obtain data to be hashed, and transmitting the data to be hashed to the quantum security hash computation center; the quantum secure hash calculation center receives a quantum secure hash value obtained by calculating data to be hashed, the quantum secure hash value is subjected to quantum encryption through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user side through the Internet, and meanwhile the second quantum key is relayed to the user side through a quantum secure network;
The quantum secure hash computation center is used for receiving data to be hashed transmitted from the quantum encryption and decryption server, generating a hash function at the same time, performing hash operation on the data to be hashed by using the hash function, and sending a quantum secure hash value obtained by the hash operation to the quantum encryption and decryption server.
Further, the quantum secure hash computation center comprises a random number generation module, an irreducible polynomial generation module, a hash computation module and a receiving and distributing module; the irreducible polynomial generation module, the random number generation module and the receiving and distributing module are all connected with the hash calculation module, and the random number generation module is also connected with the irreducible polynomial generation module;
The random number generation module is used for generating random numbers;
The irreducible polynomial generation module is used for generating an irreducible polynomial according to the random numbers provided by the random number generation module;
the hash calculation module comprises N groups of FPGA hash calculation submodules which are arranged in parallel, each group of FPGA Ha Xiji operator modules is used for generating a hash function based on a linear feedback shift register by utilizing the received irreducible polynomial and the random number, inputting data to be hashed into the hash function to obtain a quantum secure hash value, and returning the quantum secure hash value to the receiving and distributing module;
The receiving and distributing module is used for receiving the data to be hashed from the quantum encryption and decryption server, distributing the received data to be hashed to the hash computing module for hash computation, and returning the quantum security hash value obtained by the hash computing module to the quantum encryption and decryption server.
Further, the specific process of distributing the received data to be hashed to the hash calculation module to perform hash calculation is as follows:
If an inoperable FPGA Ha Xiji operator module exists in N groups of FPGA Ha Xiji operator modules of the hash calculation module, the hash calculation module sends received data to the inoperable FPGA Ha Xiji operator module, the FPGA hash calculation submodule generates a hash function based on a linear feedback shift register by using the received irreducible polynomial and the random number, and then the data to be hashed is input into the hash function to obtain a quantum security hash value; if the N groups of FPGA hash calculation submodules of the hash calculation module do not have the non-working FPGA Ha Xiji operator modules, the hash calculation module queues the received data until the non-working FPGA Ha Xiji operator modules exist in the hash calculation module, and then sends the received data to the non-working FPGA Ha Xiji operator modules, so that the quantum security hash value is finally obtained.
Further, the random number generated by the random number generation module is generated in advance; the irreducible polynomial generated by the irreducible polynomial generation module is pre-generated.
Further, the quantum secure hash computation center further comprises a first memory pool and a second memory pool, wherein the first memory pool is used for storing random numbers generated in advance by the random number generation module; the second memory pool is used for storing irreducible polynomials pre-generated by the irreducible polynomial generating module.
Further, the specific process of generating the irreducible polynomial according to the random number provided by the random number generation module is as follows:
1) Firstly, selecting n-bit random numbers, and sequentially using coefficients of each item except the highest item in each corresponding polynomial of the n-bit random numbers to generate an n-order polynomial in a GF (2) domain, wherein the coefficient of the highest item is 1;
2) Then, verifying whether the polynomial is an irreducible polynomial, if the verification result is no, selecting another group of n-bit random numbers as new n-bit random numbers, returning to the step 1) to regenerate the polynomial and verify; if the verification result is yes, stopping verification to obtain an irreducible polynomial.
Further, before step 1), if the last bit of the n-bit random number is 0, making the last bit of the random number be 1; or if the last bit of the n-bit random number is 0, reselecting the n-bit random number until the last bit of the selected n-bit random number is 1.
The invention also comprises a working method of the quantum secure hash computing system based on the quantum secure network, which comprises the following steps:
(1) The method comprises the steps that a user terminal firstly carries out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, the first ciphertext is transmitted to a quantum encryption and decryption server through the Internet, and meanwhile, the first quantum key is relayed to the quantum encryption and decryption server through a quantum security network;
(2) The quantum encryption and decryption server receives a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypts the first ciphertext by using the first quantum key to obtain data to be hashed, and transmits the data to be hashed to the quantum security hash computation center;
The quantum secure hash computation center receives data to be hashed transmitted from the quantum encryption and decryption server, sends the data to be hashed to the receiving and distributing module, distributes the received data to be hashed to the hash computation module, and simultaneously receives the irreducible polynomial generated by the irreducible polynomial generating module and the random number generated by the random number generating module;
the hash calculation module distributes the received data to an FPGA Ha Xiji operator module of the hash calculation module, the FPGA hash calculation submodule generates a hash function based on a linear feedback shift register by utilizing the received irreducible polynomial and the random number, then the data to be hashed is input into the hash function to obtain a quantum security hash value, and the quantum security hash value is returned to the receiving and distribution module;
(3) The receiving and distributing module returns the received quantum secure hash value to the quantum encryption and decryption server, the quantum encryption and decryption server carries out quantum encryption on the quantum secure hash value through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user terminal through the Internet, and meanwhile the second quantum key is relayed to the user terminal through a quantum secure network;
(4) And the user side receives a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypts the second ciphertext by using the second quantum key to obtain a final quantum security hash value.
Further, the irreducible polynomial and the random number in the random numbers generated by the irreducible polynomial generation module are both generated in advance.
The invention has the beneficial effects that: under the condition of high concurrency of the hash we ask you, the hash function based on the linear feedback shift register can be generated through the random number and the irreducible polynomial which are generated in advance, so that the calculation of the quantum secure hash is more efficient, the calculation efficiency can be improved, and a plurality of hash values calculated through the hash function based on the linear feedback shift register are sent back one by one, so that the calculation efficiency is greatly improved; generating a hash function based on a linear feedback shift register by utilizing an irreducible polynomial and a random number, and then generating a hash value, wherein the security of the hash value is higher; because the communication requests of a plurality of users can be processed concurrently, in a certain range, the communication requirements in a certain range can be met by only deploying a single quantum secure hash computing system or even a small quantum secure hash computing system, and resources are saved.
Drawings
FIG. 1 is a schematic diagram of a quantum secure hash computing system based on a quantum secure network of the present invention;
Fig. 2 is a schematic structural diagram of a quantum secure hash computation center.
Detailed Description
The invention is further described below with reference to the accompanying drawings and examples:
As shown in fig. 1 and fig. 2, the invention provides a quantum secure hash computing system based on a quantum secure network, which comprises a user side 1, a quantum encryption and decryption server 2 and a quantum secure hash computing center 3;
the client 1 is used for carrying out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, transmitting the first ciphertext to the quantum encryption and decryption server 2 through the Internet, and relaying the first quantum key to the quantum encryption and decryption server 2 through a quantum security network; receiving a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypting the second ciphertext by using the second quantum key to obtain a final quantum security hash value;
The quantum encryption and decryption server 2 is used for receiving a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypting the first ciphertext by using the first quantum key to obtain data to be hashed, and transmitting the data to be hashed to the quantum security hash computation center 3; the quantum secure hash calculation center 3 receives a quantum secure hash value obtained by calculating data to be hashed, the quantum secure hash value is subjected to quantum encryption through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user side 1 through the Internet, and meanwhile, the second quantum key is relayed to the user side 1 through a quantum secure network;
the quantum secure hash computation center 3 is configured to receive data to be hashed transmitted from the quantum encryption and decryption server 2, generate a hash function at the same time, perform a hash operation on the data to be hashed by using the hash function, and send a quantum secure hash value obtained by the hash operation to the quantum encryption and decryption server 2.
Wherein the quantum secure hash computation center 3 comprises a random number generation module 31, an irreducible polynomial generation module 32, a hash computation module 33 and a receiving and distributing module 34; the irreducible polynomial generation module 32, the random number generation module 31 and the receiving and distributing module 34 are all connected with the hash calculation module 33, and the random number generation module 31 is also connected with the irreducible polynomial generation module 32; the quantum secure hash computation center 3 further comprises a first memory pool 35 and a second memory pool 36;
The random number generation module 31 is configured to generate a random number, where the random number may be generated in advance and stored in the first memory pool 35, or may be generated in a real-time manner;
The irreducible polynomial generating module 32 is configured to generate an irreducible polynomial according to the random number provided by the random number generating module 31, where the generated irreducible polynomial may be pre-generated in a storage manner and stored in the second memory pool 36 for later use, or may be generated in a manner of time-to-time;
The specific process of generating the irreducible polynomial according to the random number provided by the random number generation module is as follows:
1) Firstly, the random number generating module 31 provides a random number to be sent to the irreducible polynomial generating module 32, the irreducible polynomial generating module 32 selects n-bit random numbers, and sequentially uses the coefficient of each term except the highest term in each corresponding polynomial of the n-bit random numbers to generate an n-order polynomial in GF (2) domain, wherein the coefficient of the highest term is 1; for example, the random number is n bits (a n-1,an-2,…,a1,a0), then the generated polynomial is p 1(x)=xn+an-1xn-1+…+a1x+a0; preferably, only when a 0 =1, the generated polynomial is likely to be an irreducible polynomial, so, to reduce the calculation amount in the later verification of the irreducible polynomial, the judgment can be firstly performed on the n-bit random number: if the last bit of the n-bit random number is 0, the last bit of the n-bit random number is 1; or if the last bit of the n-bit random number is 0, reselecting the n-bit random number until the last bit of the selected n-bit random number is 1; this reduces the amount of computation in the case of a late verification irreducible polynomial, and finally results in a 0 =1, the resulting polynomial being p 1(x)=xn+an-1xn-1+…+a1 x+1;
2) Then, verifying whether the polynomial is an irreducible polynomial, if the verification result is "no", the irreducible polynomial generating module 32 reselects another set of n-bit random numbers, and returns to step 1) as a new n-bit random number to regenerate the polynomial and verify; if the verification result is yes, stopping verification to obtain an irreducible polynomial.
There are several ways to verify the irreducible polynomial here, two ways we mention in this invention:
The method comprises the following steps: sequential verification Whether or not it is true, whereinRepresentation pairRounding, if all i are verified to pass, p 1 (x) is an irreducible polynomial of order n over GF (2); wherein gcd (f (x), g (x)) represents the maximum common factor of f (x) and g (x) over GF (2), f (x) and g (x) referring to two arbitrary polynomials.
The second method is as follows: verification conditions (1) x 2n=xmodp1 (x), (2)Whether or not to do so simultaneously, whereinRepresentation ofD is an arbitrary prime factor of n, gcd (f (x), g (x)) represents the maximum factors of f (x) and g (x) on GF (2), f (x) and g (x) refer to two arbitrary polynomials, and when the two verification conditions are satisfied simultaneously, p 1 (x) is an irreducible polynomial of order n on GF (2).
In general, n=2 k is taken, so only d=2 needs to be taken in condition (2). Alternatively, n=2 7 =128 is taken. Since this method only needs to verify these two conditions, we use Fast modular composition algorithm to get quicklyAndBy usingReplacement of condition (2)And (3) performing calculation, and obtaining a calculation result faster by a method of reducing the order.
The hash calculation module 33 comprises N groups of FPGA hash calculation submodules 331 which are arranged in parallel, the FPGA hash calculation submodules 331 are realized by adopting an FPGA, each group of FPGA Ha Xiji operator modules 331 are used for generating a hash function based on a linear feedback shift register by utilizing the received irreducible polynomial and the random number, the data to be hashed is input into the hash function to obtain a quantum security hash value, and the quantum security hash value is returned to the receiving and distributing module 34;
The receiving and distributing module 34 is configured to receive data to be hashed from the quantum encryption and decryption server 2, distribute the received data to be hashed to the hash computing module 33 for hash computation, and return the quantum security hash value obtained by the hash computing module 33 to the quantum encryption and decryption server 2;
The specific process of distributing the received data to be hashed to the hash calculation module 33 for hash calculation is as follows:
If the N groups of FPGA hash computation submodules 331 of the hash computation module 33 have an inoperable FPGA Ha Xiji operator module 331, the hash computation module 33 sends the received data to the inoperable FPGA hash computation submodule 331, the FPGA hash computation submodule 331 generates a hash function based on a linear feedback shift register by using the received irreducible polynomial and the random number, and then the data to be hashed is input into the hash function to obtain a quantum security hash value; if the N groups of FPGA hash calculation submodules 331 of the hash calculation module 33 do not have the unoperated FPGA Ha Xiji operator modules 331, the hash calculation module 33 queues the received data until the unoperated FPGA hash calculation submodules 331 exist in the hash calculation module 33, and then sends the received data to the unoperated FPGA Ha Xiji operator modules 331 to finally obtain a quantum secure hash value; the hash calculation module 33 can simultaneously perform high concurrency processing on the data content of a plurality of users, and send out a plurality of hash values obtained by calculation one by one, so that the calculation efficiency is greatly improved, and the resources are saved;
the first memory pool 35 is used for storing random numbers generated in advance by the random number generation module 31;
the second memory pool 36 is used for storing irreducible polynomials pre-generated by the irreducible polynomial generation module 32.
The invention also comprises a working method of the quantum secure hash computing system based on the quantum secure network, which comprises the following steps:
(1) The method comprises the steps that a user side 1 firstly carries out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, the first ciphertext is transmitted to a quantum encryption and decryption server 2 through the Internet, and meanwhile, the first quantum key is relayed to the quantum encryption and decryption server 2 through a quantum security network;
(2) The quantum encryption and decryption server 2 receives a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypts the first ciphertext by using the first quantum key to obtain data to be hashed, and transmits the data to be hashed to the quantum security hash computation center 3;
The quantum secure hash computation center 3 receives data to be hashed transmitted from the quantum encryption and decryption server 2, sends the data to be hashed to the receiving and distributing module 34, the receiving and distributing module 34 distributes the received data to be hashed to the hash computation module 33, and the hash computation module 33 also receives the irreducible polynomial generated by the irreducible polynomial generating module 32 and the random number generated by the random number generating module 31; the irreducible polynomials and random numbers are preferably pre-generated and stored in a memory manner, but can also be generated from time to time;
The hash calculation module 33 distributes the received data to the FPGA hash calculation submodule 331 of the hash calculation module, the FPGA hash calculation submodule 331 generates a hash function based on a linear feedback shift register by using the received irreducible polynomial and the random number, the data to be hashed is input into the hash function to obtain a quantum security hash value, and the quantum security hash value is returned to the receiving and distribution module 34;
(3) The receiving and distributing module 34 returns the received quantum secure hash value to the quantum encryption and decryption server 2, the quantum encryption and decryption server 2 carries out quantum encryption on the quantum secure hash value through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user side 1 through the Internet, and meanwhile the second quantum key is relayed to the user side 1 through a quantum secure network;
(4) The user terminal 1 receives a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypts the second ciphertext by using the second quantum key to obtain a final quantum security hash value.
Through the process, under the condition that the hash we ask you is high and concurrent, the hash function based on the linear feedback shift register can be generated through the random number and the irreducible polynomial which are generated in advance, so that the calculation of the quantum secure hash is more efficient, the operation efficiency can be improved, and a plurality of hash values calculated through the hash function based on the linear feedback shift register are sent back one by one, so that the calculation efficiency is greatly improved; the hash function based on the linear feedback shift register is generated by utilizing the irreducible polynomial and the random number, and then the hash value is generated, so that the security of the hash value is higher.

Claims (7)

1. A quantum secure hash computing system based on a quantum secure network, characterized in that: the system comprises a user side, a quantum encryption and decryption server and a quantum secure hash computation center;
The user side is used for carrying out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, transmitting the first ciphertext to a quantum encryption and decryption server through the Internet, and relaying the first quantum key to the quantum encryption and decryption server through a quantum security network; receiving a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypting the second ciphertext by using the second quantum key to obtain a final quantum security hash value;
The quantum encryption and decryption server is used for receiving a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypting the first ciphertext by using the first quantum key to obtain data to be hashed, and transmitting the data to be hashed to the quantum security hash computation center; the quantum secure hash calculation center receives a quantum secure hash value obtained by calculating data to be hashed, the quantum secure hash value is subjected to quantum encryption through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user side through the Internet, and meanwhile the second quantum key is relayed to the user side through a quantum secure network;
the quantum secure hash computation center is used for receiving data to be hashed transmitted from the quantum encryption and decryption server, generating a hash function at the same time, performing hash operation on the data to be hashed by using the hash function, and transmitting a quantum secure hash value obtained by the hash operation to the quantum encryption and decryption server;
the quantum secure hash computation center comprises a random number generation module, an irreducible polynomial generation module, a hash computation module and a receiving and distributing module; the irreducible polynomial generation module, the random number generation module and the receiving and distributing module are all connected with the hash calculation module, and the random number generation module is also connected with the irreducible polynomial generation module;
The random number generation module is used for generating random numbers;
The irreducible polynomial generation module is used for generating an irreducible polynomial according to the random numbers provided by the random number generation module;
the hash calculation module comprises N groups of FPGA hash calculation submodules which are arranged in parallel, each group of FPGA Ha Xiji operator modules is used for generating a hash function based on a linear feedback shift register by utilizing the received irreducible polynomial and the random number, inputting data to be hashed into the hash function to obtain a quantum secure hash value, and returning the quantum secure hash value to the receiving and distributing module;
The receiving and distributing module is used for receiving the data to be hashed from the quantum encryption and decryption server, distributing the received data to be hashed to the hash computing module for hash computation, and returning the quantum security hash value obtained by the hash computing module to the quantum encryption and decryption server;
The specific process of distributing the received data to be hashed to the hash calculation module for hash calculation is as follows:
If an inoperable FPGA Ha Xiji operator module exists in N groups of FPGA Ha Xiji operator modules of the hash calculation module, the hash calculation module sends received data to the inoperable FPGA Ha Xiji operator module, the FPGA hash calculation submodule generates a hash function based on a linear feedback shift register by using the received irreducible polynomial and the random number, and then the data to be hashed is input into the hash function to obtain a quantum security hash value; if the N groups of FPGA hash calculation submodules of the hash calculation module do not have the non-working FPGA Ha Xiji operator modules, the hash calculation module queues the received data until the non-working FPGA Ha Xiji operator modules exist in the hash calculation module, and then sends the received data to the non-working FPGA Ha Xiji operator modules, so that the quantum security hash value is finally obtained.
2. The quantum secure hash computing system based on a quantum secure network as claimed in claim 1, wherein: the random number generated by the random number generation module is generated in advance; the irreducible polynomial generated by the irreducible polynomial generation module is pre-generated.
3. The quantum secure hash computing system based on a quantum secure network as claimed in claim 2, wherein: the quantum secure hash computation center further comprises a first memory pool and a second memory pool, wherein the first memory pool is used for storing random numbers generated in advance by the random number generation module; the second memory pool is used for storing irreducible polynomials pre-generated by the irreducible polynomial generating module.
4. The quantum secure hash computing system based on a quantum secure network as claimed in claim 1, wherein: the specific process of generating the irreducible polynomial according to the random number provided by the random number generation module is as follows:
1) Firstly, selecting n-bit random numbers, and sequentially using coefficients of each item except the highest item in each corresponding polynomial of the n-bit random numbers to generate an n-order polynomial in a GF (2) domain, wherein the coefficient of the highest item is 1;
2) Then, verifying whether the polynomial is an irreducible polynomial, if the verification result is no, selecting another group of n-bit random numbers as new n-bit random numbers, returning to the step 1) to regenerate the polynomial and verify; if the verification result is yes, stopping verification to obtain an irreducible polynomial.
5. The quantum secure hash computing system based on a quantum secure network of claim 4, wherein: before step 1), if the last bit of the n-bit random number is 0, making the last bit of the random number be 1; or if the last bit of the n-bit random number is 0, reselecting the n-bit random number until the last bit of the selected n-bit random number is 1.
6. A method of operating a quantum secure hash computing system based on a quantum secure network, comprising the steps of:
(1) The method comprises the steps that a user terminal firstly carries out quantum encryption on data to be hashed through a first quantum key to obtain a first ciphertext, the first ciphertext is transmitted to a quantum encryption and decryption server through the Internet, and meanwhile, the first quantum key is relayed to the quantum encryption and decryption server through a quantum security network;
(2) The quantum encryption and decryption server receives a first ciphertext transmitted from the Internet and a first quantum key relayed by the quantum security network, decrypts the first ciphertext by using the first quantum key to obtain data to be hashed, and transmits the data to be hashed to the quantum security hash computation center;
The quantum secure hash computation center receives data to be hashed transmitted from the quantum encryption and decryption server, sends the data to be hashed to the receiving and distributing module, distributes the received data to be hashed to the hash computation module, and simultaneously receives the irreducible polynomial generated by the irreducible polynomial generating module and the random number generated by the random number generating module;
The hash calculation module comprises N groups of FPGA hash calculation submodules which are arranged in parallel, each group of FPGA Ha Xiji operator modules generates a hash function based on a linear feedback shift register by utilizing the received irreducible polynomial and the random number, data to be hashed is input into the hash function to obtain a quantum secure hash value, and the quantum secure hash value is returned to the receiving and distributing module;
The specific process of the receiving and distributing module distributing the received data to be hashed to the hash computing module is as follows: if an inoperable FPGA Ha Xiji operator module exists in N groups of FPGA Ha Xiji operator modules of the hash calculation module, the hash calculation module sends received data to the inoperable FPGA Ha Xiji operator module, the FPGA hash calculation submodule generates a hash function based on a linear feedback shift register by using the received irreducible polynomial and the random number, and then the data to be hashed is input into the hash function to obtain a quantum security hash value; if the N groups of FPGA hash calculation submodules of the hash calculation module do not have the non-working FPGA Ha Xiji operator modules, the hash calculation module queues the received data until the non-working FPGA Ha Xiji operator modules exist in the hash calculation module, then sends the received data to the non-working FPGA Ha Xiji operator modules, and finally obtains the quantum security hash value;
(3) The receiving and distributing module returns the received quantum secure hash value to the quantum encryption and decryption server, the quantum encryption and decryption server carries out quantum encryption on the quantum secure hash value through a second quantum key to obtain a second ciphertext, the second ciphertext is transmitted to the user terminal through the Internet, and meanwhile the second quantum key is relayed to the user terminal through a quantum secure network;
(4) And the user side receives a second ciphertext transmitted from the Internet and a second quantum key relayed by the quantum security network, and decrypts the second ciphertext by using the second quantum key to obtain a final quantum security hash value.
7. The method of operating a quantum secure hash computing system based on a quantum secure network of claim 6, wherein: the irreducible polynomial and the random number in the random numbers generated by the irreducible polynomial generation module are both pre-generated.
CN202211515407.9A 2022-11-30 2022-11-30 Quantum security hash computing system based on quantum security network and working method thereof Active CN115883081B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211515407.9A CN115883081B (en) 2022-11-30 2022-11-30 Quantum security hash computing system based on quantum security network and working method thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211515407.9A CN115883081B (en) 2022-11-30 2022-11-30 Quantum security hash computing system based on quantum security network and working method thereof

Publications (2)

Publication Number Publication Date
CN115883081A CN115883081A (en) 2023-03-31
CN115883081B true CN115883081B (en) 2024-08-20

Family

ID=85764777

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211515407.9A Active CN115883081B (en) 2022-11-30 2022-11-30 Quantum security hash computing system based on quantum security network and working method thereof

Country Status (1)

Country Link
CN (1) CN115883081B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111726220A (en) * 2020-06-03 2020-09-29 太原理工大学 Method for generating quantum random code at high speed in real time based on chaos amplification quantum noise
CN113268762A (en) * 2021-07-20 2021-08-17 矩阵时光数字科技有限公司 Unconditional security authentication method based on LFSR hash

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109586907B (en) * 2018-12-30 2022-03-15 广东尤科泊得科技发展有限公司 Fusion network system and method for quantum communication and quantum time-frequency transmission
CN113961954B (en) * 2021-10-25 2024-07-23 南京大学 Quantum digital signature system and method based on time phase coding
CN114039720B (en) * 2021-11-17 2024-04-19 南京大学 Unconditional security authentication encryption method based on LFSR hash
CN114362971B (en) * 2022-03-21 2022-06-21 南京大学 Digital asset right confirming and tracing method based on Hash algorithm

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111726220A (en) * 2020-06-03 2020-09-29 太原理工大学 Method for generating quantum random code at high speed in real time based on chaos amplification quantum noise
CN113268762A (en) * 2021-07-20 2021-08-17 矩阵时光数字科技有限公司 Unconditional security authentication method based on LFSR hash

Also Published As

Publication number Publication date
CN115883081A (en) 2023-03-31

Similar Documents

Publication Publication Date Title
EP3984160B1 (en) Homomorphic encryption with applications to private information retrieval
EP3698513B1 (en) Cryptographic device with updatable shared matrix
CN1157021C (en) Multi-node encryption and key delivery
EP0695056B1 (en) A method for sharing secret information, generating a digital signature, and performing certification in a communication system that has a plurality of information processing apparatuses and a communication system that employs such a method
CN108989287B (en) Encryption method, device, terminal equipment and storage medium
US8345861B2 (en) Sharing a secret using polynomial division over GF(Q)
Kim et al. Efficient local secret sharing for distributed blockchain systems
US7912213B2 (en) Device, system and method for fast secure message encryption without key distribution
CN109272316B (en) Block implementing method and system based on block chain network
EP3688925A1 (en) Method and system for key agreement utilizing semigroups
Son et al. Conditional proxy re-encryption for secure big data group sharing in cloud environment
US20100091986A1 (en) Information Management System and Encryption System
Wang et al. Merging: An efficient solution for a time-bound hierarchical key assignment scheme
AU3180699A (en) A method and apparatus for cryptographically secure algebraic key establishment protocols
Hui-Min et al. A cryptographic implementation for dynamic access control in a user hierarchy
CN110266473A (en) Method, relay node and the distribution method of relay node distribution quantum key
EP2847923A1 (en) Byzantine fault tolerance and threshold coin tossing
KR101129335B1 (en) Data distribution storing and restoring methods and apparatuses
CN115883081B (en) Quantum security hash computing system based on quantum security network and working method thereof
Dharani et al. Survey on secret sharing scheme with deduplication in cloud computing
JP6871200B2 (en) Key agreement system and key generator
US20100046740A1 (en) Embedding a secret in a larger polynomial
Chevallier-Mames et al. Linear bandwidth naccache-stern encryption
JP2004274320A (en) Device and method for secret dispersion and for secret reconstruction, secret dispersing and reconstructing system
Blundo et al. Randomness in Multi-Secret Sharing Schemes.

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