Electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes

Abstract

The present invention relates to the technical field of electronic information technology anti-counterfeiting, and specifically to an electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes. By introducing a quantum random number generator to generate true random numbers, a five-tuple scenario space is constructed to integrate multi-dimensional data of users, seals, files, time, and geographic location. The SPHINCS+ quantum-resistant signature algorithm is used in conjunction with blockchain evidence storage to form a four-layer nested dynamic security system consisting of "quantum randomness injection, multi-source data binding, quantum-resistant encryption, and blockchain evidence storage." At the same time, a trusted system for the entire process, from application and review to stamping and verification, is established. Compared with traditional electronic seals, this method has achieved significant breakthroughs in random number security, quantum attack resistance, data integration, and tamper detection sensitivity, providing a trusted electronic seal solution for the quantum era for scenarios such as finance.

Description

Technical Field

[0001] The present invention relates to the technical field of electronic information technology anti-counterfeiting, and in particular to an electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes. Background Art

[0002] Existing electronic seal technology relies on digital signatures, CA authentication, timestamps, and hash algorithms as its core foundation. It uses asymmetric encryption algorithms (such as SM2 and RSA) to bind the seal to the subject's identity, and uses timestamps and hash algorithms to solidify document content to prevent tampering. Digital paper technology also ensures that electronic document layouts cannot be tampered with. However, it has significant limitations in identity verification, data storage, and quantum security. These include weak identity verification mechanisms, a lack of full-process evidence storage, a lack of quantum attack resistance, insufficient dynamic randomness, and multi-dimensional data fragmentation.

[0003] Specifically reflected in:

[0004] Weak identity authentication mechanism: Single manual verification or static password verification cannot protect against the risk of identity fraud.

[0005] Lack of evidence for the entire process: Seal usage records are only stored in a centralized database and are easily tampered with or lost.

[0006] Lack of ability to resist quantum attacks: Existing electronic seals generally use RSA, SHA-256 hash and ECDSA signature algorithms, which face quantum computing threats (such as Shor's algorithm) and are expected to be cracked before 2030. They cannot meet the long-term trust needs of finance and other industries.

[0007] Insufficient dynamic randomness: Random numbers are generated by relying on a pseudo-random number generator. The randomness is limited by the algorithm and can be cracked through prediction attacks.

[0008] Multi-dimensional data fragmentation: users, files, seals, and spatiotemporal information have not formed a unified data chain, resulting in the problem of "data islands". Summary of the Invention

[0009] The purpose of the present invention is to provide an electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes to solve the problems of existing electronic seal technology, such as weak identity authentication mechanism, lack of full-process evidence storage, lack of anti-quantum attack capability, insufficient dynamic randomness, and multi-dimensional data fragmentation.

[0010] In order to solve the above technical problems, the present invention adopts the following technical solutions:

[0011] A method for verifying an electronic seal based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes, comprising the following steps:

[0012] S1. The user submits a seal application on the seal system;

[0013] S2. Reviewers review the application;

[0014] S3. After passing the review, the user will verify their identity and materials at the device;

[0015] S4. After verification is passed, the stamping instruction is triggered;

[0016] S5, QRNG generates quantum random numbers;

[0017] S6. Calculate the hash value using SHA-3 based on the hash of the printed content, quantum random number, and spatiotemporal characteristics to obtain a fixed-length digest;

[0018] S7. Generate a SPHINCS+ key pair and sign the unique digest using the private key to obtain a unique identification code;

[0019] S8. Simultaneously inject the quantum random number into the HSM module of the terminal device and save the public key;

[0020] S9. The unique identification code is uploaded to the chain and the hash value of the certificate is returned;

[0021] S10. The device first prints the hash value of the evidence at the location to be stamped, and then stamps it;

[0022] S11. Verify using the SPHINCS+ quantum-resistant algorithm.

[0023] A further technical solution is that in step S11, the verification process is decomposed into quantum entropy source initialization, multi-source data anchoring, quantum hash mixing, quantum-resistant signature, quantum signature and blockchain evidence storage.

[0024] A further technical solution is that the quantum entropy source initialization includes extending the single photon polarization state model to a multi-dimensional scene space based on quantum information theory to construct a five-tuple The high-dimensional Hilbert space of each dimension is constructed through tensor product of quantum states to form a composite system state space, and its density matrix is ​​expressed as: ;in, Represents the quantum state density matrix of a multidimensional composite system, describing the overall state composed of multiple subsystems, is the direct product symbol, which is used to combine the states of multiple subsystems into the state of a composite system. No. The pure state density matrix of the subsystem is is the quantum state vector of the subsystem, is its conjugate transpose, where , Represents user, seal, file, time, and location respectively. That is, the probability amplitude, satisfying ; According to Holevo's theorem, quantum random number source With external systems The classical mutual information upper bound is: ;in Quantum random number source With external systems The classical mutual information between for and The joint density matrix of for The conditional density matrix of is the corresponding probability, To describe the upper limit of classical information carried by a quantum state, Is the external system The deviation, is the entropy of the quantum state, which measures the uncertainty or information content of the quantum state and is defined as ; A two-layer extractor model is used, namely physical layer extraction and logical layer enhancement, where physical layer extraction includes using dimension matrix Quantum measurement time series data Perform a linear transformation, satisfy and ; ,in The original quantum measurement data, i.e. dimensional binary sequence, for dimension matrix, Initial random number sequence extracted for the physical layer; logical layer enhancements include the introduction of dynamic keys of Counter Mode Pair Obfuscation yields: ,in Indicates the initial random number extracted by the physical layer, through The matrix operation is used to process the original quantum measurement data to obtain: It represents the final generated quantum random number, which is a secure random number output after double-layer processing at the physical layer and the logical layer. To increment the counter, the key Each generation Bit updated once, Represents an exclusive OR operation, which is used to combine the initial random number with The encryption result is obfuscated to enhance unpredictability. Represents the concatenation operator, which concatenates the counter value with the initial random number after padding. The input data, Fill function, Fill to Block size, ensure the input length is legal; after double-layer processing, output random number With external systems The mutual information satisfies: ,in, is a random number With external systems The classical mutual information between is the upper limit of the mutual information security boundary, for Matrix output dimensions, is the original quantum measurement dimension, is the number of queries within the key update cycle, The time complexity of the side channel attack; constructing the post-processing density matrix is: ,in and They are conversion channels for the physical layer and the logical layer respectively.

[0025] A further technical solution is that the multi-source data anchoring includes the formal definition of data dimensions, multi-dimensional fusion model and dynamic weight allocation; the formal definition of data dimensions includes defining a five-tuple scene space , the probability of scene uniqueness is the product of the independent probabilities of each dimension: ; The multidimensional fusion model includes five-tuple scene space Based on this, a multi-dimensional function association layer is introduced, including data preprocessing, unified linearization model, weight calculation and function selection. Data preprocessing includes hash value security conversion: , converting the hash value / integer into interval, avoid zero values, take logarithmic compression of numerical range, improve numerical stability, normalize the dimensions, , unify the data of each dimension into or interval, eliminating the dimension effect; the unified linearization model includes substituting the function into the original formula and linearizing it to obtain ; Weight calculation includes using the least squares formula , optimized by training data , so that the predicted value and The error is minimized; the dynamic weight allocation includes defining a weight matrix ,in Indicates the importance of the corresponding dimension, and the weight update rule is , input the weighted multidimensional data into Hash to get: ,If a dimension of data is tampered, the weight coefficient will amplify its impact on the ,overall hash value, and improve the sensitivity of tampering detection.

[0026] A further technical solution is that the quantum hash mixing includes quantum random Under the model, The collision resistance of can be proved by the quantum birthday attack lower bound: , which represents the quantum random The attacker in the model, The number of quantum queries performed by the attacker, is the output length of the hash function, traditional The anti-collision probability is , combined with the quantum random number injected by QRNG Equivalent to double hashing, the actual collision probability is further reduced to: ; Using the time-varying quantum salt value protocol: ,Through this model, the dynamics of the hash function is improved from one change per use to one change per clock cycle.

[0027] A further technical solution is that the anti-quantum signature Including the formal verification of hierarchical signatures and dynamic key generation protocol, where the formal verification of hierarchical signatures includes defining the Merkle tree verification path as ,in is the tree height, the verification algorithm can be expressed as: ,in, Represents a signature verification function, which takes as input the hash value to be verified, the Merkle tree verification path, and the root public key, and outputs the verification result. Represents the hash value of the message to be verified, Verify the path for the Merkle tree , To verify the path Hash values ​​are used to calculate the root hash layer by layer. is the root public key, It is an iterative hash function that performs The hash operation simulates the layer-by-layer construction process of the Merkle tree. Under the quantum computing model, the overall security level is determined by WOTS+one-time signature, reaching , meeting the requirements of quantum security; the dynamic key generation protocol includes the adaptive SPHINCS+ scheme: ,in is the public key, with time slices The dynamically updated public key corresponds to the root hash of the Merkle tree. is the private key, over time Dynamically updated private keys, including the private key fragment and path information of the Merkle tree, Key pair generation function, input parameters, is the key length, For the timestamp parameter, a one-time auxiliary random number is introduced when signing get: ,in For signature data, for time slice The generated unique signature includes the hash value, verification path and random factor. It is a one-time auxiliary random number. It is a random number generated each time a signature is signed. It ensures that the signatures of the same message in different time slices are different, thus avoiding duplicate signature attacks.

[0028] A further technical solution is that the quantum signature and blockchain evidence storage include the quantum cryptography design of the hardware security module and the quantum-resistant consensus protocol of the blockchain evidence storage, wherein the quantum cryptography design of the hardware security module includes the construction of a quantum security hardware layer, specifically quantum key injection, using quantum key distribution, i.e. Generate symmetric keys ,for , It is the symmetric key stored in HSM and is used to encrypt the key data of the electronic seal. Key extraction function based on quantum key distribution, from quantum random number and Generated one-time initial key Extract the security key from the quantum state; quantum state destruction uses the principle of quantum decoherence to make the stored quantum state Degenerates into a mixed state ,in is the quantum state density matrix after destruction, describing the result of the stored quantum state degenerating into a mixed state. For the A pure state projection operator represents the random state that the quantum state may be in after it is destroyed. The quantum state is The probability amplitude satisfies the probability normalization condition ; Integrate the triple mechanisms of quantum hashing, SPHINCS+ signature, and blockchain evidence storage to build a cascade security model: , where the quantum hash collision probability is , the SPHINCS+ signature collision probability is , the probability of blockchain evidence collision is , the total collision probability is The quantum-resistant consensus protocol for blockchain evidence storage includes the design of a quantum proof-of-work (QPoW) mechanism: , where Nonce is the random number in the proof of work. Through iterative calculation, a value that meets the conditions is found so that the hash result is less than the target value Target. To find the minimum value that makes the expression valid Value, that is, the process of finding a valid Nonce, It is the quantum dynamic identification code, which is the unique identification code generated by the electronic seal, containing multidimensional data and quantum random numbers. It is the hash value of the previous block, ensuring the chain continuity and immutability of the blockchain. It is a temporary random number variable, which is concatenated with other parameters as the input of SHA-3. Target is the dynamically adjusted difficulty value. Under quantum computing, the cracking complexity of QPoW is , combined with 256-bit SHA-3, it can meet quantum security requirements. Combined with the chain structure of the blockchain, the chain structure of the blockchain and the quantum-resistant hash ensure that it cannot be tampered with: , is the quantum state vector, and represent the original quantum state, is the initial auxiliary quantum state, Unitary transformation Acting on the original state and auxiliary state The joint system, is the target state after tampering, indicating that the attacker attempts to Copy and modify to duplicate state.

[0029] Compared with the prior art, the present invention has the following beneficial effects:

[0030] Enhanced identity verification: Through multiple verification mechanisms such as facial recognition, fingerprint scanning and ID card scanning, a multi-level identity verification system has been established, which significantly improves the accuracy and security of identity verification, effectively resists the risk of identity fraud, and ensures the consistency of the user and applicant's identity.

[0031] Trusted evidence storage for the entire process: With the help of blockchain technology, key data of the seal-using process is stored on the chain. The blockchain's tamper-proof and traceable characteristics solve the problem of traditional centralized databases being easily tampered with and lost, and realize trusted evidence storage for the entire seal-using process, ensuring data integrity and evidence effectiveness.

[0032] Improved anti-quantum attack capabilities: The SPHINCS+ quantum-resistant signature algorithm is used to replace traditional RSA, ECDSA and other algorithms, which can resist the threat of quantum computing attacks, meet the long-term trust needs of fields with high security requirements such as finance, and extend the security life cycle of electronic seals.

[0033] Dynamic randomness enhancement: QRNG (quantum random number generator) is introduced to generate true random numbers. Compared with traditional pseudo-random number generators, its randomness is not restricted by the algorithm, which greatly improves the unpredictability of random numbers, effectively resists prediction attacks, and enhances the security and reliability of the electronic seal generation and verification process.

[0034] Multi-dimensional data fusion: Integrate multi-dimensional data such as user information, file content, seal unique ID, time and space information, generate a fixed-length summary through the SHA-3 hash algorithm, and combine quantum random numbers and SPHINCS+ signatures to form a unique identification code, breaking the "data island", building a unified data chain, and realizing the correlation integration and collaborative verification of seal-related information. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] Figure 1 This is a flowchart of the steps of the electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes of the present invention.

[0036] Figure 2 This is a diagram of the identification code generation architecture in the present invention.

[0037] Figure 3 This is a flow chart of the double-layer quantum random number extractor model in the present invention.

[0038] Figure 4 This is a combination diagram of the probability dimensions of scene uniqueness in the present invention.

[0039] Figure 5 Schematic diagram of function selection in the multidimensional fusion model of the present invention.

[0040] Figure 6 This is a diagram of a multi-dimensional fusion model with enhanced non-repudiation in the present invention.

[0041] Figure 7 This is a structural diagram of the quintuple quantum state density matrix in the present invention. DETAILED DESCRIPTION

[0042] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0043] Example:

[0044] refer to Figures 1 to 7 As shown, a method for verifying an electronic seal based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes is disclosed, comprising the following steps:

[0045] S1. The user submits a seal application on the seal system;

[0046] S2. Reviewers review the application;

[0047] S3. After passing the review, the user will verify their identity and materials at the device;

[0048] S4. After verification is passed, the stamping instruction is triggered;

[0049] S5, QRNG generates quantum random numbers;

[0050] S6. Calculate the hash value using SHA-3 based on the hash of the printed content, quantum random number, and spatiotemporal characteristics to obtain a fixed-length digest;

[0051] S7. Generate a SPHINCS+ key pair and sign the unique digest using the private key to obtain a unique identification code;

[0052] S8. Simultaneously inject the quantum random number into the HSM module of the terminal device and save the public key;

[0053] S9. The unique identification code is uploaded to the chain and the hash value of the certificate is returned;

[0054] S10. The device first prints the hash value of the evidence at the location to be stamped, and then stamps it;

[0055] S11. Verify using the SPHINCS+ quantum-resistant algorithm.

[0056] In the present invention, S1-S3 is the seal preparation process, S4-S9 is the signature and evidence storage process, S10 is the stamping process, and S11 is the verification process.

[0057] Specifically, S1-S3: The preparation process includes application submission, review and verification.

[0058] Users submitting applications through the seal system are required to upload photos of the stamped materials and document information. The reviewer will review the application within the system to confirm the legitimacy and rationality of the information. Upon approval, the system will notify the user. After receiving the approval notification, the user proceeds to the terminal device for identity verification (facial verification, seal system code scanning, etc.). Dual cameras capture the materials and the user, respectively, to verify that the materials are consistent with those uploaded during the application and that the user is the same as the applicant.

[0059] S4-S9: Signature and evidence storage process.

[0060] First, a quantum random number is generated using a QRNG (quantum random number generator). This quantum random number is then combined with the seal's contents (including the user, file name, and seal's unique ID), timestamp, and geolocation. The hash value is calculated using SHA-3 (Keccak) to produce a fixed-length digest. A SPHINCS+ key pair is then generated. The SHA-3 (Keccak) hash value is then SPHINCS+-resistantly signed using the private key, generating a unique signature data, or unique identification code. The quantum random number is then injected into the terminal device's HSM module, and the public key is stored. After signing, the data is written to the blockchain for evidence storage, and the evidence hash value is returned.

[0061] S10: Stamping process: The device first prints out the hash value of the evidence at the place to be stamped. The hash value is used to track the unique identification code, and finally stamps it.

[0062] S11: Verification process. When the legitimacy of the signature record needs to be verified, the SHA-3 (Keccak) hash algorithm is applied to the message to be verified, combined with the pre-injected quantum random number, to generate a fixed-length message digest. This step is consistent with the "Calculate hash value using SHA-3" step in S6 of the encryption process, ensuring that the hash algorithm and input data fully match. Layer by layer, the path information in the signature is checked to see if it can be deduced from the hash value of the leaf node to the top layer. If the derived top-level hash matches the top-level root hash in the public key, verification is successful.

[0063] refer to Figure 2 As shown in the figure, the identification code is nested through four layers of technology: quantum randomness injection, multi-source data binding, quantum-resistant encryption, and blockchain evidence storage, forming a dynamic security system of "one key, one chain at a time". Its generation process can be broken down into five core links: quantum entropy source initialization, multi-source data anchoring, quantum hash mixing, quantum-resistant signature, and quantum signature and blockchain evidence storage.

[0064] In step S11, the verification process is broken down into quantum entropy source initialization, multi-source data anchoring, quantum hash mixing, quantum-resistant signature, quantum signature and blockchain evidence storage.

[0065] Specifically, the quantum entropy source initialization includes extending the single photon polarization state model to a multi-dimensional scene space based on quantum information theory, and constructing a five-tuple The high-dimensional Hilbert space of each dimension is constructed through tensor product of quantum states to form a composite system state space, and its density matrix is ​​expressed as: ;in, Represents the quantum state density matrix of a multidimensional composite system, describing the overall state composed of multiple subsystems, is the direct product symbol, which is used to combine the states of multiple subsystems into the state of a composite system. No. The pure state density matrix of the subsystem is is the quantum state vector of the subsystem, is its conjugate transpose, where , Represents user, seal, file, time, and location respectively. That is, the probability amplitude, satisfying ,refer to Figure 7 As shown, the main diagonal: the reduced density matrix of each subsystem , describing the quantum state of independent dimensions, non-diagonal elements: the correlation matrix between subsystems , describing the quantum coupling or classical correlation between dimensions. When , the composite system degenerates into an uncorrelated product state; According to Holevo's theorem, the quantum random number source With external systems The classical mutual information upper bound is: ;in Quantum random number source With external systems The classical mutual information between for and The joint density matrix of for The conditional density matrix of is the corresponding probability, To describe the upper limit of classical information carried by a quantum state, Is the external system The deviation, is the entropy of the quantum state, which measures the uncertainty or information content of the quantum state and is defined as , for an ideal QRNG, the output random number and Completely independent, mutual information , meeting the unpredictability of information-theoretic security. In actual systems, real-time monitoring is performed through quantum entropy evaluation protocols. , for a two-level system to ensure The minimum value close to zero represents the upper limit of information leakage allowed, ensuring the high entropy security of random numbers. A two-layer extractor model is used, namely physical layer extraction and logical layer enhancement, in which physical layer extraction includes the use of dimension matrix Quantum measurement time series data Perform a linear transformation, satisfy and ; ,in The original quantum measurement data, i.e. dimensional binary sequence, for dimension matrix, The initial random number sequence extracted from the physical layer is used to improve the linear independence of the sequence through the full rank matrix to ensure the minimum entropy , using the full rank property of the matrix to maximize linear independence and ensure the minimum entropy of the initial sequence ;Logic layer enhancements include the introduction of dynamic keys of Counter Mode Pair Obfuscation yields: ,in Indicates the initial random number extracted by the physical layer, through The matrix operation is used to process the original quantum measurement data to obtain: It represents the final generated quantum random number, which is a secure random number output after double-layer processing at the physical layer and the logical layer. To increment the counter, the key Each generation Bit updated once, Represents an exclusive OR operation, which is used to combine the initial random number with The encryption result is obfuscated to enhance unpredictability. Represents the concatenation operator, which concatenates the counter value with the initial random number after padding. The input data, Fill function, Fill to Block size, ensure the input length is legal; after double-layer processing, output random number With external systems The mutual information satisfies: ,in, is a random number With external systems The classical mutual information between is the upper limit of the mutual information security boundary, for Matrix output dimensions, is the original quantum measurement dimension, is the number of queries during the key update cycle, The time complexity of the side channel attack; constructing the post-processing density matrix is: ,in and They are conversion channels for the physical layer and the logical layer respectively.

[0066] in, Indicates channel composition, that is, physical layer transformation is performed first Then perform the logical layer transformation , The post-processing random number density matrix describes the final output state after double-layer extraction. If it is a classical random number (no quantum correlation), it is a diagonal matrix with an entropy rate close to that of an ideal random number. This is the linear dimensionality reduction and decorrelation operation of the physical layer. It removes redundancy (such as the correlation of adjacent bits) in the original sequence through the full rank matrix and improves the initial entropy quality. It corresponds to the "matrix operation" module in the flowchart. For the encryption obfuscation operation at the logic layer, the pseudo-randomness of AES and dynamic keys are used to convert the initial sequence into an unpredictable final random number to resist side-channel attacks.

[0067] The multi-source data anchoring includes the formal definition of data dimensions, multi-dimensional fusion model and dynamic weight allocation; the formal definition of data dimensions includes defining the five-tuple scene space ,in, (user space, base , 128 bits is a commonly used security boundary in cryptography, balancing storage cost and uniqueness requirements.) (Seal space, cardinality , using 64-bit integers to identify seals, which is sufficient to support the seal management needs of ultra-large organizations). (File hash space, base , 256-bit hash meets the "collision resistance" requirement in cryptography and is the standard configuration for scenarios such as blockchain and digital signatures). (time, space, precision , number of samples per day Record the usage time with millisecond timestamp). (geographic location space, accuracy 0.00001∘≈1m, global sample number , based on latitude and longitude coordinates, with an accuracy of 0.00001° (about 1 meter, GPS civilian accuracy).

[0068] The probability of scene uniqueness is the product of the independent probabilities of each dimension: ; The multidimensional fusion model includes five-tuple scene space Based on this, a multi-dimensional function association layer is introduced, including data preprocessing, unified linearization model, weight calculation and function selection. Data preprocessing includes hash value security conversion: , converting the hash value / integer into interval, avoid zero values, take logarithmic compression of numerical range, improve numerical stability, normalize the dimensions, , unify the data of each dimension into or interval, eliminating the dimension effect, where (power function linearization), (product term splitting), (after logarithmic transformation of exponential function), (longitude + latitude) (trigonometric functions are used directly).

[0069] The unified linearization model includes substituting the function into the original formula and linearizing it to obtain ; Weight calculation includes using the least squares formula ,in is the linearized multidimensional data matrix , For the legal hash value benchmark (history of blockchain evidence ), The optimal weight vector obtained by least squares optimization, whose elements The weight coefficients corresponding to each dimension of data.

[0070] Optimize through training data , so that the predicted value and The error is minimized; the dynamic weight allocation includes defining a weight matrix ,in Indicates the importance of the corresponding dimension, and the weight update rule is (Based on the error feedback mechanism, automatically adjust the weight of each dimension), input the weighted multidimensional data into Hash to get: ,If a dimension of data is tampered, the weight coefficient will amplify its impact on the ,overall hash value, and improve the sensitivity of tampering detection.

[0071] The quantum hash mixing includes quantum random Under the model, The collision resistance of can be proved by the quantum birthday attack lower bound: , which represents the quantum random Attackers under the model, QROM is a quantum extension of the classic random oracle model, which is used to analyze the difficulty of quantum algorithms attacking hash functions. The number of quantum queries performed by the attacker, that is, the number of query operations initiated by the attacker to the hash function through the quantum algorithm, is the output length of the hash function, traditional The anti-collision probability is , combined with the quantum random number injected by QRNG Equivalent to double hashing, the actual collision probability is further reduced to: , reaching the quantum security level; using the time-varying quantum salt value protocol: ,in It is a time-varying quantum random number, which is dynamically generated with the system clock period t and serves as the dynamic salt value of the hash function. One-time quantum key, a random seed dynamically generated by quantum key distribution, is used to initialize the random number generation process of QRNG. A hash function is used to convert time t into a fixed-length hash value, where t is the system clock cycle, representing the current time slice (such as milliseconds or finer-grained time units). An XOR operation is used to confuse the quantum key with the time hash value to generate the input seed of the QRNG. The protocol ensures time correlation: when , forward security, even if the Seed is leaked, it cannot be deduced of , backward security, cannot be passed Reverse of .

[0072] Through this model, the dynamics of the hash function is improved from changing once per use to changing once per clock cycle.

[0073] The quantum-resistant signature Including the formal verification of hierarchical signatures and dynamic key generation protocol, where the formal verification of hierarchical signatures includes defining the Merkle tree verification path as ,in is the tree height, the verification algorithm can be expressed as: ,in, Represents a signature verification function, which takes as input the hash value to be verified, the Merkle tree verification path, and the root public key, and outputs the verification result. Represents the hash value of the message to be verified, Verify the path for the Merkle tree , To verify the path Hash values ​​are used to calculate the root hash layer by layer. is the root public key, It is an iterative hash function that performs The hash operation simulates the layer-by-layer construction process of the Merkle tree. Under the quantum computing model, the overall security level is determined by WOTS+one-time signature, reaching , meeting the requirements of quantum security; the dynamic key generation protocol includes the adaptive SPHINCS+ scheme: ,in is the public key, with time slices The dynamically updated public key corresponds to the root hash of the Merkle tree. is the private key, with time slice Dynamically updated private keys, including the private key fragment and path information of the Merkle tree, Key pair generation function, input parameters, is the key length, For the timestamp parameter, a one-time auxiliary random number is introduced when signing get: ,in For signature data, for time slice The generated unique signature includes the hash value, verification path and random factor. It is a one-time auxiliary random number. It is a random number generated each time a signature is signed. It ensures that the signatures of the same message in different time slices are different, thus avoiding duplicate signature attacks.

[0074] This scheme satisfies forward security (Forward Security): even if the current private key is leaked, historical signatures cannot be forged; it also satisfies backward security (Backward Security): the current private key cannot be derived from the historical public key.

[0075] The quantum signature and blockchain evidence storage include the quantum cryptography design of the hardware security module and the quantum-resistant consensus protocol of the blockchain evidence storage. The quantum cryptography design of the hardware security module includes the construction of a quantum security hardware layer, specifically quantum key injection, using quantum key distribution, i.e. Generate symmetric keys ,for , It is the symmetric key stored in HSM, used to encrypt the key data of the electronic seal. Key extraction function based on quantum key distribution, from quantum random number and Generated one-time initial key Extract the security key from the quantum state; quantum state destruction uses the principle of quantum decoherence to make the stored quantum state Degenerates into a mixed state ,in is the quantum state density matrix after destruction, describing the result of the stored quantum state degenerating into a mixed state. For the A pure state projection operator represents the random state that the quantum state may be in after it is destroyed. The quantum state is The probability amplitude satisfies the probability normalization condition , ensuring that physical irreversibility is achieved; integrating the triple mechanisms of quantum hashing, SPHINCS+ signature, and blockchain evidence storage to build a cascade security model: , where the quantum hash collision probability is , the SPHINCS+ signature collision probability is , the probability of blockchain evidence collision is , the total collision probability is , compared with traditional electronic seals , security strength improved times; the quantum-resistant consensus protocol of the blockchain evidence storage includes the design of the quantum workload proof mechanism, namely QPoW: , where Nonce is the random number in the proof of work, and the value that meets the conditions is found through iterative calculation, so that the hash result is less than the target value Target, To find the minimum value that makes the expression valid Value, that is, the process of finding a valid Nonce, It is the quantum dynamic identification code, which is the unique identification code generated by the electronic seal, containing multidimensional data and quantum random numbers. It is the hash value of the previous block, ensuring the chain continuity and immutability of the blockchain. It is a temporary random number variable, which is concatenated with other parameters as the input of SHA-3. Target is the dynamically adjusted difficulty value. Under quantum computing, the cracking complexity of QPoW is , combined with 256-bit SHA-3, it can meet quantum security requirements. Combined with the chain structure of the blockchain, the chain structure of the blockchain and the quantum-resistant hash ensure that it cannot be tampered with: , is the quantum state vector, and represent the original quantum state, is the initial auxiliary quantum state, Unitary transformation Acting on the original state and auxiliary state The joint system, is the target state after tampering, indicating that the attacker attempts to Copy and modify to duplicate state.

[0076] In summary, the present invention has the following characteristics:

[0077] Enhanced identity verification: Through multiple verification mechanisms such as facial recognition, fingerprint scanning and ID card scanning, a multi-level identity verification system has been established, which significantly improves the accuracy and security of identity verification, effectively resists the risk of identity fraud, and ensures the consistency of the user and applicant's identity.

[0078] Trusted evidence storage for the entire process: With the help of blockchain technology, key data of the seal-using process is stored on the chain. The blockchain's tamper-proof and traceable characteristics solve the problem of traditional centralized databases being easily tampered with and lost, and realize trusted evidence storage for the entire seal-using process, ensuring data integrity and evidence effectiveness.

[0079] Improved anti-quantum attack capabilities: The SPHINCS+ quantum-resistant signature algorithm is used to replace traditional RSA, ECDSA and other algorithms, which can resist the threat of quantum computing attacks, meet the long-term trust needs of fields with high security requirements such as finance, and extend the security life cycle of electronic seals.

[0080] Dynamic randomness enhancement: QRNG (quantum random number generator) is introduced to generate true random numbers. Compared with traditional pseudo-random number generators, its randomness is not restricted by the algorithm, which greatly improves the unpredictability of random numbers, effectively resists prediction attacks, and enhances the security and reliability of the electronic seal generation and verification process.

[0081] Multi-dimensional data fusion: Integrate multi-dimensional data such as user information, file content, seal unique ID, time and space information, generate a fixed-length summary through the SHA-3 hash algorithm, and combine quantum random numbers and SPHINCS+ signatures to form a unique identification code, breaking the "data island", building a unified data chain, and realizing the correlation integration and collaborative verification of seal-related information.

[0082] Although the present invention has been described herein with reference to a number of illustrative embodiments thereof, it will be understood that numerous other modifications and implementations may be devised by those skilled in the art that fall within the scope and spirit of the principles disclosed herein. More specifically, within the scope of the present disclosure, the drawings, and the claims, numerous variations and modifications may be made to the components and / or layout of the subject combination arrangement. In addition to variations and modifications to the components and / or layout, other uses will also be apparent to those skilled in the art.

Claims

1. A method for verifying electronic seals based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes, characterized in that: The following steps are involved: S1. The user submits a seal application on the seal system; S2. The reviewer reviews the application; S3. After the review is passed, the user verifies his identity and materials at the device; S4. After the verification is passed, the seal instruction is triggered; S5. QRNG generates a quantum random number; S6. Based on the seal content hash, quantum random number, and spatiotemporal characteristics, SHA-3 is used to calculate the hash value to obtain a fixed-length summary; S7. A SPHINCS+ key pair is generated, and the unique summary is signed with the private key to obtain a unique identification code; S8. At the same time, the quantum random number is injected into the HSM module of the terminal device, and the public key is saved; S 9. The unique identification code is uploaded to the chain and the hash value of the certificate is returned; S10. The device prints the hash value of the certificate at the place to be stamped and then stamps it; S11. Verification is performed using the SPHINCS+ anti-quantum algorithm. The verification process includes quantum entropy source initialization, multi-source data anchoring, quantum hash mixing, anti-quantum signature, quantum signature and blockchain evidence. The quantum entropy source initialization includes the expansion of the single photon polarization state model to a multi-dimensional scene space based on quantum information theory. Multi-source data anchoring includes the formal definition of data dimensions, multi-dimensional fusion model and dynamic weight allocation. Quantum hash mixing includes quantum randomness. Under the model, The collision resistance of the quantum birthday attack can be proved by the lower bound, and the quantum signature resistance It includes formal verification of layered signatures and dynamic key generation protocols. Quantum signatures and blockchain evidence storage include quantum cryptography design of hardware security modules and quantum-resistant consensus protocols for blockchain evidence storage.

2. The electronic seal verification method based on quantum true random numbers and quantum-resistant multidimensional dynamic codes according to claim 1 is characterized in that: The quantum entropy source initialization includes expanding the single photon polarization state model to a multi-dimensional scene space based on quantum information theory to construct a five-tuple The high-dimensional Hilbert space of each dimension is constructed through tensor product of quantum states to form a composite system state space, and its density matrix is ​​expressed as: ;in, Represents the quantum state density matrix of a multidimensional composite system, describing the overall state composed of multiple subsystems, is the direct product symbol, which is used to combine the states of multiple subsystems into the state of a composite system. No. The pure state density matrix of the subsystem is is the quantum state vector of the subsystem, is its conjugate transpose, where , Represents user, seal, file, time, and location respectively. That is, the probability amplitude, satisfying ; According to Holevo's theorem, quantum random number source With external systems The classical mutual information upper bound is: ;in Quantum random number source With external systems The classical mutual information between for and The joint density matrix of for The conditional density matrix of is the corresponding probability, To describe the upper limit of classical information carried by a quantum state, Is the external system The deviation, is the entropy of the quantum state, which measures the uncertainty or information content of the quantum state and is defined as ; A two-layer extractor model is used, namely physical layer extraction and logical layer enhancement, where physical layer extraction includes using dimension matrix Quantum measurement time series data Perform a linear transformation, satisfy and ; ,in The original quantum measurement data, i.e. dimensional binary sequence, for dimension matrix, Initial random number sequence extracted for the physical layer; logical layer enhancements include the introduction of dynamic keys of Counter Mode Pair Obfuscation yields: ,in Indicates the initial random number extracted by the physical layer, through The matrix operation is used to process the original quantum measurement data to obtain: It represents the final generated quantum random number, which is a secure random number output after double-layer processing at the physical layer and the logical layer. To increment the counter, the key Each generation Bit updated once, Represents an exclusive OR operation, which is used to combine the initial random number with The encryption result is obfuscated to enhance unpredictability. Represents the concatenation operator, which concatenates the counter value with the initial random number after padding. The input data, Fill function, Fill to Block size, ensure the input length is legal; after double-layer processing, output random number With external systems The mutual information satisfies: ,in, is a random number With external systems The classical mutual information between is the upper limit of the mutual information security boundary, for Matrix output dimensions, is the original quantum measurement dimension, is the number of queries during the key update cycle, The time complexity of the side channel attack; constructing the post-processing density matrix is: ,in and They are conversion channels for the physical layer and the logical layer respectively.

3. The electronic seal verification method based on quantum true random numbers and quantum-resistant multidimensional dynamic codes according to claim 2 is characterized in that: The multi-source data anchoring includes the formal definition of data dimensions, multi-dimensional fusion model and dynamic weight allocation; the formal definition of data dimensions includes defining the five-tuple scene space , the probability of scene uniqueness is the product of the independent probabilities of each dimension: ; The multidimensional fusion model includes a five-tuple scene space Based on this, a multi-dimensional function association layer is introduced, including data preprocessing, unified linearization model, weight calculation and function selection. Data preprocessing includes hash value security conversion: , converting the hash value / integer into interval, avoid zero values, take logarithmic compression of numerical range, improve numerical stability, normalize the dimensions, , unify the data of each dimension into or interval, eliminating the dimension effect; the unified linearization model includes substituting the function into the original formula and linearizing it to obtain ; Weight calculation includes using the least squares formula , optimized by training data , so that the predicted value and The error is minimized; the dynamic weight allocation includes defining a weight matrix ,in Indicates the importance of the corresponding dimension, and the weight update rule is , input the weighted multidimensional data into Hash to get: ,If a dimension of data is tampered, the weight coefficient will amplify its impact on the ,overall hash value, and improve the sensitivity of tampering detection.

4. The electronic seal verification method based on quantum true random numbers and quantum-resistant multidimensional dynamic codes according to claim 2 is characterized in that: The quantum hash mixing includes quantum random Under the model, The collision resistance of can be proved by the quantum birthday attack lower bound: , which represents the quantum random The attacker in the model, The number of quantum queries performed by the attacker, is the output length of the hash function, traditional The anti-collision probability is , combined with the quantum random number injected by QRNG Equivalent to double hashing, the actual collision probability is further reduced to: ; Using the time-varying quantum salt value protocol: ,Through this model, the dynamics of the hash function is improved from one change per use to one change per clock cycle.

5. The electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes according to claim 3 is characterized in that: The quantum-resistant signature Including the formal verification of hierarchical signatures and dynamic key generation protocol, where the formal verification of hierarchical signatures includes defining the Merkle tree verification path as ,in is the tree height, the verification algorithm can be expressed as: ,in, Represents a signature verification function, which takes as input the hash value to be verified, the Merkle tree verification path, and the root public key, and outputs the verification result. Represents the hash value of the message to be verified, Verify the path for the Merkle tree , To verify the path Hash values ​​are used to calculate the root hash layer by layer. is the root public key, It is an iterative hash function that performs The hash operation simulates the layer-by-layer construction process of the Merkle tree. Under the quantum computing model, the overall security level is determined by WOTS+one-time signature, reaching , meeting the requirements of quantum security; the dynamic key generation protocol includes the adaptive SPHINCS+ scheme: ,in is the public key, with time slices The dynamically updated public key corresponds to the root hash of the Merkle tree. is the private key, with time slice Dynamically updated private keys, including the private key fragment and path information of the Merkle tree, Key pair generation function, input parameters, is the key length, For the timestamp parameter, a one-time auxiliary random number is introduced when signing get: ,in For signature data, for time slice The generated unique signature includes the hash value, verification path and random factor. It is a one-time auxiliary random number. It is a random number generated each time a signature is signed. It ensures that the signatures of the same message in different time slices are different, thus avoiding duplicate signature attacks.

6. The electronic seal verification method based on quantum true random numbers and quantum-resistant multi-dimensional dynamic codes according to claim 2 is characterized in that: The quantum signature and blockchain evidence storage include the quantum cryptography design of the hardware security module and the quantum-resistant consensus protocol of the blockchain evidence storage. The quantum cryptography design of the hardware security module includes the construction of a quantum security hardware layer, specifically quantum key injection, using quantum key distribution, i.e. Generate symmetric keys ,for , It is the symmetric key stored in HSM and is used to encrypt the key data of the electronic seal. Key extraction function based on quantum key distribution, from quantum random number and Generated one-time initial key Extract the security key from the quantum state; quantum state destruction uses the principle of quantum decoherence to make the stored quantum state Degenerates into a mixed state ,in is the quantum state density matrix after destruction, describing the result of the stored quantum state degenerating into a mixed state. For the A pure state projection operator represents the random state that the quantum state may be in after it is destroyed. The quantum state is The probability amplitude satisfies the probability normalization condition ; Integrate the triple mechanisms of quantum hashing, SPHINCS + signature, and blockchain evidence storage to build a cascade security model: , where the quantum hash collision probability is , the SPHINCS+ signature collision probability is , the probability of blockchain evidence collision is , the total collision probability is The quantum-resistant consensus protocol for blockchain evidence storage includes the design of a quantum proof-of-work (QPoW) mechanism: , where Nonce is the random number in the proof of work, and the value that meets the conditions is found through iterative calculation, so that the hash result is less than the target value Target, To find the minimum value that makes the expression valid Value, that is, the process of finding a valid Nonce, It is the quantum dynamic identification code, which is the unique identification code generated by the electronic seal, containing multidimensional data and quantum random numbers. It is the hash value of the previous block, ensuring the chain continuity and immutability of the blockchain. is a temporary random number variable, which is concatenated with other parameters as the input of SHA-3. Target is the dynamically adjusted difficulty value. Under quantum computing, the cracking complexity of QPoW is , combined with 256-bit SHA-3 to meet quantum security requirements, combined with the chain structure of the blockchain, to ensure that the chain structure of the blockchain and quantum-resistant hashing ensure immutability: , is the quantum state vector, and represent the original quantum state, is the initial auxiliary quantum state, Unitary transformation Acting on the original state and auxiliary state The joint system, is the target state after tampering, indicating that the attacker attempts to Copy and modify to duplicate state.

Images