CN116522300B - Intelligent management system for electronic seal - Google Patents
Intelligent management system for electronic seal Download PDFInfo
- Publication number
- CN116522300B CN116522300B CN202310806115.9A CN202310806115A CN116522300B CN 116522300 B CN116522300 B CN 116522300B CN 202310806115 A CN202310806115 A CN 202310806115A CN 116522300 B CN116522300 B CN 116522300B
- Authority
- CN
- China
- Prior art keywords
- string
- data string
- constant
- information
- data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 claims abstract description 65
- 239000013598 vector Substances 0.000 claims abstract description 55
- 238000009792 diffusion process Methods 0.000 claims abstract description 42
- 238000013507 mapping Methods 0.000 claims abstract description 28
- 239000011159 matrix material Substances 0.000 claims abstract description 18
- 230000003044 adaptive effect Effects 0.000 claims abstract description 13
- 230000008569 process Effects 0.000 claims description 23
- 238000004364 calculation method Methods 0.000 claims description 4
- 125000004122 cyclic group Chemical group 0.000 claims description 4
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 abstract description 4
- 238000005516 engineering process Methods 0.000 description 11
- 230000000694 effects Effects 0.000 description 9
- 238000009826 distribution Methods 0.000 description 4
- 230000006835 compression Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 3
- 230000002708 enhancing effect Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 238000005336 cracking Methods 0.000 description 1
- 238000010511 deprotection reaction Methods 0.000 description 1
- 238000005429 filling process Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000007789 sealing Methods 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/10—Protecting distributed programs or content, e.g. vending or licensing of copyrighted material ; Digital rights management [DRM]
- G06F21/16—Program or content traceability, e.g. by watermarking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/602—Providing cryptographic facilities or services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Technology Law (AREA)
- Multimedia (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention relates to the technical field of data processing, and provides an intelligent management system of an electronic seal, which comprises the following components: converting the original file into a plurality of information groups; acquiring a constant of each iteration operation, acquiring a link vector according to an information group, acquiring an initial constant matrix, acquiring an iteration mapping rate according to the difference of the initial link vectors, and acquiring an adaptive constant according to the iteration mapping rate and the constant; dividing the information group into data strings and sub-strings, obtaining the cross-parallel ratio of the two data strings according to the cross-set and the union set between the data strings, and obtaining the content similarity of the data strings according to the number of the cross-parallel ratios corresponding to the different cross-parallel ratios; obtaining the content similarity of the data strings under different substring lengths, and obtaining an average value to obtain an information diffusion ratio; acquiring adjacent strings of the data string, acquiring diffusion strings according to the adjacent strings and the adaptive constant, and acquiring information abstracts; and completing management of the electronic seal aiming at the information abstract. The method and the device reduce the relevance of MD5 and simultaneously accelerate the speed of loop iteration.
Description
Technical Field
The invention relates to the technical field of data processing, in particular to an intelligent management system for an electronic seal.
Background
The electronic seal is an important technical means for performing authority management and ensuring system information safety for enterprises, and can change the electronic signature technology into a common signature and seal mode. The electronic seal mainly comprises two processes of seal stamping and seal checking, wherein the seal stamping process usually occurs when a flow node of a business management system is approved, firstly, electronic certificate information is written into a pdf file, and secondly, a seal model is drawn at a designated position to realize seal stamping of the electronic seal. The electronic seal at the present stage is mainly used for realizing the functions of sealing an electronic document, verifying the document, managing certificates, controlling rights and the like.
The electronic seal is realized by the following technologies including digital encryption technology, PKI technology, digital watermarking technology, component technology and the like. The electronic seal management system is generally composed of a plurality of modules such as electronic seal application, electronic seal manufacture, seal impression management, electronic seal management and the like, wherein the security of the electronic seal mainly depends on the encryption effect of the electronic seal, and the electronic seal encryption algorithm comprises a DSA signature encryption algorithm, an SM4 block encryption algorithm, an information abstract MD5 encryption algorithm and the like; the low speed of the SM4 grouping encryption algorithm for encrypting data leads to the easy interception of a secret key in the transmission process, and the leakage of electronic seal information is possibly caused; the MD5 encryption algorithm can only output bytes with fixed length, and the encryption effect on different electronic seals is unstable.
Disclosure of Invention
The invention provides an intelligent management system of an electronic seal, which aims to solve the problem that only bytes with fixed length can be output and the encryption effect on different electronic seals is unstable, and adopts the following technical scheme:
the embodiment of the invention provides an intelligent management system for an electronic seal, which comprises the following modules:
the data acquisition module converts the original file into a plurality of information groups;
the self-adaptive constant acquisition module acquires a constant of each iteration operation according to a traditional method, acquires a link vector according to an information group, acquires an initial constant matrix according to the acquired constant, acquires an iteration mapping rate of each iteration operation according to an editing distance between the initial link vectors and a difference between the constant and each round of cyclic link vector, and acquires the self-adaptive constant according to the iteration mapping rate and the initial constant matrix;
the information diffusion ratio acquisition module is used for dividing the information group into a plurality of data strings, dividing each data string into sub-strings with the same length, obtaining the cross ratio of two data strings according to the ratio of the intersection of any one data string and the other data strings to the number of the union, and obtaining the content similarity of the data strings according to the number of the cross ratios corresponding to the different cross ratio; acquiring the content similarity of the same data string under different substring lengths, and acquiring the average value of the content similarity of the data strings under different lengths as the information diffusion ratio of each data string;
the information abstract acquisition module acquires a neighboring string of each data string, acquires a diffusion string according to the neighboring string, the data string and the self-adaptive constant, and acquires the information abstract of the original file according to the diffusion string;
and the electronic seal management module is used for secondarily encrypting the information abstract of the original file and completing the management of the electronic seal through digital signature.
Preferably, the method for converting the original file into a plurality of information groups is as follows:
and regarding all characters in the original file as an original character string, converting the original character string into hexadecimal, filling the original character string according to the length of the original character string, and dividing the original character string into a plurality of 512-bit information groups after filling.
Preferably, the method for filling the original character string according to the length of the original character string comprises the following steps:
the hexadecimal system converted by the original character string is marked as the original hexadecimal system, the length of the original hexadecimal system is expressed by a 64-bit hexadecimal system, a 1 is filled behind the original hexadecimal system result, then the original hexadecimal system is always filled with 0 until the total bit length of the filled hexadecimal system information is up to (N.512+448) bit, and finally the length of the original character string expressed by the bit is 64 more behind the filling result.
Preferably, the method for obtaining the link vector according to the information group includes:
each 512bit information group is equally divided into 4 segments, each segment is a 128bit data string, and the hexadecimal number of each data string is regarded as a link vector.
Preferably, the method for obtaining the initial constant matrix according to the obtained constants is as follows:
four rounds of iteration operation are shared in the MD5 algorithm, each round of iteration operation is carried out for 16 times, constants obtained by all iteration operation in each round are formed into a constant sequence, the constant sequence is ordered according to the sequence of the iteration operation, the constant sequence is used as a row vector, and the obtained row vector is ordered according to the round to obtain an initial constant matrix.
Preferably, the method for obtaining the iteration mapping rate of each iteration operation according to the editing distance between the initial link vectors and the difference between the constant and each round of loop link vectors comprises the following steps:
the method comprises the steps of marking loops of each round as loops, calculating EDR editing distances of any two initial linking vectors in four initial linking vectors, marking a sequence of the four initial linking vectors as an initial input sequence, obtaining a Hurst index of the initial input sequence, obtaining initial influence degree of each loop according to the Hurst index of the initial input sequence and the loops of each loop, obtaining a plurality of difference results by taking difference among all EDR editing distances in each loop, obtaining the mappable degree of each operation according to the difference results, the constant EDR distance and the average value of the EDR distances of each loop, and obtaining the iterative mapping rate of each iterative operation by using the mappable degree of each iterative operation and the initial influence degree of each iterative operation in the loop.
Preferably, the method for obtaining the mappable degree of each operation according to the difference result, the constant EDR distance and the average value of the EDR distance of each cycle wheel comprises the following steps:
in the method, in the process of the invention,is the mean value of the EDR edit distance of the link vector of the nth cycle wheel, +.>Hexadecimal coding representing the conventional constant corresponding to the ith operation,/->Indicating the a-th difference result of the n-th cycle,>indicating the mappable degree of the ith operation.
Preferably, the method for obtaining the content similarity of the data string according to the number of the corresponding cross ratios of different cross ratios comprises the following steps:
for any one data string to be marked as a standard data string, calculating the cross ratio value between the standard data string and all other data strings, wherein the number of all other data strings is the number of the cross ratios, the obtained cross ratio values have the same value, the same cross ratio value has a plurality of cross ratios, the number of the cross ratios corresponding to each cross ratio value is obtained, and the probability of each cross ratio value is obtained by comparing the number of the cross ratios corresponding to each cross ratio value with the number of all the cross ratios;
in the method, in the process of the invention,represents the q-th cross ratio of the jth data string when the substring length is k,/>Representing the j-th data string when the substring length is kMinimum value of cross ratio, +.>Represents the maximum value of the cross ratio of the jth data string when the substring length is k,/>Representing the probability of the number of the corresponding cross ratios of the jth data string to the total cross ratio number when the length of the substring is k, and +.>And represents the content similarity of the jth data string when the substring length is k.
Preferably, the method for acquiring the adjacent string of each data string comprises the following steps:
after the information diffusion ratio of each data string is obtained, in one information group, for each data string, calculating the difference value of the information diffusion ratio of the data string and the data string of the data string, then sequencing the difference values in order from small to large, taking the rest data strings corresponding to the four smallest difference values as adjacent strings of the data string, and respectively marking as、/>、/>、/>。
Preferably, the method for obtaining the diffusion string according to the adjacent string, the data string and the adaptive constant and obtaining the information abstract of the original file according to the diffusion string comprises the following steps:
in the method, in the process of the invention,is a logical operator representing the logical exclusive OR operation on the data string, J is the corresponding operation sequence number of the data string J in the loop, ">Is the adaptive constant of the data string j when iterating>The calculation result in brackets is subject to right circulation, s is the step length of the right circulation, and ++>Representing the diffusion string corresponding to the jth data string.
The beneficial effects of the invention are as follows: the invention provides an intelligent management system for electronic seals, which constructs an iteration mapping rate based on the association degree between initial linking vectors and the regularity of a traditional constant in each round of circulation, wherein the iteration mapping rate considers the difference between input vectors of each round of circulation and the similarity degree between an input vector difference result and the traditional constant. And secondly, constructing an information diffusion ratio based on a segmentation result of the data strings in the information groups, and acquiring diffusion strings corresponding to the data strings in each information group based on the information diffusion ratio. The diffusion string has the advantages that the data string is characterized by utilizing the neighbor strings in the information group, the compression function of the traditional MD5 algorithm is not required to be changed in the four-round loop iteration process, the effects of diffusing in advance and accelerating the avalanche effect can be achieved, and the speed of loop iteration is accelerated while the relevance of MD5 is reduced. And the improved MD5 algorithm is utilized to acquire the information abstract in the original file, so that the safety of the subsequent digital signature is improved, and the safe operation of the electronic seal management system is facilitated.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions of the prior art, the drawings which are used in the description of the embodiments or the prior art will be briefly described, it being obvious that the drawings in the description below are only some embodiments of the invention, and that other drawings can be obtained according to these drawings without inventive faculty for a person skilled in the art.
FIG. 1 is a schematic flow chart of an intelligent management system for electronic seal according to an embodiment of the present invention;
FIG. 2 is a flow chart of an improved iterative operation of the link vector.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, a flowchart of an electronic seal intelligent management system according to an embodiment of the present invention is shown, where the system includes: the system comprises a data acquisition module, a self-adaptive constant acquisition module, an information diffusion ratio acquisition module, an information abstract acquisition module and an electronic seal management module.
The data acquisition module acquires an original file to which the electronic seal needs to be added by using the mobile terminal, and regards all text contents in the original file as an original character string, fills the original character string, and the filling process is as follows: all characters in an original character string are converted into hexadecimal forms by utilizing utf-8 coding, the hexadecimal after the conversion of the original character string is recorded as an original hexadecimal, the length of the original hexadecimal is represented by a 64-bit hexadecimal, then the original hexadecimal is filled, a 1 is filled behind an original hexadecimal result, then the original hexadecimal is always filled with 0 until the total bit length of the filled hexadecimal information meets the sum of (N x 512+448) bit, namely the multiple of 512 and 448, and finally a 64-bit hexadecimal number is filled behind the filled result, at this time, the filled 64-bit hexadecimal number is the length information of the original hexadecimal, so that the filling processing of the text content in the original file is completed, the hexadecimal is converted into the hexadecimal, and the specific process is not repeated. And secondly, dividing the filling result into information groups with the length of 512 bits, and recording the number of the information groups as K.
Up to this, K information sets are obtained.
The self-adaptive constant acquisition module, the security and reliability of the electronic seal intelligent management system depend on the encryption effect of the electronic seal, while the security encryption of the electronic seal is mainly concentrated in the generation process of a digital signature, wherein the digital signature refers to a piece of information formed by encrypting data to be transmitted, such as contracts, files, notices and the like, by using an encryption algorithm based on a certain data exchange protocol. In this embodiment, it is necessary to acquire the information digest from K information groups of the original file and encrypt the information digest using an encryption algorithm.
For each 512-bit information group as input, the MD5 output is the MD5 value corresponding to the information group, the MD5 value is a data string with a length of 128 bits, and the cascade value of four link variables corresponding to A, B, C, D is obtained by processing the information group by four-round loop iteration of A, B, C, D four link variables, A, B, C, D is each hexadecimal number of 128 bits, and the hexadecimal number of each link variable is regarded as a link vector.
Four rounds of loops are shared in the MD5 algorithm, each loop is recorded as a loop wheel, the calculation result is added with a constant t after each linked variable passes through a nonlinear logic function, each loop comprises 16 times of the operations, the four rounds of loops totally involve 64 constants, and the constant t used in the traditional MD5 algorithm has the following value rule:
in the method, in the process of the invention,constant for the ith iteration operation, i is the number of operations, and the value range of i is [1,64]。
When the MD5 values of K information groups are acquired using the MD5 algorithm,the distribution of the random digital signature has approximate periodicity with the distribution of the sin function, and constant values with a certain rule can increase the similarity and the relevance between MD5 values corresponding to different information groups.
And forming a constant sequence by all constants of each round of circulation, taking the four constant sequences obtained by four rounds of circulation as four row vectors, acquiring a matrix, wherein the size of the matrix is 4 x 16, and recording the matrix as an initial constant matrix. The smaller the distribution variance of the elements in the initial constant matrix is, the smaller the distribution variance between MD5 values calculated by using the constant value t is, so that the embodiment uses a random mapping method to adaptively obtain the constant corresponding to each operation in each cycle.
Specifically, the EDR editing distance of any two initial linking vectors between the four initial linking vectors is calculated, and the smaller the EDR editing distance between the two initial linking vectors, the fewer the number of modifications required for converting the two initial linking vectors into the same character string, the more detailed description will be omitted here.
Combining four initial link vectors into a sequence as an initial input sequence, obtaining a hurst index of the initial input sequence according to a round sequence, wherein the hurst index is a known technology, and is not repeated herein, and for each operation, the initial influence degree of a cycle wheel in which the hurst index is located is obtained according to the hurst index, and the formula is as follows:
in the method, in the process of the invention,indicating the initial influence of the nth cycle,/->Is the hurst index of the initial input sequence. />The larger the value of (c), the greater the impact of the initial linking vector on the nth round of iterative operation. The larger the long-term correlation between the initial link vectors, the larger the possibility of enhancing the correlation after a plurality of iterative operations, the larger the influence on the nth round of iterative operations, the +.>The greater the value of (2), the more forward the order of the n-th round of cycles proceeds>The larger the value of (c), the more affected the n-th round operation result is by the initial linking vector.
Calculating EDR editing distances of all any two link vectors in each circulation wheel, obtaining an average value of the EDR editing distances in each circulation wheel, obtaining the number of difference results of the link vectors in each circulation wheel, and obtaining the difference results; for example, the link vectors of the nth round have、/>、/>、/>4, 6 with a difference between them, a=1, are given>Is->、/>Difference between a=2, +.>Is->、/>Difference between a=3, +.>Is->、/>Difference between a=4, +.>Is->、/>Difference between a=5, +.>Is->、/>Difference between a=6, +.>Is->、/>And the difference results between them. And obtaining the mappable degree of each operation according to the vector corresponding to the difference result and the vector corresponding to the constant, wherein the formula is as follows:
in the method, in the process of the invention,is the mean value of the EDR edit distance of the link vector of the nth cycle wheel, +.>Hexadecimal code representing the conventional constant corresponding to the ith operation, length and linking vector are kept consistent,/>Indicating the a-th difference result of the n-th cycle,>indicating the mappable degree of the ith operation.
The smaller the number of edits between the link vectors converted into the same character string in the nth cycle of the ith operation, the smaller the average value of EDR edit distances,the smaller the value of (2), the binary coding result of the conventional constant +.>And do bad result->The smaller the difference between them, the stronger the correlation between the results of the ith iteration operation after the increase,/->The smaller the value of (2); i.e.The larger the value of (2), the larger the probability of enhancing the correlation between MD5 after the ith iteration operation reflected in the MD5 algorithm, the conventional constantThe more random mapping should be performed; />The greater the value of (c), the stronger the correlation between the results of the ith iterative operation, the more the constants of the ith operation should be randomly mapped.
And obtaining the iteration mapping rate of each operation according to the obtained mappable degree of each operation and the initial influence degree of each cycle, wherein the formula is as follows:
in the method, in the process of the invention,indicating the mappable degree of the ith operation, < +.>Indicating the initial influence of the nth cycle corresponding to the ith operation, +.>Representing the iterative mapping rate of the ith operation.
The iteration mapping rate considers the difference between cyclic link vectors of each round and the similarity between the link vector difference result and the traditional constant, and has the advantages that the adaptive constant random mapping can be carried out for each operation, the avalanche effect in the MD5 algorithm can be accelerated, and the relevance of MD5 values among different information groups is reduced.
Further, for each iteration operation in each round, the corresponding iteration mapping rate is obtained, the iteration mapping rate of each round is sequenced according to the operation sequence to obtain the mapping sequence of each round, and the matrix formed by the four rounds of mapping sequences is recordedFor mapping matrix, calculating cosine similarity Y between initial constant matrix and mapping matrix, and calculating average value of all conventional constantsThe conventional constant is added with->And cosine similarity Y (++>Y) as input to the Herong mapping (A->,/>) The adaptive constant in each iteration operation is obtained according to the output sequence of the Henon mapping, wherein the ernone mapping is a known technology, and a formula for obtaining the adaptive constant based on the ernone mapping is as follows:
in the method, in the process of the invention,is the i-th element in the output sequence after i iterations of given input post-ermo map,/>A constant corresponding to the ith operation, +.>Indicating the adaptive constant corresponding to the ith operation.
So far, the adaptive constant in each iterative operation process in the MD5 algorithm is obtained.
In the traditional MD5 algorithm, the information diffusion ratio acquisition module divides each information group with length of 512 bits into 16 data strings with 32 bits, and the 16 data strings are used for exchanging in 16 operations of the link vector in each round of four rounds of loops. However, text content with higher repetition rate is likely to appear in the original file, the relation between the information groups corresponding to the text content is relatively strong, and if the same data string is used for circulation, the similarity between MD5 values is further enhanced, so that the cracking performance of the content input into the encryption algorithm is increased.
For K information groups, 16K data strings will be obtained, each data string is divided into sub-strings with length K in turn, where the length of the sub-string needs to be divided by 16, and then all information groups containing each sub-string with different lengths are obtained, for example, when k=8 bits, each data string is divided into 4 sub-strings with length of 8 bits, K information groups will obtain 48K sub-strings, and the information groups existing in each sub-string with length of 8 bits are counted respectively. If one substring exists in a plurality of information groups, the fact that the same text appears in different sentences in the original file is indicated, the text can correspond to more information content, the information diffusion capability is relatively strong, and the relevance among the data strings with the text is strong.
For each data string, a plurality of sub-strings are obtained, wherein the sub-strings in the data string are called a sub-string set, namely, each data string corresponds to one sub-string set, and the cross-to-parallel ratio of the corresponding data strings is obtained according to the intersection and the union of any two sub-string sets, and the formula is as follows:
in the method, in the process of the invention,represents +.f. when substring length is k>Sub-string sets corresponding to the individual data strings, < +.>Represents +.f. when substring length is k>Sub-string sets corresponding to the individual data strings, < +.>When the length is k, the>Data string and->The cross ratio of the individual data strings. />Is the substring set->、/>Intersection between->Is the substring set->、/>Is a union of (1); />The greater the value of (a)Person, th->The higher the similarity between sub-strings of length k, the more the data strings correspond, wherein the result of both intersection and union is the number of sub-strings.
For the firstA data string, obtain->The number of all the cross ratios of the data strings with the rest of the data strings, and obtaining the cross ratio number corresponding to each cross ratio value, for example +.>The total of the data strings and the rest data strings is 200, wherein when the cross ratio is 20, the corresponding cross ratio number is 100, and when the cross ratio is 30, the corresponding cross ratio number is 100, namely, the (th) cross ratio>The total of 2 cross ratios is obtained by each data string and the rest data string, and the total of 200 cross ratios is obtained. Obtaining the +.f. according to the probability that the corresponding cross ratio number of each cross ratio value is the total cross ratio number>The content similarity of each data string when the substring length is k is as follows:
in the method, in the process of the invention,represents the q-th cross ratio of the jth data string when the substring length is k,/>Representing the minimum value of the cross ratio of the jth data string when the substring length is k,/>Represents the maximum value of the cross ratio of the jth data string when the substring length is k,/>Representing the probability of the number of the corresponding cross ratios of the jth data string to the total cross ratio number when the length of the substring is k, and +.>And represents the content similarity of the jth data string when the substring length is k. />The larger the value of (c) is, the stronger the association between the text content contained in the j-th data string and the text content of the data strings in the rest of the information groups is.
And averaging the content similarity of each character string under different sub-string lengths to obtain the information diffusion ratio of each character string, wherein the sub-string lengths are five of 1,2,4,8 and 16.
The information diffusion ratio reflects the degree of information diffusion between each data string and the remaining data strings. A data string j,The higher the repetition rate of the text in the original file is for the information set, the j-th and the +.>The higher the similarity between sub-strings of length k corresponding to the individual data strings, the sub-string set +.>、/>The more elements in the middle cross set +.>The greater the value of (2); the larger the value range of the sub-string cross-parallel ratio is, the more similar contents with different degrees are between the file contents corresponding to the jth data string and the file contents corresponding to the rest of the data strings, and the stronger the relevance between the text contents contained in the jth data string and the text contents of the data strings in the rest of the information groups is, the more the relevance is between the text contents contained in the jth data string and the text contents of the rest of the information groups is>The greater the value of (2); i.e. < ->The larger the value of (2), the dataThe easier the file content corresponding to the string is to be associated with the rest of the content in the original file, the stronger the information diffusion capability of the j-th data string is.
Thus, the information diffusion ratio of each data string is acquired.
And the information abstract acquisition module is used for calculating the difference value of the information diffusion ratio of each data string and the other data string in one information group after acquiring the information diffusion ratio of each data string, and then sequencing the difference values from small to large, wherein the smallest four are used as adjacent strings of the data string. For example, for the jth data string, the difference between the information diffusion ratio of the 16 data strings in the information group and the information diffusion ratio of the jth data string is calculated, the difference is sorted in the order of the absolute value from small to large, the earlier data string in the sorting result is more likely to contain the same content as the information diffusion capability of the jth data, the first 4 data strings in the sorting result are taken as the neighbor strings of the jth data string and are respectively marked as、/>、/>、/>。
The 16 32-bit data strings divided by each information group are diffused based on the neighbor strings of each data string and the adaptive constant of each operation, and the diffusion result corresponding to each data string is recorded as a diffusion string.
The procedure for obtaining the diffusion string for each data string is as follows:
the method comprises the steps of firstly carrying out exclusive-or operation sequentially according to adjacent strings from small to large, then carrying out exclusive-or operation on the adjacent strings and the self-adaptive constant of the iteration times of the data strings, then carrying out right circulation on operation results, stopping when the circulation bit times are s, and taking the checked value of s as 5. The formula is as follows:
in the method, in the process of the invention,is a logical operator representing the logical exclusive OR operation on the data string, J is the corresponding operation sequence number of the data string J in the loop, ">Is the adaptive constant of the data string j when iterating>The calculation result in brackets is right-looped, and s is the step length of the right loop.
Further, the compression function in the traditional MD5 algorithm is improved based on the diffusion string, the iterative operation flow chart of the improved link vectors is shown in fig. 2, four link vectors A, B, C, D in fig. 2,and s is a circulation step length, F represents a nonlinear function in the traditional MD5 algorithm, and then, the self-adaptive constant T is used as a constant in the MD5 algorithm, the information abstract of each information group is obtained based on the improved iterative operation flow, the follow-up process of the MD5 algorithm is a known technology, and the specific process is not repeated.
The method has the advantages that the data string is characterized by utilizing the neighbor strings in the information group based on the information diffusion ratio, the compression function of the traditional MD5 algorithm is not required to be changed in the four-round loop iteration process, the effects of diffusing in advance and accelerating the avalanche effect can be achieved, and the speed of loop iteration is accelerated while the relevance of MD5 is reduced.
So far, the modified MD5 algorithm is utilized to obtain the information abstract of the original file.
The electronic seal management module obtains the information abstract of the original information of the electronic seal to be added according to the steps, and realizes intelligent management of the electronic seal based on the information abstract.
1. Storing the seal picture, the seal certificate, the digital certificate and the private Key for digital signature in the USB Key together;
2. the method comprises the steps of obtaining an information abstract of an original file to be added with an electronic seal by utilizing an improved MD5 algorithm, and digitally signing the information abstract by utilizing an encryption algorithm;
3. performing related operation on the original file in the browser by using an ActiveX control technology;
4. inserting related information such as a digital signature, a seal certificate, a digital certificate and the like into a seal picture by utilizing a digital watermarking technology, and then inserting the seal picture containing watermark information into a proper position of an original file;
5. and (3) performing deprotection on the received original file, extracting an electronic seal from the original file, extracting watermark information from the electronic seal, verifying the digital signature of a signer by using a signature public key of a CA in the watermark information, checking whether a seal certificate and the digital certificate are valid or not, and decrypting a digital abstract in the digital signature by using a public key in the digital certificate. And finally restoring the document to a state before verifying the seal, acquiring the abstract of the document by using a hash function, comparing the abstract with the information abstract in the digital signature, and completing the verification of the electronic seal through a comparison result.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.
Claims (9)
1. An intelligent management system for an electronic seal is characterized by comprising the following modules:
the data acquisition module converts the original file into a plurality of information groups;
the self-adaptive constant acquisition module acquires a constant of each iteration operation according to a traditional method, acquires a link vector according to an information group, acquires an initial constant matrix according to the acquired constant, acquires an iteration mapping rate of each iteration operation according to an editing distance between the initial link vectors and a difference between the constant and each round of cyclic link vector, and acquires the self-adaptive constant according to the iteration mapping rate and the initial constant matrix;
the information diffusion ratio acquisition module is used for dividing the information group into a plurality of data strings, dividing each data string into sub-strings with the same length, obtaining the cross ratio of two data strings according to the ratio of the intersection of any one data string and the other data strings to the number of the union, and obtaining the content similarity of the data strings according to the number of the cross ratios corresponding to the different cross ratio; acquiring the content similarity of the same data string under different substring lengths, and acquiring the average value of the content similarity of the data strings under different lengths as the information diffusion ratio of each data string;
the information abstract acquisition module acquires a neighboring string of each data string, acquires a diffusion string according to the neighboring string, the data string and the self-adaptive constant, and acquires the information abstract of the original file according to the diffusion string;
the electronic seal management module is used for secondarily encrypting the information abstract of the original file and completing management of the electronic seal through digital signature;
the method for acquiring the adjacent string of each data string comprises the following steps:
after the information diffusion ratio of each data string is obtained, in one information group, for each data string, calculating the difference value of the information diffusion ratio of the data string and the data string of the data string, then sequencing the difference values in order from small to large, taking the rest data strings corresponding to the four smallest difference values as adjacent strings of the data string, and respectively marking as、/>、/>、/>。
2. The intelligent management system for electronic seal according to claim 1, wherein the method for converting the original file into a plurality of information groups is as follows:
and regarding all characters in the original file as an original character string, converting the original character string into hexadecimal, filling the original character string according to the length of the original character string, and dividing the original character string into a plurality of 512-bit information groups after filling.
3. The intelligent management system of electronic seal according to claim 2, wherein the method for filling the original character string according to the length of the original character string comprises the following steps:
the hexadecimal system converted by the original character string is marked as the original hexadecimal system, the length of the original hexadecimal system is expressed by a 64-bit hexadecimal system, a 1 is filled behind the original hexadecimal system result, then the original hexadecimal system is always filled with 0 until the total bit length of the filled hexadecimal system information is up to (N.512+448) bit, and finally the length of the original character string expressed by the bit is 64 more behind the filling result.
4. The intelligent management system of electronic seal according to claim 1, wherein the method for obtaining the link vector according to the information group is as follows:
each 512bit information group is equally divided into 4 segments, each segment is a 128bit data string, and the hexadecimal number of each data string is regarded as a link vector.
5. The intelligent management system of electronic seal according to claim 1, wherein the method for obtaining the initial constant matrix according to the obtained constant is as follows:
four rounds of iteration operation are shared in the MD5 algorithm, each round of iteration operation is carried out for 16 times, constants obtained by all iteration operation in each round are formed into a constant sequence, the constant sequence is ordered according to the sequence of the iteration operation, the constant sequence is used as a row vector, and the obtained row vector is ordered according to the round to obtain an initial constant matrix.
6. The intelligent management system of electronic seal according to claim 1, wherein the method for obtaining the iteration mapping rate of each iteration operation according to the editing distance between the initial link vectors and the difference between the constant and each round of cyclic link vectors is as follows:
the method comprises the steps of marking loops of each round as loops, calculating EDR editing distances of any two initial linking vectors in four initial linking vectors, marking a sequence of the four initial linking vectors as an initial input sequence, obtaining a Hurst index of the initial input sequence, obtaining initial influence degree of each loop according to the Hurst index of the initial input sequence and the loops of each loop, obtaining a plurality of difference results by taking difference among all EDR editing distances in each loop, obtaining the mappable degree of each operation according to the difference results, the constant EDR distance and the average value of the EDR distances of each loop, and obtaining the iterative mapping rate of each iterative operation by using the mappable degree of each iterative operation and the initial influence degree of each iterative operation in the loop.
7. The intelligent management system of electronic seal according to claim 6, wherein the method for obtaining the mappable degree of each operation according to the difference result, the constant EDR distance and the EDR distance average value of each cycle wheel is as follows:
in the method, in the process of the invention,EDR encoding of the link vector of the nth cycle wheelEditing the average value of the distance>Hexadecimal coding representing the conventional constant corresponding to the ith operation,/->Indicating the a-th difference result of the n-th cycle,>indicating the mappable degree of the ith operation.
8. The intelligent management system of electronic seal according to claim 1, wherein the method for obtaining the content similarity of the data string according to the number of the corresponding cross ratios of different cross ratios is as follows:
for any one data string to be marked as a standard data string, calculating the cross ratio value between the standard data string and all other data strings, wherein the number of all other data strings is the number of the cross ratios, the obtained cross ratio values have the same value, the same cross ratio value has a plurality of cross ratios, the number of the cross ratios corresponding to each cross ratio value is obtained, and the probability of each cross ratio value is obtained by comparing the number of the cross ratios corresponding to each cross ratio value with the number of all the cross ratios;
in the method, in the process of the invention,represents the q-th cross ratio of the jth data string when the substring length is k,/>Representing the minimum value of the cross ratio of the jth data string when the substring length is k,/>Represents the maximum value of the cross ratio of the jth data string when the substring length is k,/>Representing the probability of the number of the corresponding cross ratios of the jth data string to the total cross ratio number when the length of the substring is k, and +.>And represents the content similarity of the jth data string when the substring length is k.
9. The intelligent management system of electronic seal according to claim 1, wherein the method for obtaining the diffusion string according to the adjacent string, the data string and the adaptive constant and obtaining the information abstract of the original file according to the diffusion string comprises the following steps:
in the method, in the process of the invention,is a logical operator representing the logical exclusive OR operation on the data string, J is the corresponding operation sequence number of the data string J in the loop, ">Is the adaptive constant of the data string j when iterating>The calculation result in brackets is subject to right circulation, s is the step length of the right circulation, and ++>Representing the diffusion string corresponding to the jth data string.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310806115.9A CN116522300B (en) | 2023-07-04 | 2023-07-04 | Intelligent management system for electronic seal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310806115.9A CN116522300B (en) | 2023-07-04 | 2023-07-04 | Intelligent management system for electronic seal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116522300A CN116522300A (en) | 2023-08-01 |
| CN116522300B true CN116522300B (en) | 2023-09-08 |
Family
ID=87406706
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310806115.9A Active CN116522300B (en) | 2023-07-04 | 2023-07-04 | Intelligent management system for electronic seal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116522300B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117112513B (en) * | 2023-10-19 | 2023-12-29 | 北京点聚信息技术有限公司 | Intelligent storage method for dynamic key of electronic seal |
| CN117132242B (en) * | 2023-10-26 | 2024-01-23 | 北京点聚信息技术有限公司 | Electronic seal identity authority safety management method |
| CN117828683B (en) * | 2024-03-06 | 2024-04-30 | 北京点聚信息技术有限公司 | Layout file digital signature method and system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1514571A (en) * | 2002-12-16 | 2004-07-21 | ض� | Proof of using both fixed command plate and mobile command plate |
| CN103116871A (en) * | 2013-01-29 | 2013-05-22 | 福建师范大学 | Embedding method and extracting method for double fragile digital watermarks with robustness |
| CN112149062A (en) * | 2019-06-26 | 2020-12-29 | 中电万维信息技术有限责任公司 | Electronic seal generating method, device and system based on watermark and storage medium |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7240200B2 (en) * | 2002-09-26 | 2007-07-03 | International Business Machines Corporation | System and method for guaranteeing software integrity via combined hardware and software authentication |
| GB2443244A (en) * | 2006-10-05 | 2008-04-30 | Hewlett Packard Development Co | Authenticated Encryption Method and Apparatus |
-
2023
- 2023-07-04 CN CN202310806115.9A patent/CN116522300B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1514571A (en) * | 2002-12-16 | 2004-07-21 | ض� | Proof of using both fixed command plate and mobile command plate |
| CN103116871A (en) * | 2013-01-29 | 2013-05-22 | 福建师范大学 | Embedding method and extracting method for double fragile digital watermarks with robustness |
| CN112149062A (en) * | 2019-06-26 | 2020-12-29 | 中电万维信息技术有限责任公司 | Electronic seal generating method, device and system based on watermark and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于可变参数双向耦合映像系统的时空混沌Hash函数设计;刘建东;余有明;;物理学报(03);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116522300A (en) | 2023-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN116522300B (en) | Intelligent management system for electronic seal | |
| Zhu et al. | 2D logistic-modulated-sine-coupling-logistic chaotic map for image encryption | |
| Liu et al. | Color image encryption algorithm based on DNA coding and double chaos system | |
| CN107276744B (en) | File storage encryption method and system | |
| CN104270247B (en) | Suitable for the efficient general Hash functions authentication method of quantum cryptography system | |
| Khan et al. | A new hybrid image encryption algorithm based on 2D-CA, FSM-DNA rule generator, and FSBI | |
| CN110610105B (en) | Secret sharing-based authentication method for three-dimensional model file in cloud environment | |
| CN113255007B (en) | Safe hidden three-factor query method | |
| CN113938691B (en) | Reversible information hiding method for encrypted image | |
| CN110995415A (en) | Encryption algorithm based on MD5 algorithm | |
| CN113779355A (en) | Network rumor source tracing evidence obtaining method and system based on block chain | |
| Škorić | A trivial debiasing scheme for helper data systems | |
| Zhu et al. | Efficient and precise secure generalized edit distance and beyond | |
| CN110837659B (en) | Renewable digital signature method for private key with label and application of renewable digital signature method in PoS block chain protocol | |
| Sodhi et al. | An efficient hash algorithm to preserve data integrity | |
| CN108667619B (en) | White box implementation method and device for SM9 digital signature | |
| CN115828194A (en) | Data privacy protection method and detection method of privacy enhanced semi-blind digital fingerprint | |
| Ueno et al. | Rejection sampling schemes for extracting uniform distribution from biased pufs | |
| Sun et al. | A Novel Chaotic Image Encryption Algorithm Based on Coordinate Descent and SHA-256 | |
| Zhang et al. | A derivative matrix-based covert communication method in blockchain | |
| CN113806775A (en) | Block chain message processing method and device based on convolution optimization | |
| CN109450618B (en) | MD 5-based encryption method and system | |
| Gorbenko et al. | Analysis of Potential Post-Quantum Schemes of Hash-Based Digital Signatur | |
| Sahni | A review on cryptographic hashing algorithms for message authentication | |
| Gupta et al. | An Enhanced Security in Medical Image Encryption Based on Multi-level Chaotic DNA Diffusion |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |