CN102546185A - Data encrypting method and encrypted data transmitting device - Google Patents
Data encrypting method and encrypted data transmitting device Download PDFInfo
- Publication number
- CN102546185A CN102546185A CN2012100439414A CN201210043941A CN102546185A CN 102546185 A CN102546185 A CN 102546185A CN 2012100439414 A CN2012100439414 A CN 2012100439414A CN 201210043941 A CN201210043941 A CN 201210043941A CN 102546185 A CN102546185 A CN 102546185A
- Authority
- CN
- China
- Prior art keywords
- data
- length
- transmission
- enciphered
- random number
- 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.)
- Pending
Links
Images
Abstract
The invention provides a data encrypting method and an encrypted data transmitting device. The data encrypting method comprises the following steps: firstly, randomly capturing data W' with a reserved length k from transmission data W; generating a random number r by using the data W' as a seed, randomly calculating the length q and an initial point a of a data domain by using the r as the seed, and capturing the data from the transmission data W by using the q and the a as parameters so as to generate a data domain F; generating a public key E and a private key R by using the data domain F as a parameter; and finally, encoding the W by using the publish key E so as to obtain an encryption result Z. The invention further provides a data encrypting device, an encrypted data transmitting method, and the encrypted data transmitting device.
Description
Technical field
The present invention relates to data transmission method, relate in particular to data ciphering method and enciphered data transmission method.
Background technology
In order to realize being transmitted the confidentiality of data, people have taked a lot of measures, and one of them is exactly in the transmission data procedures, to encrypt the data that are transmitted, and the public, private key encryption system is typical case's representative of field of data encryption.This system is used a PKI and a private key, and PKI can openly transmit between the node of shared data, is used for enciphered data, to being transmitted derivative according to providing safeguard.But private key is maintained secrecy, and with node independently corresponding relation is arranged, and has only the private key of use could decipher the data with public key encryption.
Yet; The conventional cryptography system of similar this system that data transmission procedure adopts is faced with the challenge of quantum calculation invariably; For example, Shor algorithm (P.W.Shor, " the A1gorithms for quantum computation:Discretelog and factoring " of invention in 1994; Proceedings of the 35th Symposium On Foundations of Computer Science; 1994, pp.124-134.), can break through all public key cryptographies that can convert the GENERALIZED DISCRETE LINEAR RANDOM SYSTEM Fourier transform to polynomial time.The basic countermeasure of reply quantum calculation challenge is to adopt the mathematical method that can not convert DFT to set up the PKI system.For example the MQ system adopts multivariate quadratic polynomial public-key cryptosystem (Multivariate Quadratic Polynomials in Public Key Cryptosystem), utilizes the intractability of quadratic polynomial Indeterminate Equation Group that the encryption safe guarantee is provided.
2005, thought that by most cryptographists two strongly fortified big cryptographic algorithms (Global Access is with password standard MD5 and SHA-1) are broken, this explanation, the reliability of the static encryption system that dependence mathematics difficulty makes up is always relative.We can say that also traditional encryption is transmitted the general character of data method, is to rely on the mathematical method of ciphering process use or the difficulty of mathematical formulae that safety guarantee is provided.Yet; See that from the history development procedure of data encrypting and deciphering the safety that relies on the difficulty of the mathematical algorithm that ciphering process uses to be difficult to realize ideal merely is as long as exist the regularity of ciphering process; Cracking is exactly matter of time, the transfer of data of the safe coefficient that just is difficult to realize ideal.
Summary of the invention
The problem that the present invention solves is, the method and the device of the higher enciphered data of a kind of safe coefficient is provided, and the transmission method of enciphered data and device.
For addressing the above problem, the method for the enciphered data that the embodiment of the invention provides comprises:
The intercepting data W of subscribing length k at random from the transmission data W ';
With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
With data field F is that parameter generates PKI E and private key R;
With PKI E coding W, obtain encrypted result Z.
In the method embodiment of a preferred enciphered data, also comprise the steps:
Utilize sliding window technique processing encrypted Z as a result, generate the sequence label of quoting of said Z, with sequence label as new encrypted result.
The device of the enciphered data that the embodiment of the invention provides comprises the memory cell of storing data to be transmitted W, also comprises:
The random number unit; Obtain the transmission data W from memory cell; The data W of length k is subscribed in intercepting from W '; With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
Variable dynamic key unit is that parameter generates PKI E and private key R with data field F;
The scrambled unit with PKI E coding W, obtains encrypted result Z.
The transmission method of the enciphered data that the embodiment of the invention provides comprises the steps:
The intercepting data W of subscribing length k at random from the transmission data W ';
With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
With data field F is that parameter generates PKI E and private key R;
With PKI E coding W, obtain encrypted result Z;
Z and R are combined into new transmission data M transmission.
The transmitting device of the enciphered data that the embodiment of the invention provides comprises the memory cell of storing data to be transmitted W, also comprises:
The random number unit; Obtain the transmission data W from memory cell; The data W of length k is subscribed in intercepting from W '; With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
Variable dynamic key unit is that parameter generates PKI E and private key R with data field F;
The scrambled unit with PKI E coding W, obtains encrypted result Z;
The enciphered data processing unit is combined into new transmission data M transmission with Z and R.
Compare with existing static encryption method, the method that the embodiment of the invention provides has the following advantages:
1, variable at random.Data intercept W ' produces a random number r as seed at random from the transmission data W; Again with length q and the starting point a of r as seed stochastic calculation data field; Generate the data field F of randomness with q and a data intercept that is parameter from the transmission data W, and be that parameter generates PKI E and private key R with data field F; Calculate the data basis of encrypting the factor owing to do seed with random parameter; Different with random number and change as the data of seed with the difference of transmission data; Also owing to encrypt the randomness on basis, promptly the randomness of data field F causes the different encrypted result, and this encryption method is all being upgraded encryption parameter in each data encryption and transmission course; Have no rule to say, therefore have the confidentiality of higher degree.
2, dynamic multi.In each data encryption process, the basis-data field F that produces as key is in the dynamic change.And encryption method itself also can be through multiple householder method, and for example multiple mode such as label encryption is further handled, and the form of label also has extremely good data compression ability and randomness cryptographic capabilities, has further guaranteed the effect of data encryption.
3, encryption method has disposable effect.Because encryption key promptly disappears after receiving node obtains the result, also no longer included effect even intercept and capture, these characteristics have determined ciphering process and method to duplicate, and can not utilize any method deciphering beyond the data itself even intercept and capture the data of transmission.
In sum, the method that provides of the embodiment of the invention has high encryption safe guarantee.
Description of drawings
Fig. 1 is the method embodiment flow chart of enciphered data;
Fig. 2 is the device embodiment block diagram of enciphered data;
Fig. 3 is the transmission method embodiment flow chart of enciphered data;
Fig. 4 is transmitting device embodiment 1 block diagram of enciphered data;
Fig. 5 is transmitting device embodiment 2 block diagrams of enciphered data.
Embodiment
At first with reference to figure 1 said embodiment.According to this embodiment, but to encrypt what adopt be variable and cryptographic means stochastic and dynamic for our primary data.At first, disposable the reading in perhaps of transmission data W to be encrypted is read in the internal memory or high-speed cache of computer system with the data flow mode, with the generation basis of W as encryption key in step 11.But the length of W is uncertain, simply produces the basis with W as key and can make the consumption of computational resource become uncertain, thereby make the product of this method of the application unstable properties that becomes, and therefore, this example has adopted a kind of way of relative optimization.Way is, preestablishes a constant k, the intercepting data W of subscribing length k at random from the transmission data W ', with the basis of W ' as encryption key.In general application, the length of W is usually greater than k, and at this moment obtaining of W ' is exactly intercept operation; And the starting point of this intercept operation is at random, and also promptly, the starting point of intercept operation is to satisfy the random start that reliably is truncated under the W ' prerequisite; To strengthen the randomness of W '; Need explanation, confirm that the random start of intercepting is very easy to accomplish that this repeats no more.In special application, at this moment W length can be about to the whole interceptings of W as W ' with W directly as W ' less than k, solves the stochastic problems of W ' with the randomness of W.In other example, stable and further increase randomness for the length that makes W ', also take the interception way of following further optimization: the length of more said transmission data W and k, when the two was equal, intercepting W's was whole in W '; When the length of W greater than k, from W at random the length of intercepting k as W ', when the length of W less than k, in W ', replenish random number, make the length of W ' equal k, that is, and with replenishing W after the random number as W '.
Said k is one and rule of thumb perhaps tests an experience digit of confirming; For example 1M or 100K; Purpose is to make the base fixed that produces encryption key, makes present embodiment can adapt to current main flow computer preferably, and further impels the algorithm of realizing this data cutout operation succinct.
The 12nd step is with data W ' be that seed produces a random number r.The method that produces random number is a lot, for example:
（1）r=（∑(W’)?mod?C）;
That is, random number r equals data " number " summation of W ', again with the constant C modular arithmetic after remainder.Constant C has very big arbitrariness, and common scope is 1 to ∑ (W ')-1.For example, W ' is following hexadecimal data sequence: 21458F2AD2, and then the hexadecimal of ∑ (W ') is:
∑ (W ')=2+1+4+5+8+F+2+A+D+2; The decimal system is:
∑(W’)=?2+1+4+5+8+15+2+10+13+2=62。
See this constant C ∈ [1,61] from decimal system angle.
（2）r=HASH(W’)；
Promptly finding the solution r with known hash algorithm gets final product.
The purpose of step 12 is further to increase the randomness basis for subsequent step.
The 13rd step again with length q and the starting point a of r as seed stochastic calculation data field, is that parameter data intercept from the transmission data W generates data field F with q and a.This step most important work is the length q and the starting point a of stochastic calculation data field, because the essence of computational length q and starting point a is the calculating of random number, also has several different methods can accomplish this calculating, for example:
Q=(f (r) mod C1)+C2; Wherein, F can be the function of arbitrary linear or any complexity such as non-linear; Constant C 2 is the minimum number of bits that produce valid data territory F; The size of this numerical value can rule of thumb or be tested and confirm, C1+C2 is the maximum number of digits that produces valid data territory F, so the size of C1 can rule of thumb or be tested and confirm.
Suppose, the length=p+q of data W, wherein length p can regard the redundant length that produces starting point a, p as>0.In the reality, in order to obtain the value of a, usually rule of thumb or experiment confirm that p is a fixing constant C, at this moment, have several different methods to obtain a, for example:
a=g(r)?mod?C。
In this example, when W < during p+q, fills random number usually, makes W=p+q in W.Certainly, fill random number and do not destroy original transmission data W, for example W is copied to and accomplish this operation in the memory, this repeats no more.
The 14th step is that basis or parameter generate PKI and private key with data field F.The essence of PKI and private key; Be function and corresponding inverse function, can realize with general inverible transform function, concrete like linear inverible transform function, non-linear inverible transform function or the like; Use the inverse function of these transforming function transformation functions, just can access PKI and private key.Therefore, can use a lot of known method to realize this step.For increasing the effect of present embodiment, adopt following manner to generate PKI and private key:
At first, select positive integer m, n, wherein, and m>n, and m, n is less than the data length of data field F.
Secondly, the element x among the selection territory F
iAnd y
j, and 1≤i≤m, 1≤j≤n; Make x=(x
1..., x
m), y=(y
1..., y
n), x, y be the vector for being made up of the element among the F of territory all;
Generation includes E (x)) PKI, wherein, E (x) be on the F of territory from x=(x
1..., x
m) to y=(y
1..., y
n) the Nonlinear Mapping group of functions; And, being implied with interface function R (x) among the said E (x), it is used for (the x according to x=
1..., x
m) obtain n about x=(x
1..., x
m) function, R (x)=(u
01(x
1..., x
m) ..., u
0n(x
1..., x
m));
Generate and the corresponding private key of said PKI, said private key comprises R (x).
Wherein, the process that generates the PKI include E (x) is:
At first select the element a among the F of territory
i, 1≤i≤n; N less than and the data length of territory F, (a
1..., a
n) vector formed by the element among the F of territory.Choose s+1 the Reversible Linear Transformation T=(T of n unit on the F of territory then
1..., T
i..., T
S+1), wherein, each T
iComprise on n the territory F about (a
1..., a
n) n unit linear polynomial; Choose s the reversible nonlinear transformation G=(G of n unit on the F of territory again
1..., G
i..., G
s), wherein, each G
iComprise on n the territory F about (a
1..., a
n) function, said function can be various type function such as multinomial, rational fraction.At last, according to presetting rule, synthetic said u
0(x), T and G, obtain the Nonlinear Mapping group of functions from x to y:
(y
1，…，y
n)=?E(x)=?(E
1(x
1，…，x
m)，…，E
n(x
1，…，x
m));
Wherein, u
0(x)=(u
01(x
1..., x
m) ..., u
0n(x
1..., x
m)).
Choose among the E (x) the individual function of n ' as E ' (x), obtain PKI, n '<n; Wherein, E ' contains relevant for (x in (x)
1..., x
m) function;
E’(x)＝(E
1(x
1，…，x
m)，…，E
n’(x
1，…，x
m))。
The process that generates private key is:
Generate the inverse function T of T
-1Generate the inverse function G of G
-1By T
-1And G
-1Calculate D (y); Generate private key, said private key comprises R (x) and D (y),
Said presetting rule can be provided with according to actual conditions.For example, if the E ' that obtains of expectation contains relevant for (x in (x)
1..., x
m) rational fractional function, then said presetting rule can be following two kinds of situation:
Group of functions u
0(x) be updated to T
1, T
1, be updated to G
1, G
1Be updated to T
2, T
2Be updated to G
2, T
jBe updated to G
j, T
sBe updated to G
s, G
sBe updated to T
S+1
Perhaps, only group of functions u
0(x) be updated to T
1, T
1, be updated to G
1, G
1Be updated to T
2, T
2Be updated to G
2, T
jBe updated to G
j, T
sBe updated to G
s
For above-mentioned two kinds of possible modes, be linear transformation T when at last
S+1The time, obtaining the PKI of rational fraction, the denominator multinomial of its each rational fraction is identical; When at last is nonlinear transformation G
sThe time, the denominator multinomial of each rational fraction is all different usually in its PKI.Usually give tacit consent to identical denominator in the practice, can save the PKI memory space, improve arithmetic speed.
The 15th step with PKI E coding transmission data W, obtains encrypted result Z.
In order further to improve the cracked difficulty of enciphered data method; Strengthen the degree of its randomness; Another embodiment further utilizes sliding window technique processing encrypted Z as a result, generates the sequence label of quoting of said Z, with sequence label as new encrypted result.
Generation is quoted label and can be accomplished according to known method.Specifically can be: the repeat property that shows according to repeating data; The character string that constitutes of the character of special neighbourhood for example; Confirm a plurality of data segments that satisfy this characteristic requirements as much as possible, be the unduplicated each other label of quoting of these data segment settings, quote label and said data segment binds together said; Be stored into database, i.e. the relational database of label and data segment contrast.
Confirm the label of quoting of a data sequence, can utilize a fingerprint function and a window, through the said window of dynamic adjustment; Data flow to input; Confirm a series of cut-point from a direction, utilize said cut-point to cut apart said data flow, the one or more data segments of intercepting; At least one data segment of storing in said data segment and the said database is identical, and remaining data are assembled into new data flow in data segment and the data flow that label replaces intercepting with quoting then.
For example; Suppose to transmit data W and regard directive input traffic as; Stablize the input back from the one or more data segments of data flow afterbody direction intercepting from the inflow direction or the data flow of data; As long as at least one data segment of storing in the said data segment of intercepting and said first database is identical; Just can think that this data segment is a predetermined high recurrence probability data segment, just can be assembled into new data flow with remaining data in the data segment of quoting label replacement intercepting and the data flow according to the binding relationship of quoting label and said data segment in the said database.Because the generation of data can be adopted relevant algorithm with the intercepting of data segment, therefore, is easy to from a data flow at random, find the data segment of high recurrence probability, thereby can realize reducing the data volume of actual transmissions with quoting the transmission of label surrogate data method section.
How the data segment that is partitioned into need not consider this data segment other data on every side.An aspect of definite process of above-mentioned label will be cut apart the input data exactly; In cutting procedure, identify " cut-point "; If a splitting scheme is reasonable in design, appropriate, the end points of data segment is for same data segment, and it should have identical repeatability; Appear at identical place, and need not consider these data occur in which type of content.Therefore, have the repeated data segment of corporate data characteristic, just can split with a kind of same method in the data those.
One of concrete data splitting scheme is to use the information in the data itself to remove to guide this cutting procedure, imposes on cutting procedure and need not be the sort of define parameter etc. to block size, transmission from the outside.
After the input data process that is encoded consumes; The various values and the structure of input data will remove to guide cutting procedure; Through being used to handle input traffic this cut apart the guiding of input content; Just can seek the very big repeating data of time span out, and the data that will not analyze reanalyse one time.As long as similar data were occurred in the process of input data, no matter its wherein, same data segment will come to light, thereby obtains the data segment of repetition and need not the replicate analysis data.
Yet; Although the data of input have certain data characteristic; But because the randomness that at every turn needs the data of processing to have; With the cutting apart of content vectoring information of input data, in fact just maximum in the size of cutting apart the data segment that obtains, and find a balance point in the contradiction of the quantity of repeating data section between at most.
It may be noted that; Other be among the method embodiment of enciphered data on basis with embodiment illustrated in fig. 1, can not adopt step 11, the random number r that step 12 produces also can be a random number or be the random number of seed with the arbitrary data arbitrarily; Even cancellation step 12; Only in step 13 with any random number as seed, be that sample generates data field F with any random data sequence, like this; The method of data encryption will consume computational resource still less, and the randomness of sacrificing is extremely limited.
Fig. 2 is the device embodiment block diagram of enciphered data.
Embodiment illustrated in fig. 2 have four unit, memory cell 21, random number unit 22, variable dynamic key unit 23 and a scrambled unit 24.Memory cell 21 is memory storage, and the transmission data W of reading in from system's external memory storage just is stored in this unit.Memory cell 21 and random number unit 22, and scrambled unit 24 directly connects, and variable dynamic key unit 23 is connected between random number unit 22 and the scrambled unit 24.
The transmission data W is obtained from memory cell in random number unit 22 wherein, and the data W of length k is subscribed in intercepting from W ', with data W ' be that seed produces a random number r, again with length q and the starting point a of r as seed stochastic calculation data field.The effect of q and a is the parameter that generates data field F as data intercept from the transmission data W.
For making random number unit 22 have higher efficient, in a further embodiment, random number r also can be a random number or be the random number of seed with the arbitrary data arbitrarily; And; As seed, is that sample generates data field F with any random data sequence, like this with any random number; Random number unit 22 will consume computational resource still less, and the randomness of sacrificing is extremely limited.
In practical application; W length maybe greater than, equal or less than k; Be the stable complexity that reduces algorithm of length that makes W ', and further increase the randomness of random number r, this example is taked following data W interception way: the length of more said transmission data W and k; When the two was equal, intercepting W's was whole in W '; When the length of W greater than k, from W at random the length of intercepting k as W ', when the length of W less than k, in W ', replenish random number, make the length of W ' equal k, that is, and with replenishing W after the random number as W '.
With data W ' be that seed produces a random number r.The method that produces random number is a lot, for example:
（1）r=（∑(W’)?mod?C1）+C2;
That is, random number r equals data " number " summation of W ', again with constant C 1 modular arithmetic after remainder.Constant C 1 has very big arbitrariness, and common scope is 1 to ∑ (W ')-1.
（2）r=HASH(W’)；
Hash function HASH () should be able to guarantee r more than or equal to C2, and this is easy to accomplish, promptly finds the solution r with known hash algorithm.
Also there is several different methods can accomplish this calculating with r as the quantity p of seed stochastic calculation key, for example:
P=(f (r) mod C)+1; Wherein, f can be the function of arbitrary linear or any complexity such as non-linear, constant C promptly can be rule of thumb or experiment confirm, also can confirm, so that present embodiment adapts to computer system better according to the performance of computer systems of using present embodiment.For example, at the initial phase of system start-up, the data-handling capacity between the negotiation data Transport endpoint is confirmed the numerical value of C according to said disposal ability in advance, has much owing to confirm the method for C, and this repeats no more.
With the operation of r as the length q and the starting point a of seed stochastic calculation data field, also be the calculating operation of random number in essence, also there is several different methods to accomplish.For example:
Q=(f (r) mod C1)+C2; Wherein, F can be the function of arbitrary linear or any complexity such as non-linear; Constant C 2 is the minimum number of bits that produce valid data territory F; The size of this numerical value can rule of thumb or be tested and confirm, C1+C2 is the maximum number of digits that produces valid data territory F, so the size of C1 can rule of thumb or be tested and confirm.
Suppose, the length=p+q of data W, wherein length p can regard the redundant length that produces starting point a, p as>0.In the reality, in order to obtain the value of a, usually rule of thumb or experiment confirm that p is a fixing constant C, at this moment, have several different methods to obtain a, for example:
a=g(r)?mod?C。
In this example, when W < during p+q, fills random number usually, makes W=p+q in W.Certainly, fill random number and do not destroy original transmission data W, for example W is copied to and accomplish this operation in the memory, this repeats no more.
Variable dynamic key unit 23 is that basis or parameter generate PKI and private key with data field F.
Can use a lot of known method to generate the public, private key sequence.For example, for increasing the cryptographic capabilities of key itself, adopt following manner to generate PKI and private key:
At first, select positive integer m, n, wherein, m>n, and m, n is less than with data W ' serve as the data length of the subclass of basis generation.
Secondly, as data field F, select the element x among the F of territory with this subclass
iAnd y
j, and 1≤i≤m, 1≤j≤n; Make x=(x
1..., x
m), y=(y
1..., y
n), x, y be the vector for being made up of the element among the F of territory all;
Generation includes E (x)) PKI, wherein, E (x) be on the F of territory from x=(x
1..., x
m) to y=(y
1..., y
n) the Nonlinear Mapping group of functions; And, being implied with interface function R (x) among the said E (x), it is used for (the x according to x=
1..., x
m) obtain n about x=(x
1..., x
m) function, R (x)=(u
01(x
1..., x
m) ..., u
0n(x
1..., x
m));
Generate and the corresponding private key of said PKI, said private key comprises R (x).
Scrambled unit 24 reads the transmission data W of storage from memory cell 21, with PKI E coding W, obtains encrypted result Z.
Need explanation, the encrypted result Z behind the coding can be transferred to memory cell 21 storing waiting, also can be transferred to and (not draw) storing waiting in other memory cells among the figure.
In order further to improve the cracked difficulty of enciphered data method; Strengthen the degree of its randomness; In a further embodiment, also comprise a label ciphering unit that is connected with scrambled unit 24, this unit by using sliding window technique processing encrypted is Z as a result; Generate the sequence label of quoting of said Z, with sequence label as new encrypted result Z.
Fig. 3 is the transmission method embodiment flow chart of enciphered data;
Can know that by Fig. 3 embodiment illustrated in fig. 3 and embodiment illustrated in fig. 1 comparing increased step 16.Among Fig. 3, step 11 is ciphering process of transmission data W to step 15, and step 16 is the processes with the encrypted result transmission.For making the node that receives enciphered data can decipher the enciphered data that receives, need the private key of encrypted result Z and deciphering usefulness be sent to receiving node in the lump, be about to Z and private key sequence R and be combined into new transmission data transmission.For making receiving node can access Z and R, for example adopt following way:
Calculate R
iMaximum length, each R is mounted in the data frame of a regular length of making according to this length, comprise data such as knowledges of data head, tail tag knowledge, R and R identification marking in this data frame, formation private key data frame R is as a concrete R
iLength hour also has the random number of filling in this data frame, according to common practise, at this moment need increase some data necessary signs, and this does not give unnecessary details.To or be combined into a data sequence by the data frame Z of the Z-shaped one-tenth of encrypted result and R tissue and just form new transmission data.Certainly, different according to the agreement of organizing the data thinking, in data frame and/or new transmission data, also have the data that other identification data structures are used, even the random number of filling, or the like, this is easy to do.The simplest way is exactly data structure organization Z and R by appointment, for example organizes Z and R with the mode of sequential combination, realizes extremely easily that in view of this this repeats no more.
Need explanation, in a further embodiment, each transfer of data is the data structure of agreement or definite Z and R immediately all, and the purpose of doing like this is that the data after the combination more are difficult to by discrimination, only need in this structure, increase the sign of necessity, can realize organizing Z and R
iRandomness, thereby further increase the difficulty that data are cracked.
Fig. 4 is transmitting device embodiment 1 block diagram of enciphered data.
Can know that by Fig. 4 embodiment illustrated in fig. 4 and embodiment illustrated in fig. 2 comparing increased the enciphered data processing unit 25 that is connected with scrambled unit 24, only enciphered data processing unit 25 is described at present.
Can decipher the enciphered data that receives for making the node that receives enciphered data; Enciphered data processing unit 25 need be sent to receiving node in the lump with the private key of encrypted result Z and deciphering usefulness, is about to Z and private key sequence R and is combined into new transmission data and sends and/or store.The simplest way is exactly data structure organization Z and R by appointment, for example organizes Z and R with the mode of sequential combination, realizes extremely easily that in view of this this repeats no more
In the reality, the encrypted result Z that enciphered data processing unit 25 organizes data to use derives from memory cell 21 or scrambled unit 24, and this depends on the real-time degree of data transmission procedure.
In the transmitting device embodiment of other enciphered data, also comprise the tag unit 26 that is connected with the enciphered data processing unit is set, with reference to the output result of figure 5. these unit reception enciphered data processing units, i.e. Z and private key sequence R
iThe new transfer data M that is combined into utilizes sliding window technique to handle M, generates the sequence label of quoting of said M, and send and/or store as last encrypted result with sequence label, thus further compress-encrypt M.
Claims (9)
1. the method for an enciphered data is characterized in that comprising:
The intercepting data W of subscribing length k at random from the transmission data W ';
With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
With data field F is that parameter generates PKI E and private key R;
With PKI E coding W, obtain encrypted result Z.
2. the method for enciphered data according to claim 1 is characterized in that also comprising:
Utilize sliding window technique processing encrypted Z as a result, generate the sequence label of quoting of said Z, with sequence label as new encrypted result.
3. the method for enciphered data according to claim 1 and 2 is characterized in that:
The length of more said transmission data W and k, when the two is equal, with W as W '; When the length of W greater than k, from W at random the length of intercepting k as W ', when the length of W less than k, in W, replenish random number, make the length of W equal k, with replenishing W after the random number as W '.
4. the method for enciphered data according to claim 3 is characterized in that:
With data F is parameter, utilizes non-linear invertible function to generate PKI E and private key R.
5. the device of an enciphered data comprises the memory cell of storing data to be transmitted W, it is characterized in that also comprising:
The random number unit; Obtain the transmission data W from memory cell; The data W of length k is subscribed in intercepting from W '; With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
Variable dynamic key unit is that parameter generates PKI E and private key R with data field F;
The scrambled unit with PKI E coding W, obtains encrypted result Z.
6. the transmission method of an enciphered data is characterized in that comprising:
The intercepting data W of subscribing length k at random from the transmission data W ';
With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
With data field F is that parameter generates PKI E and private key R;
With PKI E coding W, obtain encrypted result Z;
Z and R are combined into new transmission data M transmission.
7. the transmission method of 6 enciphered datas according to claim 6 is characterized in that:
Confirm the data structure of combination Z and R, be used to make up Z and R.
8. the transmitting device of an enciphered data comprises the memory cell of storing data to be transmitted W, it is characterized in that also comprising:
The random number unit; Obtain the transmission data W from memory cell; The data W of length k is subscribed in intercepting from W '; With data W ' be that seed produces a random number r, again with length q and the starting point a of r, be that parameter data intercept from the transmission data W generates data field F with q and a as seed stochastic calculation data field;
Variable dynamic key unit is that parameter generates PKI E and private key R with data field F;
The scrambled unit with PKI E coding W, obtains encrypted result Z;
The enciphered data processing unit is combined into new transmission data M transmission with Z and R.
9. the transmitting device of enciphered data according to claim 8 is characterized in that also comprising the label compress-encrypt unit that is connected with the enciphered data processing unit;
Said label compress-encrypt unit, the output of reception enciphered data processing unit is M as a result, utilizes sliding window technique to handle M, generates the sequence label of quoting of said M, and sends as last encrypted result with sequence label.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100439414A CN102546185A (en) | 2012-02-26 | 2012-02-26 | Data encrypting method and encrypted data transmitting device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012100439414A CN102546185A (en) | 2012-02-26 | 2012-02-26 | Data encrypting method and encrypted data transmitting device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102546185A true CN102546185A (en) | 2012-07-04 |
Family
ID=46352200
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012100439414A Pending CN102546185A (en) | 2012-02-26 | 2012-02-26 | Data encrypting method and encrypted data transmitting device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102546185A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897410A (en) * | 2014-12-08 | 2016-08-24 | 深圳市创成微电子有限公司 | Audio frequency chip spi communication encryption method |
| CN106407750A (en) * | 2015-08-03 | 2017-02-15 | 天脉聚源（北京）科技有限公司 | A method and a system for random generation of the serial numbers of courses |
| CN109286978A (en) * | 2018-10-15 | 2019-01-29 | 广州科语机器人有限公司 | A kind of network-building method, device, terminal device and storage medium positioning network |
| CN112039657A (en) * | 2020-07-20 | 2020-12-04 | 北京邮电大学 | Method, device, equipment and storage medium for generating key |
| CN115913553A (en) * | 2023-03-08 | 2023-04-04 | 广东广宇科技发展有限公司 | Data encryption method based on nonlinear mapping |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070255959A1 (en) * | 2006-04-27 | 2007-11-01 | Samsung Electronics Co. Ltd. | Communication apparatus and communication method thereof |
| CN101340279A (en) * | 2008-07-09 | 2009-01-07 | 深圳市金蝶移动互联技术有限公司 | Method, system and apparatus for data ciphering and deciphering |
| CN101540673A (en) * | 2009-04-24 | 2009-09-23 | 武汉大学 | Public key encryption and decryption method and digital signature method thereof |
| CN102012993A (en) * | 2010-11-29 | 2011-04-13 | 北京卓微天成科技咨询有限公司 | Methods and devices for selectively encrypting and decrypting data |
-
2012
- 2012-02-26 CN CN2012100439414A patent/CN102546185A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070255959A1 (en) * | 2006-04-27 | 2007-11-01 | Samsung Electronics Co. Ltd. | Communication apparatus and communication method thereof |
| CN101340279A (en) * | 2008-07-09 | 2009-01-07 | 深圳市金蝶移动互联技术有限公司 | Method, system and apparatus for data ciphering and deciphering |
| CN101540673A (en) * | 2009-04-24 | 2009-09-23 | 武汉大学 | Public key encryption and decryption method and digital signature method thereof |
| CN102012993A (en) * | 2010-11-29 | 2011-04-13 | 北京卓微天成科技咨询有限公司 | Methods and devices for selectively encrypting and decrypting data |
Non-Patent Citations (1)
| Title |
|---|
| 王勇: "基于内容加密的密码体制及其实现", 《计算机工程》 * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105897410A (en) * | 2014-12-08 | 2016-08-24 | 深圳市创成微电子有限公司 | Audio frequency chip spi communication encryption method |
| CN106407750A (en) * | 2015-08-03 | 2017-02-15 | 天脉聚源（北京）科技有限公司 | A method and a system for random generation of the serial numbers of courses |
| CN109286978A (en) * | 2018-10-15 | 2019-01-29 | 广州科语机器人有限公司 | A kind of network-building method, device, terminal device and storage medium positioning network |
| CN109286978B (en) * | 2018-10-15 | 2020-11-17 | 广州科语机器人有限公司 | Networking method and device of positioning network, terminal equipment and storage medium |
| CN112039657A (en) * | 2020-07-20 | 2020-12-04 | 北京邮电大学 | Method, device, equipment and storage medium for generating key |
| CN112039657B (en) * | 2020-07-20 | 2021-05-25 | 北京邮电大学 | Method, device, equipment and storage medium for generating key |
| CN115913553A (en) * | 2023-03-08 | 2023-04-04 | 广东广宇科技发展有限公司 | Data encryption method based on nonlinear mapping |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Raman et al. | Distributed storage meets secret sharing on the blockchain | |
| NL2013520B1 (en) | Public-key encryption system. | |
| NL2013944B1 (en) | Public-key encryption system. | |
| JP6067932B2 (en) | Key sharing device and method | |
| Hoang et al. | A secure searchable encryption framework for privacy-critical cloud storage services | |
| WO2006118171A1 (en) | Electronic information storage method and device, electronic information division storage method and device, electronic information division restoration processing method and device, and program thereof | |
| Jayapandian et al. | Secure and efficient online data storage and sharing over cloud environment using probabilistic with homomorphic encryption | |
| US8180048B2 (en) | Method and system for computational transformation | |
| CN112543187A (en) | Industrial Internet of things safety data sharing method based on edge block chain | |
| CN105379173A (en) | System for sharing a cryptographic key | |
| CN102546185A (en) | Data encrypting method and encrypted data transmitting device | |
| Abadi et al. | Feather: Lightweight multi-party updatable delegated private set intersection | |
| CN102611550A (en) | Method for encrypting data and method for transmitting encrypted data | |
| CN116488814A (en) | FPGA-based data encryption secure computing method | |
| Li et al. | Fully homomorphic encryption with table lookup for privacy-preserving smart grid | |
| CN109560930B (en) | Quantum cloud computing method and system, client and cloud server | |
| CN111798236B (en) | Transaction data encryption and decryption methods, devices and equipment | |
| US10331913B2 (en) | Searchable symmetric encryption with enhanced locality via balanced allocations | |
| RU2533087C2 (en) | Cryptography with parameterisation on elliptic curve | |
| CN102624527A (en) | Method and device for encrypting data and transmission method and transmission device of encrypted data | |
| CN101471779B (en) | Method, equipment and system for verifying integrity of verified data | |
| CN115883212A (en) | Information processing method, device, electronic equipment and storage medium | |
| EP3959841B1 (en) | Compression and oblivious expansion of rlwe ciphertexts | |
| Jahan et al. | An algorithm to secure data for cloud storage | |
| CN111931204A (en) | Encryption and de-duplication storage method and terminal equipment for distributed system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20120704 |