CN112631992A

CN112631992A - Electronic file filing method and system

Info

Publication number: CN112631992A
Application number: CN202011570339.7A
Authority: CN
Inventors: 吴从华
Original assignee: Xian Cresun Innovation Technology Co Ltd
Current assignee: Xian Cresun Innovation Technology Co Ltd
Priority date: 2020-12-26
Filing date: 2020-12-26
Publication date: 2021-04-09

Abstract

The invention discloses an electronic file filing method and a system, wherein the method comprises the following steps: the submitting end constructs a GRS code based on a finite field, generates a first public key and a first private key according to the GRS code, and sends the first public key to the receiving end; the submitting end signs the electronic file before filing by using a first private key to obtain a first digital signature; the submitting end sends the electronic file before filing and the first digital signature to the receiving end; the receiving end receives the electronic file before filing, the first digital signature and the first public key, and verifies the electronic file before filing based on the first digital signature and the first public key; the receiving end signs the electronic file again before filing to obtain a second digital signature after the verification is successful; and archiving the electronic file before archiving and the second digital signature to obtain the archived electronic file.

Description

Electronic file filing method and system

Technical Field

The invention belongs to the field of file filing, and particularly relates to an electronic file filing method and system.

Background

With the popularization of internet technology, electronic documents replace traditional paper documents in many scenes.

However, when the electronic document is archived, the security, integrity and authenticity of the electronic document during transmission are difficult to ensure, and it is impossible to prove whether the electronic document has been modified or not and to ensure the integrity of the electronic document during transmission

Therefore, how to implement a safe, complete and real method for archiving electronic files is a problem that needs to be solved urgently.

Disclosure of Invention

In order to solve the above problems in the prior art, the present invention provides an electronic document filing method and system. The technical problem to be solved by the invention is realized by the following technical scheme:

in a first aspect, an embodiment of the present invention provides an electronic file archiving method, including:

the method comprises the steps that a submission end constructs a GRS code based on a finite field, generates a first public key and a first private key according to the GRS code, and sends the first public key to a receiving end;

the submitting end signs the electronic file before filing by using the first private key to obtain a first digital signature;

the submitting end sends the electronic file before filing and the first digital signature to the receiving end;

the receiving end receives the electronic file before filing, the first digital signature and the first public key, and verifies the electronic file before filing based on the first digital signature and the first public key;

if the verification is successful, the receiving end signs the electronic file before filing again to obtain a second digital signature;

and archiving the electronic file before archiving and the second digital signature to obtain an archived electronic file.

Optionally, the signing, by using the first private key, the electronic file before archiving to obtain a first digital signature includes:

carrying out Hash operation on the electronic file before filing to obtain a first abstract value;

and encrypting the first digest value by using the first private key to obtain a first digital signature.

Optionally, the performing a hash operation on the electronic file before filing to obtain a first digest value includes:

performing primary hash operation on the electronic file before filing;

and performing the Hash operation again on the result obtained by the primary Hash operation to obtain a first abstract value.

Optionally, the verifying the electronic file before archiving based on the first digital signature and the first public key includes:

decrypting the first digital signature by using the first public key to obtain a digest value to be verified;

carrying out Hash operation on the unarchived electronic file to obtain a verification abstract value;

and comparing the abstract value to be verified with the verification abstract value, and if the abstract value to be verified is equal to the verification abstract value, the verification is successful.

Optionally, the signing, by the receiving end, the electronic file before filing again to obtain a second digital signature includes:

the receiving end generates a second public key and a second private key;

the receiving end carries out Hash operation on the electronic file before filing to obtain a second abstract value;

and the receiving end encrypts the second digest value by using the second private key to obtain a second digital signature.

In a second aspect, an embodiment of the present invention further provides an electronic file archiving system, including:

the submitting end is used for constructing a GRS code based on a finite field; generating a first public key and a first private key according to the GRS code, and sending the first public key to a receiving end; signing the electronic file before filing by using the first private key to obtain a first digital signature; sending the electronic file before filing and the first digital signature to the receiving end;

the receiving end is used for receiving the electronic file before filing, the first digital signature and the first public key and verifying the electronic file before filing based on the first digital signature and the first public key; after the verification is successful, signing the electronic file before filing again to obtain a second digital signature; and archiving the electronic file before archiving and the second digital signature to obtain an archived electronic file.

Optionally, the signing the pre-archive file again to obtain a second digital signature includes:

the receiving end generates a second public key and a second private key;

In a third aspect, an embodiment of the present invention further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the computer program implements the steps of the above method.

According to the electronic file filing method and system provided by the embodiment of the invention, the electronic file is digitally signed by the submitting end and verified by the receiving end, so that the safety of the electronic file in the transmission process can be ensured, and the electronic file is digitally signed by the receiving end, so that the electronic file can be prevented from being tampered in the filing and storing process, and the safety, integrity and authenticity of the electronic file are further ensured. Moreover, the digital signature method provided by the embodiment of the invention has higher feasibility, can reduce the public key amount, improves the encryption and decryption efficiency, and further improves the security.

Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.

The present invention will be described in further detail with reference to the accompanying drawings and examples.

Drawings

FIG. 1 is a flowchart of an electronic document archiving method according to an embodiment of the present invention;

FIG. 2 is a diagram of feasibility simulation results of a method provided by an embodiment of the invention;

FIG. 3 is a diagram of a result of a feasibility simulation of the method provided by the embodiment of the present invention under different error correction capabilities;

FIG. 4 is a diagram of a simulation result of the method according to the embodiment of the present invention under an ISD decoding attack;

FIG. 5 is a diagram of a simulation result of public key quantities under different error correction capabilities according to the method provided in the embodiment of the present invention;

fig. 6 is a structural diagram of an electronic file archiving system according to an embodiment of the present invention.

Detailed Description

The present invention will be described in further detail with reference to specific examples, but the embodiments of the present invention are not limited thereto.

In order to realize a safe and encrypted electronic file filing method, the embodiment of the invention provides an electronic file filing method and system.

In a first aspect, an embodiment of the present invention provides an electronic file archiving method. Next, the method will be described first.

Referring to fig. 1, fig. 1 is a flowchart of an electronic file archiving method according to an embodiment of the present invention. The electronic file filing method provided by the embodiment of the invention can comprise the following steps:

s1: the submitting end constructs a GRS code based on a finite field, generates a first public key and a first private key according to the GRS code, and sends the first private key to the receiving end.

In an alternative embodiment, the electronic file includes, but is not limited to, an electronic file of a student, a file of each department, an electronic bill, or the like. Correspondingly, the submitting end and the receiving end can be a student main body and a school archive office, a business department and an archive department, or a business department and a financial department, and the like.

It can be understood that the student submits the files when the student enters the school, the student body sends the electronic files to the school archive office, and then the student archive office files and stores the electronic files of the student according to the class of the student body. Or each department submits the department file to the archive department, and each department sends the department file to the archive department, and then the archive department archives and stores the file according to different departments. Or, each department sends the electronic bill of the department to a financial department, and the financial department archives and stores the electronic bill according to the department or the bill type.

Specifically, constructing a finite field-based GRS code may include: constructing a finite field, and constructing a GRS code (generalized Reed-Solomon code) with a code length of n, a dimension of k and an error correction capability of t according to the finite field, wherein n, k and t are all any positive integers and satisfy the requirement of

Wherein the finite field can select a finite field F comprising q elements_qAnd selecting a positive integer m so that q satisfies q ═2^m。

It should be noted that the selection of the embodiment of the present invention is based on the finite field F_qInstead of being based on the normal binary system, because the code with the same security level (such as Goppa code) is based on the finite field F when facing the ISD decoding attack_qThe Goppa code of (2) has a smaller public key amount than the binary-based Goppa code. For example, a finite field based Goppa code with a security level of 128, with a public key amount of 725740 bits; and a binary Goppa code-based, public key quantity of 1537536bits with a security level of 128. In contrast, based on the finite field F_qThe amount of public keys of Goppa code is nearly an order of magnitude smaller than that of the public keys based on binary Goppa code.

In addition, the GRS code is selected rather than the other codes (e.g., Goppa code) because the GRS code is a very large distance separable (MDS) code, which has good performance; the existing coder and decoder of the GRS code has a plurality of applications in various fields and good practicability; furthermore, GRS codes are more flexible than Goppa codes; and the GRS code has the advantage of stronger expandability.

In this embodiment, the first public key and the first private key are generated based on the GRS code of the finite field, which can ensure that the first public key and the first private key have higher security performance and occupy smaller space.

In an alternative embodiment, generating the first public key and the first private key according to the GRS code may include the following steps.

Step one, selecting a non-singular matrix of (n-k) x (n-k), a dense matrix of n x n and a sparse matrix of n x n in a finite field, wherein the rank of the dense matrix is z, the average row weight and the column weight of the sparse matrix are x, z is a natural number, z is smaller than n, and x is smaller than n.

As an embodiment of the present invention, a dense matrix may be adopted, in which the rank z is much smaller than n, and the average row weight and column weight x of the sparse matrix are much smaller than n.

In particular, a dense matrix may be represented by the product of the transpose of the matrix and the matrix, i.e.

Wherein

Is a finite field F_qTwo zxn matrices are defined above, and the rank of the matrix is z.

Optionally, in this embodiment, the following choices for the parameters m, n, k, t, and x are available for reference, see table 1, and there are but not limited to these choices, but considering the correctness, feasibility, and security of the scheme, and the public key amount and the signature length, the scheme of the present invention preferably adopts three sets of parameter values listed in table 1.

TABLE 1 parameter selection

m	n	k	t	x
					12	4094	4074	10	1～1.1
16	65534	65516	9	1～1.1
					10	1022	1002	10	1～1.1

And step two, performing matrix addition operation on the dense matrix and the sparse matrix to obtain a transformation matrix.

Specifically, the addition operation adopts formula (1):

wherein the content of the first and second substances,

a transformation matrix is represented that is,

a dense matrix is represented that is,

a sparse matrix is represented.

Performing matrix multiplication on an inverse matrix of the nonsingular matrix, the check matrix and a transposed matrix of the transformation matrix to obtain a first public key; wherein, the check matrix is an (n-k) x n matrix of the GRS code.

Specifically, the multiplication operation adopts formula (2):

wherein the content of the first and second substances,

which represents the public key(s),

representing the inverse of the non-singular matrix,

a check matrix is represented that is,

representing a transpose of the transform matrix.

And step four, taking the nonsingular matrix, the check matrix, the transformation matrix and a decoding algorithm as the first private key.

It is to be understood that the first public key is used for external disclosure and the first private key is used for storage. The first public key and the first private key are two different parameter sets in an algorithm, but are inherently associated with each other, and the first public key and the first private key are generated simultaneously but can be used independently.

And the submitting end sends the first public key to the receiving end for verifying the electronic file subsequently.

And S2, the submitting end signs the electronic file before filing by using the first private key to obtain a first digital signature.

In an alternative embodiment, S2 may include S21-S22.

And S21, carrying out hash operation on the electronic file before filing to obtain a first abstract value.

The hash operation can change an input vector of an arbitrary length into an output of a fixed length by a hash algorithm. Note that the hash operation is one-way, non-reversible.

In an alternative embodiment, S21 may include S211-S212.

S211, carrying out primary hash operation on the electronic document before filing.

In this embodiment, the electronic document M before filing is subjected to the primary hash operation to obtain h (M).

And S212, performing the hash operation again on the result obtained by the primary hash operation to obtain a first abstract value.

In this embodiment, the result h (m) obtained by the primary hash operation is subjected to the hash operation again to obtain the first digest value S_xI.e. calculating S_xH (m) i), wherein i is 0,1,2 … …. In the embodiment of the invention, i is taken to be 0, and the abstract value S is made to be_xIs a vector of length n-k.

In other embodiments, the first digest value may be obtained by one or more hash operations, and the fixed length output may be satisfied.

And S22, encrypting the first digest value by using the first private key to obtain a first digital signature.

In an alternative embodiment, S22 may include S221 to S224.

S221, multiplying the nonsingular matrix and the first abstract value to obtain the syndrome to be translated.

Specifically, the multiplication operation adopts formula (3):

wherein, S'_xWhich represents the syndrome to be interpreted,

representing a non-singular matrix, S_xRepresenting a first digest value.

S222, decoding the syndrome to be decoded by using a decoding algorithm by combining the check matrix of the first private key to obtain a first error vector.

Any existing decoding algorithm can be selected as the decoding algorithm, and in this embodiment, the decoding algorithm is preferably an iterative decoding algorithm in the time domain, that is,: BM iterative decoding algorithms (Berlekamp-Massey), Chien search algorithms (Chien), and Forney algorithms. The decoding algorithm is fast in speed, simple to implement and easy to implement by a computer, so that the decoding algorithm is a fast decoding algorithm.

Optionally, the decoding algorithm may include the following steps:

the method comprises the following steps: calculating a syndrome;

step two: determining an error location polynomial;

step three: determining an error estimation function;

step four: and solving the error position number and the error numerical value, and correcting errors.

Completing the four steps to finish one-time decoding, and if the decoding is successful, directly decoding an error vector; otherwise, it is considered as decoding failure.

With the solution of the embodiment of the present invention, if the decoding fails, i' is made to be i +1, and the process restarts from S211 until the decoding succeeds.

And S223, performing matrix multiplication on the first error vector and the inverse matrix of the transformation matrix of the first private key to obtain a second error vector, wherein the weight of the second error vector is less than or equal to the error correction capability t of the GRS code.

Specifically, see formula (4):

wherein the content of the first and second substances,

which represents a second error vector, is,

which represents a first error vector, is shown,

an inverse matrix of a transformation matrix representing the first private key.

And S224, using the second error vector as a first digital signature.

Up to this point, a first digital signature based on an error vector error correction code has been obtained, but the error vector takes more bits due to the presence of multiple 0 elements. In order to reduce the bit number, the scheme provided by the invention can be further optimized on the basis of the embodiment.

Preferably, after obtaining the second error vector, the method further includes the following steps:

and constructing an index pair for the second error vector to obtain the index pair of the second error vector.

Specifically, the index pair of the second error vector can be obtained according to equation (5).

Wherein, I_eRepresenting an index pair.

Extracting non-zero elements in the second error vector and marking as error values, and constructing an index pair I of the second error vector by using the error position alpha and the error position c_e。

Accordingly, the index pair is treated as a first digital signature.

The signature usually corresponds to a signature verification process, and as a step of generating only a digital signature, the obtained index pair I is used_eAs a digital signature; in the process of signature verification, the signature verifier needs to use the index pair I_eChecking the signature with the abstract value h (m) I), so that after the signature is successfully checked, the [ I ] is finally checked_e|i]As the first digital signature of the electronic file M before archiving.

In a preferred scheme, by further establishing an index pair for the generated second error vector and using the index as the first digital signature, the number of bits can be reduced, thereby reducing the signature length.

S3, the submitting end sends the electronic document before filing and the first digital signature to the receiving end.

S4, the receiving end receives the electronic document before filing, the first digital signature and the first public key, and verifies the electronic document before filing based on the first digital signature and the first public key.

Specifically, verifying the electronic document before filing may include S41-S44.

And S41, decrypting the first digital signature by using the first public key to obtain the digest value to be verified.

Corresponding to the scheme that the obtained index pair is used as the first digital signature in the signature method, in this step, the second error vector needs to be restored according to the index pair, and then the first public key is used for decrypting the second error vector to obtain the digest value to be verified.

In particular, the second error vector needs to be recovered from the index pair, i.e. in index pair I_eMiddle alpha_jPosition of index by c_jFilling in at α_jThe positions outside the index are filled with 0's until the vector

Up to (n-k).

And decrypting the second error vector by using the first public key, namely obtaining a digest value to be verified according to a formula (6):

wherein y represents the digest value to be verified.

Calculating a first public key

According to a_jValue of corresponding row of index and c_jAnd taking the product as the digest value to be verified.

And S42, carrying out hash operation on the electronic document before filing to obtain a verification abstract value.

Similarly, two hash operations need to be performed on the electronic document before archiving, and the specific steps are the same as S21, and are not described herein again. Through two hash operations, the verification digest value y' h (m) i is obtained.

And S43, comparing the abstract value to be verified with the verification abstract value, and if the abstract value to be verified is equal to the verification abstract value, the verification is successful.

Comparing the digest value y to be verified with the verification digest value y ', and if y is equal to y', the digest value to be verified is equal to the verification digest value, and the signature is verified successfully; otherwise, the signature fails to be verified.

And S5, the verification is successful, and the receiving terminal signs the electronic file before filing again to obtain a second digital signature.

And the verification is successful, which indicates that the electronic file sent by the submitting end is sent by the submitting end and is not tampered in the transmission process, so that the next operation can be performed.

In an alternative embodiment, S5 may include S51-S53.

S51, the receiving end generates a second public key and a second private key.

Optionally, the receiving end may generate the second public key and the second private key based on the GRS code, and the specific method steps refer to S1, which is not described repeatedly herein. Alternatively, the receiving end may generate the second public key and the second private key based on an asymmetric algorithm. The asymmetric encryption algorithm comprises the following steps: DH key exchange algorithm, RSA, DSA, or ECDSA. And are not limited herein.

And S52, the receiving end carries out hash operation on the electronic file before filing to obtain a second abstract value.

In this embodiment, similarly, two hash operations need to be performed on the electronic document before filing, and the specific steps are the same as S21, and are not described herein again.

And S53, the receiving end encrypts the second digest value by using the second private key to obtain a second digital signature.

Correspondingly, if the receiving end generates the second public key and the second private key based on the GRS code, the step of encrypting the second digest value to obtain the second digital signature is the same as that of S22, and is not described herein again.

In addition, if the receiving end generates the second public key and the second private key based on the asymmetric algorithm, the step of encrypting the second digest value to obtain the second digital signature is the prior art, and is not described herein again.

And S6, archiving the electronic file before archiving and the second digital signature to obtain the archived electronic file.

It can be understood that, in the embodiment of the present invention, the electronic file is signed again and then stored, which is convenient for verifying the integrity of the electronic file subsequently.

According to the electronic file archiving method provided by the embodiment of the invention, the GRS code of the terminal base based on the finite field is submitted to generate the public key and the private key, the digest value is obtained according to the electronic document before archiving, and the private key is used for encrypting the digest value to obtain the digital signature. And sending the electronic document, the digital signature and the public key to a receiving end before filing, decrypting the digital signature by using the public key at the receiving end, and comparing the decrypted digital signature with the digest value to judge whether the verification is successful. According to the scheme of the embodiment of the invention, the digital signature is obtained by digitally signing the electronic file before filing, and whether the electronic file is filed or not is determined after verification, so that the safety, integrity and authenticity of the electronic file are ensured. Moreover, the digital signature provided by the embodiment of the invention has higher feasibility, and can reduce the public key amount, improve the encryption and decryption efficiency and further improve the security.

The electronic file archiving method provided by the embodiment of the invention has the core idea that the electronic file to be archived is encrypted by using a digital signature method, and the transmitted digital signature is verified by using a corresponding digital signature method, so that the electronic file is effectively protected in the transmission process. Therefore, in the following, the scheme provided by the embodiment of the present invention is verified in terms of five aspects, namely, the correctness, feasibility, security, public key amount and signature length of the signature. For convenience, the second public key, the second private key, the second digital signature, the second digest value, and the like are not referred to herein, and thus the first public key, the first private key, the first digital signature, and the first digest value are represented by the public key, the private key, the digital signature, and the digest value.

(1) Correctness:

the verification of the correctness is also the verification of whether the signature verification is successful or not, and the correctness can be proved by proving that the digest value to be verified obtained by decrypting the second error vector by using the public key is equal to the digest value obtained in the process of generating the signature. The specific process is as follows:

decrypting the second error vector by using a public key to obtain a digest value to be verified, wherein the public key is based on an inverse matrix and a check of a nonsingular matrixThe matrix and the transpose matrix of the change matrix are obtained by matrix multiplication, namely the formula (2); the second error vector is obtained by matrix multiplication based on the first error vector and the inverse matrix of the change matrix of the private key, namely, the formula (4); the digest value to be verified is based on each column in the public key according to alpha_jValue of corresponding row of index and c_jThe product of (a) is obtained, i.e., the above formula (6).

Therefore, by substituting the formula (2) and the formula (4) into the formula (6),

by simplifying the formula in the above formula (7), the following can be obtained:

and due to

Thus, from equation (8):

wherein y represents the digest value to be verified,

representing the inverse, S 'of the nonsingular matrix'_xRepresenting the syndrome to be translated.

The syndrome to be translated is obtained by multiplying the non-singular matrix by the digest value, i.e. the above formula (3).

Thus, according to equation (3), y is obtained as S_xThat is, y' can be obtained, and the verification is successful, which indicates that the signature is correct.

(2) Feasibility:

based on a finite field F_qThe total syndrome number of the GRS code is N, and N＝q^n-k＝q^2t＝q^2mtThe number of syndromes that can be decoded is M, an

Therefore to the digest value S_xThe probability of finding success is

I.e. the average number of lookups is

Based on finite field F_qThe parameter pair (m, t) of the GRS code signature is selected to ensure that the average search times is below ten million orders of magnitude, and the selection of the parameter pair cannot be too small.

Referring to fig. 2, fig. 2 is a diagram of a feasibility simulation result of the method provided by the embodiment of the invention. The figure shows the log of the error correction capability t and the average number of lookups₂The relationship between Z. As can be seen from fig. 2, the log of the error correction capability t and the average number of lookups₂Z is proportional, i.e. the average number of seeks Z is exponential to the error correction capability t.

The horizontal line in FIG. 2 represents operations of the order of tens of millions, where data x represents m and y represents log₂Z。

When the value of the error correction capability t is greater than 10, the average search times will be too large, and therefore, it is more suitable that the error correction capability t is selected to be less than or equal to 10.

Referring to fig. 3, fig. 3 is a diagram of a result of a feasibility simulation of the method provided by the embodiment of the present invention under different error correction capabilities. Fig. 3 shows the relation of m to the logarithm of the average number of lookups, when the error correction capability t is 9 and 10. In the figure, x represents m, and y represents log₂And Z. As can be seen from FIG. 3, when m.gtoreq.12, log increases with m₂Z tends to be smooth with little change; when m is<12, the average number of lookups is increased. Therefore, m is preferably 12 or more.

In addition, two sets of data from table 2 can be obtained from fig. 3:

TABLE 2(a)

m(t＝10)	6	8	10	12	14	16	18
								log₂Z	23.33	22.16	21.88	21.81	21.80	21.79	21.79

TABLE 2(b)

m(t＝9)	6	8	10	12	14	16	18
								log₂Z	19.74	18.78	18.55	18.49	18.47	18.4703	18.47

The CFS signature is known to use parameter pairs (m, t) of (15,10) and (16, 9). When the parameter pair is (15,10), the logarithm value of the average search number of the CFS signature is 27.7911, based on the finite field F_qThe logarithm value of the average search times of the GRS code signature is 21.7933; when the parameter pair is (16,9), the logarithm of the average number of lookups for the CFS signature is 18.4691, based on the finite field F_qThe log value of the average number of lookups of the GRS code signature of (a) is 18.4703.

In contrast, under two parameter pairs, the CFS signature is based on the finite field F_qThe data difference of the average search times of the GRS code signature is not large, so that the digital signature provided by the embodiment of the invention has feasibility.

(3) Safety:

referring to fig. 4, fig. 4 is a simulation result diagram of the method provided by the embodiment of the present invention under the ISD decoding attack. Fig. 4 shows the relationship of m to the security level SL in the case of an ISD decoding attack.

And the product of the security level coefficient under the ISD decoding attack and m and t is in an exponential relation, and t is selected to be less than or equal to 10 based on the condition. I.e. when t is determined, the larger m, the higher the security level coefficient.

In the figure, data x represents m, and y represents SL. As can be seen from FIG. 4, based on the finite field F_qThe digital signature of the GRS code of (1) can reach a security level SL of 80 when the parameter pair is selected as (10,10), the general security level has been reached, and the security level SL exceeds 128 when the parameter pair is selected as (16, 9).

Under the ISD decoding attack, when the parameter pair is (15,10), the security level coefficient SL of the CFS signature is 76.89 and is based on a finite field F_qThe security level coefficient SL of the GRS code signature of is 135.42; when the parameter pair is (16,9), the security level coefficient SL of the CFS signature is 76.92 based on the finite field F_qThe security level coefficient SL of the GRS code signature of (a) is 135.56.

In comparison, the finite field F-based method provided by the embodiment of the invention_qThe GRS code signature has a higher security level coefficient under the attack of ISD decoding.

In addition, the embodiment of the invention provides a finite field F_qThe GRS code signature can also effectively resist the distinguishing attack, and the parameter selection of the CFS signature under the distinguishing attack has defects.

(4) Public key quantity:

in the embodiment of the invention, the check matrix of the GRS code is subjected to Gaussian elimination to obtain a row ladder type matrix, namely a public key

The public key quantity of (a) is k (n-k). Thus, based on the finite field F_qThe public key quantity is k (n-k) log on the GRS code₂q。

Referring to fig. 5, fig. 5 is a graph of simulation results of public key quantities under different error correction capabilities according to the method provided by the embodiment of the present invention. Fig. 5 shows the relationship between m and the public key amount when the error correction capability t is 9 and 10. In the figure, data x represents m, and y represents k (n-k) log₂q is calculated. As can be seen from fig. 5, the public key amount has an exponential relationship with m, and the influence on the public key amount is not obvious under different error correction capabilities t. Although when m is larger, based on the finite field F_qThe more secure the GRS code signature, but also the larger the amount of public keys. Therefore, a more suitable m is selected, so that the safety factor is higher and the public key quantity is smaller, for example, m is 10 or 12.

(5) Signature length:

the embodiment of the invention provides a finite field F_qThe signature length of the GRS code is 2 m.t_p+log₂Z。

Table 3 is based on the finite field F_qThe GRS code signature and the CFS signature are compared with each other in average search times, security level, public key amount and signature length under two different parameter pairs.

Table 3 parameter comparison of finite field Fq-based GRS code signature and CFS signature under different parameter pairs

As can be seen from table 3, the finite field F-based method provided by the embodiment of the present invention is based on different parameter pairs_qThe security level coefficient of the GRS code signature is higher than that of the CFS signature, but the amount of public keys and the length of the digital signature are larger.

Therefore, selecting several different sets of parameter pairs is based on the finite field F_qThe parameters of the GRS code signature of (1) were simulated, and the results are shown in table 4.

TABLE 4 different parameter pairs based on finite field F_qParameter of GRS code signature

Parameter pair	Average number of lookups	Security Level (SL)	Amount of public key	Signature Length (bits)
					(11,9)	18.5072	85.5239	401544	195
(10,10)	21.8829	80.3254	200400	202
					(12,10)	21.8140	102.3972	977760	238

The GRS code signature based on the finite field Fq provided by the embodiment of the invention can reduce the selection of parameter pairs and reduce the public key amount and the signature length on the premise of improving the security level coefficient.

The verification shows that the digital signature scheme of the invention has the effects of correctness, feasibility, safety, reduction of public key quantity, reduction of signature length and the like.

In a second aspect, an embodiment of the present invention further provides an electronic file archiving system, and referring to fig. 6, fig. 6 is a structural diagram of the electronic file archiving system provided in the embodiment of the present invention, including:

the submitting end 610 is used for constructing a GRS code based on a finite field; generating a first public key and a first private key according to the GRS code, and sending the first public key to a receiving end; signing the electronic file before filing by using a first private key to obtain a first digital signature; sending the electronic file before filing and the first digital signature to a receiving end;

a receiving end 620, configured to receive the electronic file before archiving, the first digital signature, and the first public key, and verify the electronic file before archiving based on the first digital signature and the first public key; the verification is successful, and the electronic file before filing is signed again to obtain a second digital signature; and archiving the electronic file before archiving and the second digital signature to obtain the archived electronic file. For related specific contents, refer to the contents of the electronic file archiving method of the first aspect, and are not described herein again.

According to the electronic file filing system provided by the embodiment of the invention, the digital signature is carried out on the electronic file by the submitting end and is verified by the receiving end, so that the safety of the electronic file in the transmission process can be ensured, and the digital signature is carried out on the electronic file by the receiving end, so that the electronic file can be prevented from being tampered in the filing and storing process, and the safety, the integrity and the authenticity of the electronic file are further ensured. Moreover, the digital signature method provided by the embodiment of the invention has higher feasibility, can reduce the public key amount, improves the encryption and decryption efficiency, and further improves the security.

In a third aspect, an embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the above-mentioned method steps.

The above-described computer-readable storage medium stores an application program that executes the road vehicle state identification method provided by the embodiment of the present invention when executed, and thus can realize: the electronic file is digitally signed by the submitting end and verified by the receiving end, so that the safety of the electronic file in the transmission process can be ensured, and the digital signature of the electronic file by the receiving end can prevent the electronic file from being falsified in the filing and storing process, and further ensure the safety, integrity and authenticity of the electronic file. Moreover, the digital signature method provided by the embodiment of the invention has higher feasibility, can reduce the public key amount, improves the encryption and decryption efficiency, and further improves the security.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions according to the embodiments of the invention are brought about in whole or in part when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

For the embodiments of the electronic device and the computer-readable storage medium, since the contents of the related methods are substantially similar to those of the foregoing embodiments of the methods, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the embodiments of the methods.

It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.

All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment.

The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several simple deductions or substitutions can be made without departing from the spirit of the invention, and all shall be considered as belonging to the protection scope of the invention.

Claims

1. An electronic file archiving method, comprising:

2. The method of claim 1, wherein signing the electronic file before archiving with the first private key to obtain a first digital signature comprises:

3. The method of claim 1, wherein performing a hash operation on the electronic file before filing to obtain a first digest value comprises:

performing primary hash operation on the electronic file before filing;

4. The method of claim 1, wherein the verifying the electronic file before archiving based on the first digital signature and the first public key comprises:

5. The method of claim 1, wherein said receiving end signs the electronic document again before filing to obtain a second digital signature, comprising:

the receiving end generates a second public key and a second private key;

6. An electronic file archiving system, comprising:

7. The electronic file archiving system according to claim 6, wherein said signing the pre-archive electronic file with said first private key resulting in a first digital signature comprises:

8. The system of claim 6, wherein the verifying the pre-archive electronic file based on the first digital signature and the first public key comprises:

9. The method of claim 6, wherein said re-signing the pre-archive file to obtain a second digital signature comprises:

the receiving end generates a second public key and a second private key;

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 5.