Cross-platform electronic signature verification system and method based on national secret and quantum-resistant algorithm

Abstract

The application discloses a cross-platform electronic signature verification system and method based on a national secret and an anti-quantum algorithm, and relates to the technical field of data security; the technical points are as follows: obtaining an electronic document to be verified and corresponding composite signature data; the remaining byte sequence obtained by removing the initial byte sequence in the composite signature data is defined as an anti-quantum signature component; a national secret hash algorithm is used to process the electronic document to be verified to generate a hash digest; a national secret check value is restored; whether the national secret check value and the hash digest are consistent is compared, and when the comparison result is consistent, a local verification instruction is triggered; a polynomial index sequence is generated; a lattice polynomial segment is extracted from the anti-quantum signature component according to the polynomial index sequence; a matrix module mapping is performed on the lattice polynomial segment according to a preset anti-quantum verification matrix, and a polynomial verification characteristic value is obtained; a verification result is generated and output based on the numerical comparison state of the polynomial verification characteristic value; and the application improves the security of cross-terminal electronic signature verification.

Description

Technical Field

[0001] This invention relates to the field of data security technology, specifically to a cross-platform electronic signature verification system and method based on national cryptographic standards and quantum-resistant algorithms. Background Technology

[0002] In cross-platform business scenarios such as government collaboration, financial contracts, and supply chain circulation, electronic signatures are a key technical means to verify the authenticity of the source and integrity of electronic documents. With the development of quantum computing technology, traditional public-key cryptography algorithms face the risk of being cracked. In order to balance the compliance of the current national cryptographic standards with quantum-resistant security, current electronic signature systems generally adopt a hybrid cryptographic architecture to generate composite signature data containing national cryptographic signatures and quantum-resistant lattice signatures. In the related technologies for performing electronic signature verification, after the receiving device obtains the electronic document to be verified and the composite signature data, it usually starts two parallel parsing processes. The receiving device allocates a first storage block in memory to load and run the national cryptographic hash function and elliptic curve verification algorithm to compare the national cryptographic signature. At the same time, the receiving device allocates a second storage block in memory to load the full verification matrix contained in the quantum-resistant public key and the large-size quantum-resistant lattice polynomial signature file into the stack, and performs quantum-resistant signature comparison through continuous matrix multiplication and polynomial division. Finally, when the two comparisons are consistent, the verification status is output as passed.

[0003] The aforementioned technologies have serious technical defects in cross-platform application scenarios: the data volume of quantum-resistant lattice polynomial signatures and their corresponding full verification matrices is huge. When verification is performed on cross-platform micro devices with limited memory resources and processor clock speeds, such as low-power IoT nodes and mobile handheld terminals, directly reading the huge quantum-resistant signature file and full verification matrix into memory and performing large-scale high-order polynomial matrix operations can easily exceed the device's 10KB random access memory limit, leading to serious memory overflow, causing system thread blocking or even kernel crashes, resulting in high verification parsing latency and extremely high cross-platform verification failure rate. Summary of the Invention

[0004] To achieve the above objectives, the present invention provides the following technical solution: Cross-platform electronic signature verification methods based on national cryptographic standards and quantum-resistant algorithms include: Obtain the electronic document to be verified and its corresponding composite signature data; Read the format identifier in the header of the composite signature data; parse the total byte length and segmentation offset of the composite signature data based on the format identifier; extract the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; define the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component; The national cryptographic hash algorithm is used to process the electronic documents to be verified and generate hash digests. Based on the pre-stored national cryptographic public key, perform elliptic curve scalar processing on the national cryptographic signature component to recover the national cryptographic verification value; The system compares the national cryptographic verification value with the hash digest to see if they match. If the comparison result is consistent, a local verification command is triggered. In response to the local verification command, the hash digest is used as a random number seed input to the sampling function to generate a polynomial index sequence; Lattice polynomial fragments are extracted from quantum-resistant signature components based on the polynomial index sequence; Matrix modulo mapping is performed on the lattice polynomial fragments based on a pre-set quantum-resistant verification matrix to obtain polynomial verification eigenvalues; The verification results are generated and output based on the numerical comparison of polynomial verification feature values.

[0005] Furthermore, the national cryptographic hash algorithm is used to process the electronic document to be verified to generate a hash digest, including: Convert the electronic document to be verified into an initial bitstream; Get the bit length of the initial bit stream; A single-bit logic high level is appended to the end of the initial bit stream; the current bit length after appending the logic high level is moduloed by a specified value to obtain a difference parameter, which is the number of bits required to supplement the current bit length for group alignment; Append a logic low level to the end of the current bit stream with a number of bits equal to the difference parameter; convert the original bit length of the initial bit stream into a 64-bit binary string and append it to the end of the current bit stream to generate a message packet set; The preset initial linking variable is invoked to perform an iterative compression operation on the message group set, generating a hash digest.

[0006] Furthermore, based on the pre-stored national cryptographic public key, elliptic curve scalar processing is performed on the national cryptographic signature component, including: The base point parameters are parsed based on the pre-stored national cryptographic public key; Extract the signature integer coordinate pair based on the national cryptographic signature component; Convert the hash digest into an integer scalar; Perform point addition and point multiplication operations based on integer scalars and base point parameters to generate reference coordinate pairs; convert the reference coordinate pairs into national cryptographic verification values.

[0007] Furthermore, generating a polynomial index sequence includes: Obtain the highest order of the pre-set quantum-resistant verification matrix; The low-order bits of the hash digest are extracted and converted into the initial state variables of the pseudo-random generator; Run the pseudo-random generator to output a set of non-repeating integers; Elements with values ​​greater than the highest order in the set of integers are removed to obtain a polynomial index sequence.

[0008] Furthermore, matrix modulo mapping is performed on the lattice polynomial fragments based on a pre-set quantum-resistant verification matrix, including: Extract the corresponding sparse submatrix from the quantum-resistant verification matrix based on the polynomial index sequence; Convert lattice polynomial fragments into vector form; Perform matrix processing on lattice polynomial fragments in vector form and sparse submatrices; The matrix processing result is subjected to polynomial modulo reduction to generate check loop elements as the input source for numerical comparison status.

[0009] Furthermore, reference coordinate pairs are generated by performing point addition and doubling operations based on integer scalars and base point parameters, including: Construct a three-dimensional coordinate set by mapping the base point parameters to the Jacobian projected coordinate space; Traverse the binary scalar from high to low according to the binary bit order of the integer scalar; When the traversal reaches the first logical value of the corresponding bit, the projection doubling process is performed on the current three-dimensional coordinate set; When the traversal reaches the second logical value of the corresponding bit, an additional projection point addition operation is performed on the basis of the projection doubling point processing. At the end of the traversal, the output 3D coordinates are converted back to affine coordinates to generate reference coordinate pairs.

[0010] Furthermore, running the pseudo-random generator outputs a set of non-repeating integers, including: Set the multiplier constants and increment constants for linear congruence equations; Substituting the initial state variables as input into the linear congruence equation, we obtain the first pseudo-random number; Obtain the pre-negotiated quantum-resistant public key parameters as perturbation constants; The first output mask is generated based on the first pseudo-random number and the perturbation constant; The first integer is extracted based on the first output mask mapping and placed into the temporary storage array; The first pseudo-random number is substituted into the linear congruence equation as a new input for the next iteration until the total number of values ​​in the temporary array reaches the sampling threshold, thus generating an integer set.

[0011] Furthermore, matrix processing is performed on the vector-form lattice polynomial fragments and sparse submatrices, including: The first rotation factor is invoked to perform a forward number-theoretic transformation on the vector form of the lattice polynomial fragment, which is then converted into a first frequency domain sequence. The second rotation factor is invoked to perform a forward number-theoretic transformation on the sparse submatrix, converting it into a second frequency domain sequence; Perform point-by-point processing on corresponding elements in the first and second frequency domain sequences to obtain the product sequence; The inverse twitch factor is invoked to perform an inverse number-theoretic transformation on the product sequence, generating a polynomial product in the time domain, which is then used as the output of matrix processing.

[0012] Furthermore, when the comparison results are consistent, it also includes: Start the anti-quantum preprocessing thread, use the segmentation offset to directly address the starting physical address of the anti-quantum signature component, and load the anti-quantum signature component into the anti-quantum operation cache through memory mapping without performing data copying; In the quantum-resistant buffer, the decompression and analog-to-digital conversion operations of lattice polynomial fragments are performed synchronously to generate pre-computed intermediate states; The matrix-modulus mapping is executed by calling the pre-computed intermediate state. If the comparison result is inconsistent, the anti-quantum preprocessing thread is terminated and the anti-quantum operation buffer is released.

[0013] A cross-platform electronic signature verification system based on national cryptographic standards and quantum-resistant algorithms includes: The signature data acquisition module acquires the electronic document to be verified and the corresponding composite signature data. The format parsing and segmentation module reads the format identifier from the header of the composite signature data; parses the total byte length and segmentation offset of the composite signature data based on the format identifier; extracts the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; and defines the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component. The digest generation module uses the national cryptographic hash algorithm to process the electronic documents to be verified and generate hash digests. The national cryptographic verification module performs elliptic curve scalar processing on the national cryptographic signature component based on the pre-stored national cryptographic public key to recover the national cryptographic verification value. The logic control and triggering module compares the national cryptographic verification value with the hash digest to see if they match. When the comparison result is consistent, it triggers a local verification command. The index sequence generation module, in response to the local verification command, uses the hash digest as a random number seed to input the sampling function and generates a multinomial index sequence; The feature extraction module extracts lattice polynomial fragments from the quantum-resistant signature components based on the polynomial index sequence. The quantum-resistant mapping module performs matrix-modular mapping on lattice polynomial fragments based on a pre-set quantum-resistant verification matrix to obtain polynomial verification eigenvalues. The results output module generates and outputs the verification results based on the numerical comparison status of the polynomial verification feature values.

[0014] This invention provides a cross-platform electronic signature verification system and method based on national cryptographic standards and quantum-resistant algorithms, which has the following beneficial effects: 1. This invention adopts a component-separated parsing and hierarchical verification architecture for national cryptographic signatures and quantum-resistant lattice signatures. Unlike the current technology's dual-process parallel full-load verification mode, this invention avoids invalid and complex calculations by first completing lightweight national cryptographic compliance verification and then initiating local quantum-resistant fine verification only after the national cryptographic verification is passed. This reduces the computational overhead of routine verification for cross-platform devices. At the same time, it extracts local lattice polynomial fragments by index random sampling and matches sparse sub-matrices to complete matrix modulus mapping verification. This eliminates the need to load a large-size quantum-resistant signature file and a full high-order verification matrix, reducing the problems of insufficient memory limits, memory overflow, and thread blocking in low-power IoT nodes, mobile handheld terminals, and other micro-devices. This reduces verification latency and improves the success rate of signature verification for cross-platform devices. 2. This invention integrates the national cryptographic hash iterative compression, elliptic curve scalar operation, and lattice polynomial matrix modular mapping verification mechanism. It not only strictly adapts to the existing national cryptographic standards, ensuring compliance and document integrity and authenticity verification capabilities in business scenarios such as government affairs, finance, and supply chain, but also compensates for the shortcomings of traditional public key cryptography systems in resisting quantum computing cracking through the lattice quantum-resistant signature mechanism. It achieves dual protection of national cryptographic compliance and quantum-resistant security performance, and improves the long-term security resistance of electronic signatures in complex cross-platform business scenarios. 3. By adding optimization mechanisms such as memory-mapped copy-free loading, preprocessing thread pre-computation of intermediate states, and immediate release of cache in case of exceptions, the memory consumption and time loss caused by data copying are reduced, further improving the computational efficiency of quantum-resistant verification. At the same time, by combining number theory transformation to realize fast matrix operation in the frequency domain, replacing ordinary high-order matrix multiplication and polynomial division in the time domain, the computation time of quantum-resistant verification is compressed, and it is compatible with cross-platform terminal devices with different clock frequencies and memory specifications. Attached Figure Description

[0015] Figure 1 This is a flowchart illustrating the steps of the present invention. Figure 2 This is a system architecture diagram of the present invention. Detailed Implementation

[0016] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0017] Example 1: Please see Figure 1 This embodiment provides a cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms, including the following steps: Step 101: Obtain the electronic document to be verified and its corresponding composite signature data. Specifically, this method is compatible with various cross-platform business devices such as PC terminals, mobile terminals, embedded terminals, and IoT terminals. Each terminal can receive electronic documents to be verified from business systems such as government offices, financial transactions, and supply chain approvals through standardized HTTP, HTTPS, or dedicated intranet interfaces. It supports common compliant document formats such as PDF, OFD, Word, and WPS, adapting to routine business workflow scenarios. The terminal simultaneously obtains the composite signature data uniquely bound to the electronic document to be verified. The composite signature data adopts a standardized binary encapsulation protocol and is divided into two storage modes: embedded encapsulation at the end of the document and external encapsulation of an independent file. It can adapt to the routine transmission and storage needs across devices, systems, and networks. Among them, the composite signature data is an integrated encrypted data that combines the national cryptographic SM2 elliptic curve digital signature and the lattice quantum-resistant digital signature. It adopts a unified header format to complete standardized encapsulation, which can be uniformly parsed by various terminal devices, avoiding signature parsing compatibility errors and data reading anomalies caused by different operating systems and different terminal devices. Step 102: Read the format identifier in the header of the composite signature data; parse the total byte length and segmentation offset of the composite signature data based on the format identifier; extract the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; delineate the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component; specifically, during the encapsulation generation stage, a fixed-length format identifier field is reserved at the beginning of the data. This field stores fixed configuration information such as the signature encapsulation version, encryption algorithm combination type, data segmentation rules, verification protocol identifier, and compatibility parameters, used for cross-platform unified parsing, version verification, and format compliance determination; after the terminal initiates the verification process... The system prioritizes reading the format identifier to verify the legality of the signature format and the validity of the version, eliminating illegally tampered, non-standard encapsulated, and forged signature data. After the format verification is passed, the terminal parses the total byte length parameter and the segmentation offset parameter bound to the format identifier to determine the overall storage size of the composite signature data and the segmentation points of the two types of signature components. Using the segmentation offset of the binary data as the dividing point, a fixed-byte length of binary sequence is truncated forward, and this part of the data is defined as the national cryptographic signature component. The remaining binary data after removing the national cryptographic signature component from the composite signature data is designated as the lattice-based quantum-resistant signature component, completing the non-overlapping and non-omission splitting of the two sets of signature components, providing standardized input data for subsequent hierarchical independent verification. Step 103: Process the electronic document to be verified using the national cryptographic hash algorithm to generate a hash digest. This step follows the national standard GB / T32905-2016 SM3 cryptographic hash algorithm to perform document digest calculation. The specific calculation process is as follows: The terminal reads the complete original binary source code data of the electronic document to be verified, filters out invalid and redundant information such as page rendering parameters, layout format, blank placeholders, and version remarks, and retains only the valid bit data of the core business content of the document, converting the structured document file into a continuous one-dimensional bit stream; according to the fixed calculation process of the SM3 algorithm, first, a padding operation is performed on the end of the one-dimensional bit stream, then the document length information is attached, and the processed... The complete bitstream is divided into fixed-length message blocks of 512 bits each, resulting in multiple equal-length message blocks. Then, the SM3 algorithm is called to initialize the linking variables. For each message block, message expansion, nonlinear iterative transformation, and chained update operations are performed sequentially. The output of the previous block is used as the initial variable for the next block, completing the iterative compression calculation for all blocks. After all block operations are completed, the finally converged linking variables are concatenated to generate a 256-bit fixed-length hash digest. This hash digest possesses avalanche effect and collision resistance properties; any modification to the document's content will change the digest data, making it suitable for characterizing the integrity and originality of electronic documents. Step 104: Perform elliptic curve scalar processing on the national cryptographic signature component based on the pre-stored national cryptographic public key to recover the national cryptographic verification value. Specifically, each cross-platform terminal device locally encrypts and stores the compliant national cryptographic SM2 public key corresponding to the business system, and the public key parameters conform to the national standard SM2 elliptic curve parameter system. The terminal reads the locally pre-stored national cryptographic public key binary data, parses and extracts the complete set of base point parameters such as the horizontal and vertical coordinates of the base points of the standard elliptic curve, the order of the curve, the large prime number of the finite field, the coefficients of the curve equation, and the coordinate mapping rules, and reconstructs a compliant elliptic curve finite field operation space. At the same time, the terminal extracts the integer coordinate pair parameters retained in the signature generation stage from the split national cryptographic signature component according to the preset field offset and field length. The document hash digest generated in step 103 is converted into a standard integer scalar. Combining the elliptic curve base point parameters and the signature integer coordinate pair, scalar multiplication and multi-point accumulation inverse operation are performed in sequence according to the SM2 standard operation rules. The original verification hash value corresponding to the signature is obtained through reverse deduction calculation. This hash value is the national cryptographic verification value used for consistency comparison. Step 105: Compare the national cryptographic verification value with the hash digest. If the comparison result is consistent, a local verification instruction is triggered. Specifically, the terminal uses a bit-by-bit global comparison method to accurately match the generated national cryptographic verification value with the original hash digest of the document. If all bits of the two sets of data correspond completely, it is determined that the electronic document to be verified has not been tampered with, the national cryptographic signature is legal and valid, and the document source is trustworthy. A local verification instruction is triggered, and the subsequent quantum-resistant verification process is started. If any bit does not match, it is determined that the document has been tampered with, the signature is forged, or the signature is invalid. The entire verification process is terminated directly, and quantum-resistant related operations are no longer executed. The verification failure and document abnormality results are output to reduce the terminal's ineffective computing power consumption. Step 106: In response to the local verification command, the hash digest is used as a random number seed input into the sampling function to generate a polynomial index sequence. Specifically, after receiving the local verification command, the terminal uses the unique hash digest of the document generated in step 103 as the initial seed of the pseudo-random generator, replacing the traditional fixed seed sampling method, to ensure that the sampling seeds corresponding to different documents are independent of each other. The initial seed is input into the preset pseudo-random sampling function, and iterative operations, numerical perturbation, duplicate value filtering, legal interval screening, and ordered recombination operations are performed in sequence to obtain a set of uniformly distributed, non-repeating, and irregular numerical sequences. This numerical sequence is defined as a polynomial index sequence, which is used to locate the valid verification fragment within the quantum signature component to realize dynamic local sampling verification. Step 107: Extract lattice polynomial fragments from the quantum-resistant signature component based on the polynomial index sequence. Specifically, the quantum-resistant signature component of this application adopts a multi-segment lattice polynomial segmented splicing and encapsulation structure, which contains multiple sets of independent lattice polynomial fragments with different orders, dimensions, and storage locations. All fragments are stored independently and combined in an ordered manner to form complete quantum-resistant signature data. The terminal locates the polynomial storage area with the corresponding sequence number within the quantum-resistant signature component through precise memory addressing based on the dynamically generated polynomial index sequence, extracts single or multiple lattice polynomial fragments at the corresponding positions, and discards redundant fragments that are not indexed and matched. This sampling method does not require full loading, parsing, and computation of all quantum-resistant signature data, which can reduce terminal memory usage and avoid memory overflow and thread lag issues in low-power devices and older devices. Step 108: Perform matrix-modulus mapping on the lattice polynomial fragments according to the preset quantum-resistant verification matrix to obtain polynomial verification feature values. Specifically, the terminal has a locally preset lightweight optimized lattice quantum-resistant verification matrix. The matrix removes invalid zero-value redundant parameters to adapt to terminal devices with low storage and low computing power. The terminal locates the local sparse submatrix region corresponding to the verification matrix according to the polynomial index sequence, and only retrieves the local submatrix to participate in the operation without loading the full high-order matrix data. The extracted lattice polynomial fragments are normalized into standard operation vectors according to the preset dimension standard to ensure that the vector dimension matches the sparse submatrix dimension perfectly. Then, according to the finite field operation rules, matrix multiplication space transformation, finite field boundary constraints, and polynomial modulus reduction operations are performed to complete the standardization transformation of polynomial features and finally generate polynomial verification feature values ​​used to determine the signature status. Step 109: Generate and output verification results based on the numerical comparison status of polynomial verification feature values; specifically, the system pre-stores standard feature threshold ranges based on compliant signature samples locally to distinguish the feature differences between legitimate and abnormal signatures; the terminal compares the polynomial verification feature values ​​obtained in real time with the preset threshold range: if the feature values ​​fall entirely within the legitimate threshold range, the quantum-resistant signature is determined to be complete, legitimate, and untampered with, and the overall electronic signature verification result is output; if the feature values ​​deviate from the legitimate threshold range and are in the abnormal value range, the quantum-resistant signature is determined to have tampering, forgery, or invalidation issues, and the signature verification result is output, while an abnormal log is recorded and a verification snapshot is retained for subsequent traceability auditing.

[0018] In one implementation, this method adopts a hierarchical serial operation logic of lightweight national cryptographic initial screening plus quantum-resistant fine verification. Only after the low-computing-power national cryptographic verification passes the initial screening, the high-computing-power quantum-resistant verification process is initiated. In case of abnormal scenarios such as document tampering or illegal national cryptographic signatures, the process is quickly terminated, reducing terminal computing power consumption and adapting to various low-power cross-platform terminal devices.

[0019] Through the above technical solution, this application abandons the traditional verification mode of full loading and parallel operation of dual signatures, and adopts a lightweight verification architecture of hierarchical filtering, dynamic sampling and local operation. Through the core logic of accurate splitting of dual signatures, pre-format verification, random fragment sampling and sparse matrix mapping, it solves the problems of cross-platform terminal memory overflow, high verification latency, poor compatibility and high false alarm rate. At the same time, it meets the compliance requirements of national cryptographic algorithms and the anti-quantum cracking capability of grid algorithm, and improves the practicality and stability of cross-scenario verification of electronic signatures.

[0020] In some embodiments, the national cryptographic hash algorithm is used to process the electronic document to be verified to generate a hash digest, including: Step 201: Convert the electronic document to be verified into an initial bitstream. Specifically, the terminal reads the electronic document file to be verified from local storage or network transmission, filters out non-core redundant fields such as file headers, version information, rendering configurations, and layout parameters, and reads the original binary source code corresponding to the core business content of the document. According to the file storage byte order, the discrete binary byte data is parsed bit by bit and continuously spliced ​​to convert the structured document into a one-dimensional continuous, non-redundant, and non-missing initial bitstream, completely preserving the document's valid business data. Step 202: Obtain the bit length of the initial bit stream; specifically, perform global statistics on the converted initial bit stream to accurately calculate the total number of bits in the initial bit stream, and cache this value as the original document length parameter; this parameter is used for subsequent bit padding difference calculation, message group alignment, and document length traceability verification to ensure the standardization of the SM3 hash algorithm grouping operation; Step 203: Append a single high-level logic bit to the end of the initial bit stream; specifically, append a single binary value of 1 to the last bit of the initial bit stream; this step is used to mark the end boundary of the valid document bit stream, distinguish the valid data area from the subsequent padding area, and avoid parsing ambiguity and hash collision problems caused by all-zero bits at the end of the document. Step 204: Generate the current length of the initial bit stream after appending logic high levels, and the difference parameter obtained by modulo a specified value. The specific calculation process is as follows: According to the SM3 algorithm standard, the fixed group modulus is set to 512 bits; the current total bit length L of the bit stream after appending logic high levels is counted, and a 512-bit modulo operation is performed on L to obtain the remainder R. The modulo formula is R=Lmod512; the number of logic low levels that need to be supplemented is calculated using the difference calculation formula D=512-R, and D is used as the difference parameter for subsequent padding operations. Step 205: Continue to append logic low levels equal to the difference number to the end; specifically, according to the difference parameter D calculated in step 204, continuously add D binary 0 bits to the end of the bit stream that has been appended with logic high levels; after the padding is completed, the total length of the bit stream is a multiple of 512 bits, eliminating the problems of group misalignment and operation abnormality caused by irregular length, and ensuring the regularity of subsequent message grouping and cutting. Step 206: Convert the bit length into a 64-bit binary string and append it to the end to generate a message group set; specifically, convert the total length of the original document bit stream cached in step 202 into a 64-bit binary string in big-endian storage format to unify the length parsing rules for multiple terminals and systems; append the 64-bit binary string to the end of the padded bit stream to complete the mounting of the original document length information; finally, using 512 bits as a fixed unit, equally divide the complete bit stream to generate multiple sets of standard message group sets with uniform size and standardized format; Step 207: Call the preset initial linking variables to perform iterative compression operations on the message packet set to generate a hash digest; the specific calculation process is as follows: The terminal locally presets a 256-bit fixed initial linking variable conforming to the SM3 national standard, and the parameters are unified across all terminals; traverse each group of standard message packets in sequence, perform message expansion operations on a single group of message packets, and expand the original 512-bit message packets into a 132-bit intermediate variable sequence; based on the expanded intermediate variables, combine with the initial linking variables to perform multiple rounds of nonlinear iterative transformation and chain update operations, and use the operation result of this round of packets as the initial value of the linking variables for the next group of packets, and cyclically complete the iterative compression of all packets; after all packet operations are completed, the finally converged 256-bit linking variables are directly concatenated to generate a unique national standard hash digest.

[0021] Through the above technical solution, this step follows the national standard for the SM3 hash algorithm, including bit padding, length mounting, message grouping, and iterative compression. The generated hash digest is unique, collision-resistant, and irreversible, accurately representing document integrity and providing reliable data support for subsequent national cryptographic signature verification and quantum-resistant random index generation.

[0022] In some embodiments, elliptic curve scalar processing is performed on the national cryptographic signature component based on a pre-stored national cryptographic public key, including: Step 301: Parse the base point parameters based on the pre-stored national cryptographic public key; specifically, the terminal locally encrypts and stores a compliant and certified national cryptographic SM2 elliptic curve public key file, with parameters conforming to the national commercial cryptography standard; the terminal reads the original binary data of the public key and extracts the core parameters of the elliptic curve, including the x-coordinate G of the standard base point G, using a standard parsing algorithm. x , ordinate G y The parameters include the curve order n, the large prime number p of the finite field, the coefficients a and b of the curve equation, and the modular operation parameters. Based on the complete set of analytical parameters, a compliant elliptic curve finite field operation space is reconstructed, providing a mathematical foundation for subsequent scalar and point operations. Step 302: Extract the signature integer coordinate pair based on the national cryptographic signature component; specifically, the split national cryptographic signature component is packaged and stored according to the national standard format, and the valid point data of the signature generation stage is retained in the fixed field; the terminal extracts the unique corresponding signature integer coordinate pair (r, s) from the binary data of the national cryptographic signature component according to the preset field offset and fixed field length. This coordinate pair is the core parameter of the elliptic curve encryption operation and is used for signature inverse verification deduction. Step 303: Convert the hash digest into an integer scalar; specifically, the 256-bit hash digest binary string generated in step 103 is converted and concatenated byte by byte according to the big-endian byte order rule of the national cryptographic standard to obtain a standardized integer scalar k with no precision loss and no numerical deviation, which serves as the core iterative coefficient for elliptic curve scalar operations. Step 304: Generate reference coordinate pairs by performing point addition and doubling operations based on integer scalars and base point parameters; the specific calculation process is as follows: Based on the SM2 elliptic curve finite field modulo p operation rules, using integer scalar k as the iteration coefficient, and using the standard base point G(G x G y Let ) be the initial operation point; convert the scalar k into a binary bit sequence, traverse it bit by bit from the high bit to the low bit, and perform doubling and point addition operations in sequence: for each bit traversed, first perform doubling iteration operation on the current curve point; if the current bit value is 1, perform an additional multi-point accumulation operation; the entire operation result is modulo p of the large prime number in the finite field to ensure that the operation result converges within the range of legal values ​​of the curve. After completing the full-order scalar mapping fitting, the standard reference coordinate pair (X, Y) for verification is obtained; Step 305: Convert the reference coordinate pair into a national cryptographic verification value. Specifically, the reference coordinate pair (X, Y) obtained by the operation is processed by sequentially concatenating, standardizing and compressing the binary data of the horizontal and vertical coordinates according to the national cryptographic standard bit concatenation rules, and uniformly converting them into 256-bit standard hash format data. The elliptic curve signature inverse operation is then restored to generate a national cryptographic verification value that can be directly compared with the document hash digest.

[0023] Through the above technical solution, this step follows the elliptic curve operation logic of the national cryptographic standard SM2 throughout the entire process. The parameters are traceable, the process is reproducible, and the results are accurate and compliant. It can restore the original verification value of the signature without loss, complete the verification of the legality of the national cryptographic signature and the authenticity of the document source, and ensure the compliance and accuracy of the signature verification.

[0024] In some embodiments, generating a polynomial index sequence includes: Step 401: Obtain the highest order of the preset quantum-resistant verification matrix; specifically, the terminal locally presets the standardized verification matrix corresponding to the lattice quantum-resistant signature, and the matrix configuration parameters preset the highest order of the polynomial N, which is the upper limit of the legal values ​​of the polynomial fragment index; the terminal reads and caches the parameter N, and uses it as the index value filtering threshold to filter out the invalid index values ​​generated later, so as to avoid the operation error caused by the index going out of bounds; Step 402: Extract the low-order bit string of the hash digest and convert it into the initial state variable of the pseudo-random generator; specifically, select the low-order fixed-length bit string of the 256-bit hash digest generated in step 103, and use the strong perturbation of the low-order bit values ​​to improve the disorder of the random sequence; convert the extracted low-order bit string into a decimal integer and use it as the initial state variable seed of the pseudo-random generator. Relying on the characteristic that the hash digest is uniquely bound to the document, it is ensured that the random initial state of each document is different. Step 403: Run the pseudo-random generator to output a set of non-repeating integers; the specific calculation process is as follows: with the initial state variable seed as the starting point of the iteration, start the pseudo-random number loop iteration operation, and generate original random integers round by round through numerical perturbation, random mapping, and chaotic offset mechanism. Each generated integer is compared with the generated values, and duplicate values ​​are automatically removed. Finally, a set of original integers with uniform values, no repetition, and no regularity is output as a candidate set of multinomial indexes. Step 404: Remove elements in the integer set whose values ​​are greater than the highest order to obtain a polynomial index sequence. The specific calculation process is as follows: Using the highest order N obtained in step 401 as the screening threshold, traverse all elements in the candidate integer set one by one, remove out-of-bounds elements whose values ​​are greater than N, and retain valid integers in the interval [0, N]. Sort the filtered valid integers in ascending order and perform secondary deduplication and normalization to generate a standard polynomial index sequence that is formatted correctly, has valid values, and can be directly used for fragment sampling.

[0025] The above technical solution relies on the unique hash digest of the document to drive the generation of dynamic random index, thereby achieving the differentiation of the sampling position of each document and avoiding the security vulnerabilities caused by fixed sampling. The order threshold screening mechanism ensures the legality and validity of the index parameters, providing reliable data support for the subsequent accurate extraction of grid point polynomial fragments and the realization of lightweight verification. In some embodiments, performing matrix modulus mapping on lattice polynomial fragments based on a preset quantum-resistant verification matrix includes: Step 501: Extract the corresponding sparse sub-matrix from the quantum-resistant verification matrix according to the polynomial index sequence; specifically, the quantum-resistant verification matrix is ​​a high-order sparse matrix containing a large number of zero-value invalid weight parameters, with only local regions retaining valid verification parameters; the terminal accurately locates the valid parameter region of the verification matrix according to the row and column coordinates corresponding to the polynomial index sequence, extracts the local sparse sub-matrix of the corresponding dimension and position, retains only this sub-matrix for subsequent calculations, does not load the full matrix data, and reduces the terminal's computing power and memory consumption; Step 502: Convert the lattice polynomial fragment into a vector form; specifically, convert the one-dimensional sequence format lattice polynomial fragment into a standard column vector format by performing dimension regularization, padding invalid empty spaces with zeros, and rearranging the sequence order according to the preset matrix operation dimension standard. This ensures that the dimension of the polynomial vector is completely consistent with the dimension of the sparse submatrix, avoiding operational anomalies caused by dimension misalignment and parameter mismatch. Step 503: Perform matrix processing on the vector form of the lattice polynomial fragment and the sparse submatrix; the specific calculation process is as follows: following the rules of linear algebra matrix operations and the finite field operation specifications of lattice cryptography, the normalized polynomial column vector is used as the operation input, and high-precision matrix multiplication is performed with the sparse submatrix to complete the spatial coupling mapping of polynomial features and matrix weights, realize the deep extraction and dimensional transformation of signature features, and output the intermediate results of matrix coupling operation; Step 504: Perform polynomial modular reduction on the matrix processing result to generate a check ring element as the input source for the numerical comparison state. The specific calculation process is as follows: retrieve the fixed modulus q of the finite field preset by the lattice-resistant quantum cryptography system, perform modular q reduction on the coupling result of the matrix multiplication output element by element, converge all out-of-limit values ​​to the legal value range of [0, q-1], and generate a standardized and uniquely corresponding check ring element. This check ring element completely retains the core features of the signature and provides the input basis for subsequent numerical comparison and signature legality determination.

[0026] By adopting the above technical solution, local sparse submatrix operations are used to replace traditional full high-order matrix operations. Combined with the modular reduction mechanism of finite field polynomials, the terminal computing power and memory overhead are reduced while retaining the quantum cryptography security characteristics, making it suitable for low-power, memory-constrained cross-platform terminal devices.

[0027] In some embodiments, generating reference coordinate pairs by performing point addition and doubling operations based on integer scalars and base point parameters includes: Step 601: Map the base point parameters to the Jacobian projection coordinate space to construct a three-dimensional coordinate set; specifically, to simplify the complex calculations of the finite field of elliptic curves and reduce the number of high-loss multiplication operations, this embodiment maps the base point G(G) of the elliptic curve to the two-dimensional affine coordinate space. x G y The two-dimensional curve iterative calculation is converted into Jacobian three-dimensional projection coordinates (X, Y, Z) through a special projection transformation formula, and a three-dimensional coordinate operation set is constructed. This converts the two-dimensional curve iterative calculation into a three-dimensional projection space calculation, reducing the overall computational complexity. Step 602: Traverse from high to low according to the binary bit order of the integer scalar; specifically, convert the integer scalar k generated in step 303 into a standard binary bit sequence of fixed bit length, and traverse and scan bit by bit in order from high bit to low bit, using the 0 and 1 values ​​of a single bit as the branch judgment condition for the iterative operation. Step 603: When the corresponding bit value is the first logical value during traversal, the projection doubling operation is performed on the current three-dimensional coordinate set. Specifically, in this embodiment, binary bit 1 is set as the first logical value. If the current bit value is detected to be 1 during traversal, the projection space doubling operation is performed on the Jacobian three-dimensional coordinate set that is updated in real time to complete the coordinate scaling mapping of the current level and update the three-dimensional coordinate set parameters. Step 604: When the corresponding bit is the second logical value during traversal, the projection point addition operation is performed on the basis of the projection doubling point processing. Specifically, in this embodiment, binary bit 0 is set as the second logical value. If the current bit value is detected to be 0 during the traversal, the basic projection doubling point iteration operation is completed first, and then the projection space point addition operation is performed to supplement the coordinate offset mapping and match the complete iteration logic corresponding to the scalar binary bit. Step 605: At the end of the traversal, the output three-dimensional coordinates are converted back to the affine coordinate system to generate a reference coordinate pair; specifically, after all binary bits of the integer scalar have been traversed and iterated, the final converged Jacobian three-dimensional projection coordinate result is obtained; the three-dimensional coordinates are converted back to standard two-dimensional affine coordinates through a special inverse projection transformation formula to obtain a standard reference coordinate pair for elliptic curve verification.

[0028] The above technical solution optimizes the elliptic curve iterative operation logic by using Jacobian projection coordinates, reducing the number of complex multiplication operations in finite fields. While adhering to the national cryptographic SM2 operation standard and ensuring unchanged operation accuracy, it improves the operation speed of national cryptographic signature verification and adapts to the real-time verification needs of low-computing-power devices.

[0029] In some embodiments, running a pseudo-random generator outputs a set of non-repeating integers, including: Step 701: Set the multiplier constant and increment constant of the linear congruence equation; Specifically, in this embodiment, the fixed parameters of the linear congruence equation adapted to the grid signature index generation scenario are preset, including the dedicated multiplier constant a, increment constant c and modulus constant m. All parameters are verified for numerical uniformity to ensure that the random number iteration rules are consistent under different terminals and different systems, and to avoid random sequence aggregation and offset problems. Step 702: Substitute the initial state variable as an input into the linear congruence equation to obtain the first pseudo-random number; the specific calculation process is as follows: the linear congruence iteration formula is: X(n+1)=(a×X(n)+c)modm; take the initial state variable seed generated in step 402 as the first round input value X(0), substitute it into the formula to complete the first round of iteration, and calculate the first pseudo-random number X(1); mod m is the modulo operation, m is the fixed modulo constant of the pseudo-random number preset in this embodiment, which is used to constrain the output value range of the pseudo-random number, and uniformly converge all the random values ​​generated by the iteration to [0, Within the interval [m-1]; the overall logic of the formula is as follows: based on the random number X(n) generated in the previous iteration, after linear scaling by the multiplier constant a and offset correction by the increment constant c, and then modulo taking by the modulus constant m, a brand new pseudo-random number X(n+1) is obtained, realizing numerical iterative update; the initial state variable seed generated in step 402 is used as the first round input value X(0), and substituted into the formula to complete the first round iterative operation, and the first pseudo-random number X(1) is calculated; Step 703: Obtain the pre-negotiated quantum-resistant public key parameters as a perturbation constant; specifically, the terminal and the service server synchronize a set of fixed quantum-resistant public key parameters during the key negotiation phase, and solidify the parameters into a random perturbation constant K to break the inherent linear law of linear congruential iteration. Step 704: Generate the first output mask based on the first pseudo-random number and the perturbation constant; the specific calculation process is as follows: Perform a bitwise XOR operation on the first pseudo-random number X(1) generated in the first round and the perturbation constant K. The XOR formula is M1=X(1)⊕K. The linear characteristics of the iterative sequence are broken through the nonlinear operation to generate the first output mask M1; where ⊕ is the binary bitwise XOR operator. The core logic of the formula is: compare the binary bit strings of the first pseudo-random number X(1) and the perturbation constant K bit by bit. Output 0 for the same bit and 1 for different bit, and complete the nonlinear confusion operation; through this nonlinear XOR operation, the disorder and security of the random sequence are improved, and finally the first output mask M1 with high randomness is generated; Step 705: Extract the first integer according to the first output mask mapping and place it into the temporary storage array; specifically, perform numerical normalization mapping, legal interval filtering and integer rounding on the first output mask M1, extract the valid integers within the preset value range, and store them in order into the blank temporary storage array to complete the single round of random data storage. Step 706: Substitute the first pseudo-random number as the new input into the linear congruential equation for the next iteration until the total number of values ​​in the temporary array reaches the sampling threshold, generating an integer set. The specific iteration process is as follows: update the pseudo-random number generated in the current round as the input value for the next iteration, and repeatedly execute the linear congruential iteration, XOR perturbation, valid integer extraction, and deduplication storage operations to continuously expand the data volume of the temporary array. When the number of valid integers without repetition in the array reaches the system's preset sampling threshold, terminate the iteration loop and output a uniformly distributed set of candidate integers without repetition.

[0030] By combining the above technical solutions with efficient linear congruential iterative operations and resistance to nonlinear disturbances of quantum parameters, the predictability of traditional pseudo-random sequences is improved, generating a highly secure set of indexed integers. At the same time, the iterative logic is simple, the computing power is low, and it can run stably on edge terminals.

[0031] In some embodiments, the root performs matrix processing on the lattice polynomial fragment in vector form and the sparse submatrix, including: Step 801: Call the first rotation factor to perform a forward number-theoretical transformation on the vector form of the lattice polynomial fragment, converting it into a first frequency domain sequence. The specific calculation process is as follows: The system presets a first rotation factor that adapts to the current polynomial order and the finite field modulus. This factor is a set of unit root parameters that satisfy the orthogonality property. Taking the time-domain lattice polynomial vector as input, iterates through all dimensions of the vector, combines the first rotation factor, and performs a point-by-point weighted iteration to perform a forward number-theoretical transformation, mapping the time-domain discrete polynomial vector to the frequency domain space, generating a dimensionally regular first frequency domain sequence. The entire process uses finite integer field operations, with no loss of floating-point precision, ensuring that the transformation is reversible and the features are lossless. Step 802: Call the second rotation factor to perform a forward number theory transformation on the sparse submatrix and convert it into a second frequency domain sequence; specifically, call the second rotation factor that is completely consistent with the first rotation factor in terms of order and modulus to ensure that the operation basis is unified and the dimensions are aligned; traverse all row vectors and column vectors of the sparse submatrix, perform a forward number theory transformation only on the non-zero weight positions of the matrix, skip the invalid calculation of zero values, and map the time-domain sparse matrix as a whole to the frequency domain space to obtain the second frequency domain sequence; Step 803: Perform point-by-point processing on corresponding elements in the first and second frequency domain sequences to obtain the product sequence. The specific calculation process is as follows: According to the rule of one-to-one correspondence between the dimensional indices of the frequency domain sequences, traverse the same coordinate elements of the two sets of frequency domain sequences one by one, perform point-by-point multiplication operations, and the operation results converge to the modulus of the finite field. Integrate all results to generate a frequency domain product sequence with the same dimension and resolution as the original sequence. This point-by-point multiplication logic in the frequency domain is equivalent to high-precision convolution in the time domain and can completely preserve the polynomial coupling characteristics. Step 804: Call the inverse rotation factor to perform an inverse number theory transformation on the product sequence to generate a time-domain polynomial product result as the output of matrix processing; specifically, load the preset inverse rotation factor parameter, which is the orthogonal inverse parameter of the forward transformation factor; take the frequency domain product sequence as input, perform a complete inverse number theory transformation iterative operation to restore the frequency domain coupling features to time-domain polynomial product data, complete the complete matrix operation process of vector and sparse submatrix, and output a high-precision, distortion-free time-domain polynomial product result to provide input for subsequent modulo reduction operation.

[0032] The above technical solution uses number theory transformation to replace the traditional high-complexity matrix multiplication in the time domain, and realizes the time domain convolution operation by multiplying point by point in the frequency domain. While ensuring the operation accuracy remains unchanged, the terminal operation time is reduced. Relying on the operation characteristics of integer finite field, the problem of floating-point precision loss is avoided, and the stability and accuracy of verification are guaranteed.

[0033] In some embodiments, when the comparison results are consistent, the method further includes: Step 901: Start the quantum-resistant preprocessing thread. Use the segmentation offset to directly address the starting physical address of the quantum-resistant signature component. Without performing data copying, load the quantum-resistant signature component into the quantum-resistant operation cache through memory mapping. Specifically, after the national cryptographic verification value matches the hash digest and triggers the local verification instruction, the system starts an independent asynchronous quantum-resistant preprocessing thread, which runs decoupled from the main thread. Reuse the segmentation offset parameter obtained in step 102 to directly locate the starting physical address of the quantum-resistant signature component in memory. Map the original signature data directly to the dedicated quantum-resistant operation cache through the memory mapping mechanism, saving the data copying process and reducing computing power and time overhead. Step 902: In the quantum-resistant buffer, the decompression and modular conversion operations of the lattice polynomial fragments are performed synchronously to generate pre-computation intermediate states. Specifically, in the isolated quantum-resistant buffer, two preprocessing operations are performed synchronously and in parallel: first, the compressed and encapsulated lattice polynomial fragments are decompressed without loss to restore the complete original polynomial data; second, the modulus and value format of the polynomial data are unified according to the lattice cryptography finite field standard to generate standardized pre-computation intermediate states, providing ready input data for subsequent matrix modular mapping operations. Step 903: Call the pre-computation intermediate state to execute the matrix-modulus mapping. If the comparison result is inconsistent, terminate the anti-quantum preprocessing thread and release the anti-quantum operation cache. Specifically, after preprocessing, directly call the pre-computation intermediate state in the cache to start the matrix-modulus mapping operation and generate polynomial verification feature values. If the comparison result of the previous national cryptographic verification is inconsistent and the document is judged to be abnormal, the system immediately terminates the anti-quantum preprocessing thread, stops all subsequent operations, and automatically releases the memory resources occupied by the anti-quantum operation cache to avoid invalid resource occupation.

[0034] The above technical solutions shorten the response latency of quantum-resistant verification by optimizing asynchronous thread preprocessing, copyless memory mapping loading, and synchronous pre-computation. At the same time, thread termination and resource release mechanisms are set up for abnormal scenarios to save terminal hardware resources and improve the verification efficiency and resource utilization under all working conditions.

[0035] Example 2: Based on Example 1, this example also provides a cross-platform electronic signature verification system based on national cryptographic and quantum-resistant algorithms, including: a signature data acquisition module, a format parsing and segmentation module, a digest generation module, a national cryptographic verification module, a logic control and triggering module, an index sequence generation module, a feature extraction module, a quantum-resistant mapping module, and a result output module. Each functional module operates independently and works in synergy to achieve hierarchical and lightweight electronic signature verification function. The signature data acquisition module is used to acquire the electronic document to be verified and the corresponding composite signature data. Specifically, this module supports multi-terminal and multi-protocol data interaction. It can acquire electronic documents to be verified in compliant formats such as PDF and OFD through intranet interface, external HTTPS interface, and local file reading method, and simultaneously acquire composite signature data uniquely bound to the document. It is compatible with reading and parsing both embedded and external signature encapsulation formats, providing raw input data for system verification. The format parsing and segmentation module is used to read the format identifier in the header of the composite signature data; parse the total byte length and segmentation offset of the composite signature data based on the format identifier; extract the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; and define the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component. Specifically, this module can complete signature format legality verification, version identification, and accurate data segmentation, identify illegal, tampered, and non-standard signature data, and parse core parameters through the header identifier to achieve lossless and cross-splitting of dual signature components, providing standardized data support for hierarchical verification. The digest generation module is used to process electronic documents to be verified using the national cryptographic hash algorithm to generate hash digests. Specifically, this module strictly follows the national standard of the SM3 algorithm, completes the entire process of document bit stream conversion, padding and alignment, message grouping, and iterative compression, and stably outputs a 256-bit fixed-length hash digest to characterize document integrity, while also providing a seed data source for the generation of random index sequences. The national cryptographic verification module is used to perform elliptic curve scalar processing on the national cryptographic signature component based on the pre-stored national cryptographic public key, and recover the national cryptographic verification value. Specifically, the module has built-in standard SM2 elliptic curve operation logic, which can complete the entire process of public key parameter parsing, signature coordinate extraction, scalar conversion, curve point doubling point combination operation, and verification value restoration, so as to realize the verification of the legality of national cryptographic signature and the authenticity of document. The logic control and triggering module is used to compare whether the national cryptographic verification value and the hash digest are consistent. When the comparison result is consistent, a local verification instruction is triggered. Specifically, this module adopts a bit-by-bit precise comparison mechanism and is responsible for the logic scheduling of the whole process. Under normal working conditions, it triggers the subsequent quantum-resistant fine verification process. Under abnormal working conditions, it directly terminates the verification and outputs the failure result, realizing hierarchical computing power optimization and process control. The index sequence generation module is used to generate a polynomial index sequence in response to local verification instructions by using the hash digest as a random number seed input sampling function. Specifically, this module integrates pseudo-random iteration, nonlinear perturbation, and threshold screening logic to generate a dynamic, irregular, and non-repeating polynomial index sequence based on the unique hash digest of the document, thereby achieving random and accurate sampling of quantum signature fragments. The feature extraction module is used to extract lattice polynomial fragments from the quantum-resistant signature components based on the polynomial index sequence. Specifically, this module extracts effective polynomial feature fragments based on the dynamic index sequence through precise memory addressing, discards invalid and redundant data, realizes lightweight local loading of quantum-resistant signature data, and reduces the consumption of terminal hardware resources. The quantum-resistant mapping module is used to perform matrix-modular mapping on lattice polynomial fragments based on a pre-set quantum-resistant verification matrix to obtain polynomial verification feature values. Specifically, the module has a built-in lightweight sparse quantum-resistant verification matrix that integrates number theory transformation, frequency domain operation, and polynomial modulus reduction logic to efficiently complete the polynomial feature matrix mapping, generate standardized verification feature values, and realize quantum-resistant signature integrity and legality verification. The result output module is used to generate and output verification results based on the numerical comparison status of polynomial verification feature values. Specifically, this module has a built-in standard feature threshold range, determines the signature status through feature value numerical comparison, outputs verification pass or verification failure results, and simultaneously completes abnormal log recording, data retention, and result push to support business system audit control. Through the above system architecture design, each module has a clear division of labor and works together efficiently, constructing a lightweight cross-platform verification system of "national cryptographic initial screening + quantum-resistant fine detection". It meets the national commercial cryptography compliance requirements, has the ability to resist quantum cracking, and solves the problems of poor cross-platform compatibility, high computing power consumption, high false alarm rate and insufficient security of traditional signature verification, thereby improving the practicality and stability of electronic signature verification.

[0036] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented in software, the above embodiments can be implemented, in whole or in part, as a computer program product. Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution.

[0037] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment, depending on actual needs.

[0038] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application.

Claims

1. A cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms, characterized in that, The method includes: Obtain the electronic document to be verified and its corresponding composite signature data; Read the format identifier in the header of the composite signature data; parse the total byte length and segmentation offset of the composite signature data based on the format identifier; extract the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; define the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component; The national cryptographic hash algorithm is used to process the electronic documents to be verified and generate hash digests. Based on the pre-stored national cryptographic public key, perform elliptic curve scalar processing on the national cryptographic signature component to recover the national cryptographic verification value; The system compares the national cryptographic verification value with the hash digest to see if they match. If the comparison result is consistent, a local verification command is triggered. In response to the local verification command, the hash digest is used as a random number seed input to the sampling function to generate a polynomial index sequence; Lattice polynomial fragments are extracted from quantum-resistant signature components based on the polynomial index sequence; Matrix modulo mapping is performed on the lattice polynomial fragments based on a pre-set quantum-resistant verification matrix to obtain polynomial verification eigenvalues; The verification results are generated and output based on the numerical comparison of polynomial verification feature values.

2. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms as described in claim 1, characterized in that, The national cryptographic hash algorithm is used to process the electronic document to be verified and generate a hash digest, including: Convert the electronic document to be verified into an initial bitstream; Get the bit length of the initial bit stream; A single-bit logic high level is appended to the end of the initial bit stream; the current bit length after appending the logic high level is moduloed by a specified value to obtain a difference parameter, which is the number of bits required to supplement the current bit length for group alignment; Append a logic low level to the end of the current bit stream with a number of bits equal to the difference parameter; convert the original bit length of the initial bit stream into a 64-bit binary string and append it to the end of the current bit stream to generate a message packet set; The preset initial linking variable is invoked to perform an iterative compression operation on the message group set, generating a hash digest.

3. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms as described in claim 1, characterized in that, Based on the pre-stored national cryptographic public key, perform elliptic curve scalar processing on the national cryptographic signature component, including: The base point parameters are parsed based on the pre-stored national cryptographic public key; Extract the signature integer coordinate pair based on the national cryptographic signature component; Convert the hash digest into an integer scalar; Perform point addition and point multiplication operations based on integer scalars and base point parameters to generate reference coordinate pairs; convert the reference coordinate pairs into national cryptographic verification values.

4. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 1, characterized in that, Generate a polynomial index sequence, including: Obtain the highest order of the pre-set quantum-resistant verification matrix; The low-order bits of the hash digest are extracted and converted into the initial state variables of the pseudo-random generator; Run the pseudo-random generator to output a set of non-repeating integers; Elements with values ​​greater than the highest order in the set of integers are removed to obtain a polynomial index sequence.

5. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 1, characterized in that, Perform matrix modulus mapping on lattice polynomial fragments based on a pre-defined quantum-resistant verification matrix, including: Extract the corresponding sparse submatrix from the quantum-resistant verification matrix based on the polynomial index sequence; Convert lattice polynomial fragments into vector form; Perform matrix processing on lattice polynomial fragments in vector form and sparse submatrices; The matrix processing result is subjected to polynomial modulo reduction to generate check loop elements as the input source for numerical comparison status.

6. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 3, characterized in that, Based on integer scalars and base point parameters, perform point addition and doubling operations to generate reference coordinate pairs, including: Construct a three-dimensional coordinate set by mapping the base point parameters to the Jacobian projected coordinate space; Traverse the binary scalar from high to low according to the binary bit order of the integer scalar; When the traversal reaches the first logical value of the corresponding bit, the projection doubling process is performed on the current three-dimensional coordinate set; When the traversal reaches the second logical value of the corresponding bit, an additional projection point addition operation is performed on the basis of the projection doubling point processing. At the end of the traversal, the output 3D coordinates are converted back to affine coordinates to generate reference coordinate pairs.

7. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 4, characterized in that, Running the pseudo-random generator outputs a set of non-repeating integers, including: Set the multiplier constant and increment constant for the linear congruence equation; Substituting the initial state variables as input into the linear congruence equation, we obtain the first pseudo-random number; Obtain the pre-negotiated quantum-resistant public key parameters as perturbation constants; The first output mask is generated based on the first pseudo-random number and the perturbation constant; The first integer is extracted based on the first output mask mapping and placed into the temporary storage array; The first pseudo-random number is substituted into the linear congruence equation as a new input for the next iteration until the total number of values ​​in the temporary array reaches the sampling threshold, thus generating an integer set.

8. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 5, characterized in that, Perform matrix processing on lattice polynomial fragments in vector form and sparse submatrices, including: The first rotation factor is invoked to perform a forward number-theoretic transformation on the vector form of the lattice polynomial fragment, which is then converted into a first frequency domain sequence. The second rotation factor is invoked to perform a forward number-theoretic transformation on the sparse submatrix, converting it into a second frequency domain sequence; Perform point-by-point processing on corresponding elements in the first and second frequency domain sequences to obtain the product sequence; The inverse twitch factor is invoked to perform an inverse number-theoretic transformation on the product sequence, generating a polynomial product in the time domain, which is then used as the output of matrix processing.

9. The cross-platform electronic signature verification method based on national cryptographic standards and quantum-resistant algorithms according to claim 1, characterized in that, When the comparison results are consistent, it also includes: Start the anti-quantum preprocessing thread, use the segmentation offset to directly address the starting physical address of the anti-quantum signature component, and load the anti-quantum signature component into the anti-quantum operation cache through memory mapping without performing data copying; In the quantum-resistant buffer, the decompression and analog-to-digital conversion operations of lattice polynomial fragments are performed synchronously to generate pre-computed intermediate states; The matrix-modulus mapping is executed by calling the pre-computed intermediate state. If the comparison result is inconsistent, the anti-quantum preprocessing thread is terminated and the anti-quantum operation buffer is released.

10. A cross-platform electronic signature verification system based on national cryptographic standards and quantum-resistant algorithms, characterized in that: For implementing the cross-platform electronic signature verification method based on national cryptographic and quantum-resistant algorithms as described in any one of claims 1 to 9, the system comprises: The signature data acquisition module acquires the electronic document to be verified and the corresponding composite signature data. The format parsing and segmentation module reads the format identifier from the header of the composite signature data; parses the total byte length and segmentation offset of the composite signature data based on the format identifier; extracts the preceding byte sequence from the composite signature data based on the segmentation offset as the national cryptographic signature component; and defines the remaining byte sequence after removing the preceding byte sequence from the composite signature data as the quantum-resistant signature component. The digest generation module uses the national cryptographic hash algorithm to process the electronic documents to be verified and generate hash digests. The national cryptographic verification module performs elliptic curve scalar processing on the national cryptographic signature component based on the pre-stored national cryptographic public key to recover the national cryptographic verification value. The logic control and triggering module compares the national cryptographic verification value with the hash digest to see if they match. When the comparison result is consistent, it triggers a local verification command. The index sequence generation module, in response to the local verification command, uses the hash digest as a random number seed to input the sampling function and generates a multinomial index sequence; The feature extraction module extracts lattice polynomial fragments from the quantum-resistant signature components based on the polynomial index sequence. The quantum-resistant mapping module performs matrix-modular mapping on lattice polynomial fragments based on a pre-set quantum-resistant verification matrix to obtain polynomial verification eigenvalues. The results output module generates and outputs the verification results based on the numerical comparison status of the polynomial verification feature values.

Images