CN101388769A - Enforcement method for obtaining definite sequence ciphering method - Google Patents

Abstract

The invention relates to the enciphering field of symmetrical keys, a KY enciphering method (an encrypting method of obtaining definite sequences) comprises the following steps: enabling a disposable filling encryption to obtain a plurality of various long sequences through a disposable conversation key K, realizing the self cascade connection by the 'center method'based on long sequences, taking a position which is determined by a certain sub-key value as the center on a PBS sequence loop from a public opened data sequence, obtaining corresponding codes through being symmetric one by one and connecting the corresponding codes in series, and forming a sub-sequence which is corresponding to the sub-key, preventing the similarity possibility of the sub-sequence, carrying out the 'P'-row cascade connection, taking one of the sub-sequence as an address pointer, and resetting the other sub-sequence code and outputting after the sub-sequence forms two sub-sequence cascade connection, enabling the finally obtained disposable quantitative massive type long-sequence to be irregular and non-linear and to have no period, no effective relationship with the K and have key spaces through combining the 'center method'and the 'P'-row cascade connection, thereby enabling the disposable code sequence to be really practical.

Description

A kind of strong method that adds of obtaining definite sequential encryption method

Technical field: the cryptography symmetric key, disposable padding sequence method is encrypted

Background technology:

We know that when block cipher was handled plaintext, same function was used to encrypt continuous clear packets, are with fixing enciphering transformation one group of character of clear-text message to be encrypted simultaneously; And stream cipher is the encryption of expressly carrying out with the transfer pair that constantly changes, if ciphertext block and clear packets are independent irrelevant on statistics, this password just provides perfact secrecy so.Once fill to encrypt to provide and improve the enciphered method of maintaining secrecy, however since the bit that is difficult to obtain length expressly usually to expressly by bit encryption, and the safe transfer of the code book of once filling and keeping problem make it can't be in the face of extensive, in many ways and practical.

Utilize disposable sequence to be used as disposable filling code book and encrypt, at first will solve the safe transfer of code book, the management of code book, and the source size issue of code book.The problems referred to above have been to propose a solution in 2007101377378 " KY enciphered method " (i.e. " a kind of sequential encryption method of determining of obtaining ") at application number.The present invention abbreviates " P-KY " enciphered method as, will solve the unsafe factor of KY enciphered method.

It is as follows to conclude the KY enciphered method:

1. set up disclosed fixing common data base sign indicating number storehouse--a sequence PBS sequence of-long L byte: by byte, double byte, and the PBS sequence of multibyte mess code composition length enough (more than the desirable 4GB of L) do not have the above consecutive identical repetition of five bytes; With each byte 8bit is elementary cell, is that " 0 " beginning compiles the address in proper order each unit from the first unit of PBS, and compiling to last unit is " L-1 "

2. end numbering " L-1 " is connected with first place " 0 " logic, promptly the PBS sequence is used as ring-type.

3. if certain preface point (address) k place is a mark on PBS sequence ring, it is subsequence S that order is chosen n byte continuously, and L selected point then arranged.

4. continuous several times (m time) intercepts subsequence, and the gauge point address value of intercepting subsequence is a sub-key, subsequence is cascaded into the disposable sequence code book of final output: S sign indicating number sequence.

5. the gauge point address of each subsequence intercepting is that sub-key is merged into the method that disposable session key K intercepts subsequence so in proper order L is arranged ^mIndividual, if the S sign indicating number sequence that cascade obtains is different similar, so just add up to L ^mPlant disposable sequence.

If L=8GB, m=6, then key space is 2 ¹⁹², different S sign indicating number sequence kind numbers are 2 ¹⁹², each S sign indicating number sequence is several GB.

KY class enciphered method advantage is: can not rely on hardware, be to determine the sign indicating number sequence, and its fail safe has depended on the different types of different S sign indicating number sequences of flood tide, and necessary each S sequence is independent and unrelated.

In fact, " the KY enciphered method " of application number 2007101377378 do not provide and how to guarantee final S sign indicating number sequence complete uncorrelated scheme mutually.And only depend on the XOR cascade and the method cascade of abandoning is to guarantee that its all S sign indicating number sequences are independent and uncorrelated.Promptly can't define nearly 2 ¹⁹²Individual different sequence; Simultaneously, when linear cascade, also will produce identical sequence even their arrangements of a plurality of sub-key like combinations are different.

The present invention will address these problems.

We encrypt with KY, earlier brief PBS who is made up of 20 alphabetical unit of difference of hypothesis:

a?b?c?d?e?f?g?h?i?j?k?l?m?n?o?p?q?r?s?t

0?1?2?3?4?5?6?7?8?9?10?11?12?13?14?15?16?17?18?19

Following numeral 0 ~ 19th, the address of each element number (t of this brief PBS last location is connected with first unit a logic)

We cut 2 isometric subsequence cascades from this PBS,

Sub-key K ₁=3; K ₂=7, a long n=12 byte, both 12 unit

Subsequence S ₁: d e f g h i j k l m n o

S ₂：h?i?j?k?l?m?n?o?p?q?r?s

Can see S ₁And S ₂From " h " to " o " is fully overlapping identical.

Following ‖ is the cascade symbol, corresponding unit alignment cascade.(during cascade, corresponding unit XOR symbol omits, and is directly write as two monograms, down together)

S ₁‖S ₂：dh，ei，fj， gk，hl，im，jn，ko，lp，mq，nr，os；

Intercept 2 sub-sequence cascades in addition again, selecting K1 is 6, and K2 is 10,12 unit.

S1：g?h?i?j?k?l?m?n?o?p?q?r

S2：k?l?m?n?o?p?q?r?s?t?a?b

S1‖S2： gk，hl，im，jn，ko，lp，mq，nr，os，pt，qa，rb；

We can see, from 9 unit os of first gk to the of S1 ‖ S2 modular cascade sequence, modular cascade sequence S ₁‖ S ₂Be identical! This is called with bunch sequence.

The sequence that intercepts from PBS sequence ring from the subsequence of the maximum length sequence (whole PBS length L) of same starting point, is a part of maximum length sequence always; And the maximum length sequence of different starting points always has very big part is overlapping, it is to have overlapping mutually and sequence similarity rules that the final S sign indicating number sequence that obtains by 6 cascades has a lot, when the L=8GB of PBS, if remove these overlapping with similar rule sequences, independently sequence has only 2 ¹⁰²Individual! But not 2 ¹⁹²Individual, obviously be very not enough.We claim that these overlapping with similar sequences are with bunch sequence.

From sequence of PBS sequence intercepting, same bunch of a large amount of sequences arranged unavoidably all arbitrarily, this is a thorny problem very, because the opponent can remove to search thoroughly key, as long as and find out and just can attack with bunch sequence alignments a bit.

It is invalid attempting to establish several PBS rings different with the sequence of guaranteeing to obtain by other, because the maximum length sequence of each PBS ring is a same bunch of sequence of other maximum length sequences unavoidablely.Because the communication after the 1st time, we will be with bunch sequence with regard to what still obtain so also from these several PBS interceptings still.

Summary of the invention:

1. " roll up the XOR method certainly ", " center balanced method " Self-cascading

We see, during superincumbent intercepting subsequence, we are little of the big direction in address code fetch one by one from the address, and we stipulate that this direction from small to large is " dextrad " intercepting or " forward " intercepting; Otherwise be " left-hand " intercepting or " oppositely " intercepting.

" rolling up the XOR method certainly " is after obtaining a sequence, oppositely terminal from the head end forward of sequence and sequence, corresponding unit XOR one by one is actually a sequence and aligns foldingly from beginning to end, forms a new sequence, certainly this new sequence length be original sequence half.Be designated as Z under the sequence

Equally, on superincumbent 20 alphabetical PBS, we come " rolling up the XOR method certainly " intercepting,

Same K ₁=3; K ₂=7,12 unit are to S ₁" rolling up the XOR method certainly " of sequence

S ₁" rolling up the XOR method certainly " sequence: S of sequence _1Z(the XOR symbol omits, and is directly write as two monograms, down together)

S _1Z：do，en，fm，gl，hk，ij；

S ₂" rolling up the XOR method certainly " sequence: S of sequence _2Z

S _2Z：hs，ir，jq，kp，lo，mn；

Can see S _1Z, S _2ZThese two sequences do not have overlapping with similar part

S _1Z‖S _2Z：dhos，einr，fjmq，gklp，hklo，ijmn；

Come " rolling up the XOR method certainly " sequence of S1 and S2 again

S1 _Z：gr，hq，ip，jo，kn，lm；

S2 _Z：kb，la，mt，ns，or，pq；

S1 _Z‖S2 _Z：gkrb，hlqa，impt，jnos，knor，lmpq；

We can see, S _1Z‖ S _2ZModular cascade sequence and S1 _Z‖ S2 _ZModular cascade sequence is without any equitant part, also without any similar part.

Because there are not 5 continuous arrangements more than the byte identical on the PBS sequence, " rolling up the XOR method certainly " can

With definitely on whole PBS ring, under the isometric situation of sequence, " rolling up the XOR method certainly " sequence at difference place is different certainly, and not with bunch similar same case occur.That is to say,

Under the situation, the PBS of 16GB has 16G diverse desirable sequence.

The variable that relates in this explanation all is a nonnegative integer

Usually, we intercept a subsequence S

S:a ₁, a ₂..., a _i..., a _{N_1}, a _n, o, b _n, b _{N_1}..., b _i..., b ₂, b ₁Be total to 2n+1 unit byte

We become S with it from rolling up XOR _Z:

a ₁b ₁, a ₂b ₂..., a _ib _i..., a _{N_1}b _{N_1}, a _nb _nBe total to n byte, the unit " 0 " that is in the center abandons.

Be the corresponding XOR of both sides, center symmetry with unit " 0 " promptly, the left side of S sequence partly is the forward sequence code fetch, and the right side partly is the reverse sequence code fetch, carries out one by one to formation center from the sequence two ends.

If the S sequence is a 2n unit byte, symmetrical centre is incited somebody to action not on the sign indicating number of sequence, and between 2 the most central sign indicating numbers.

The S sequence can be expressed as

S：a ₁，a ₂，…，a _i，…，a _{n_1}，a _n，b _n，b _{n_1}，…，b _i，…，b ₂，b ₁

Obviously lacked in the middle of " o ", symmetrical centre is at a _n, b _nBetween these two sign indicating numbers.

" roll up the XOR method certainly " and require under the isometric situation of sequence, different starting points on PBS could guarantee that each sequence from volume determines differently, determine nothing overlapping similar sequence together bunch.In fact be exactly to require to have different center symmetric points from the sequence of rolling up XOR, if the sequence that we directly indicate to intercept with the center symmetric points, so with regard to the isometric in advance regulation of it doesn't matter sequence length.We just have " the center symmetry is from the XOR method " abbreviation " center balanced method " or " center method " to replace " rolling up the XOR method certainly " thus

Equally, intercept a subsequence S

S：a _n，…，a _i，…，a ₂，a ₁，b ₁，b ₂，…，b _i，…，b _n，

S _Z：a ₁b ₁，a ₂b ₂，…，a _ib _i，…，a _nb _n，

From symmetrical centre (a ₁, b ₁Between) beginning, corresponding to the left and right sides code fetch XOR, a left side partly is to code fetch, the right side partly is the forward code fetch.

Symmetrical centre can also can drop on the sign indicating number of PBS between two adjacent codes of PBS, like this, obtains different sequences with the center balanced method on PBS, and 2 times the individual method of choosing of PBS length value L can be arranged.On the PBS of 16GB, 2L=2*16G symmetrical centre can be arranged, just have 2*16G diverse (not with bunch overlapping similar, be independently) sequence chooses method.The center balanced method obtains not predetermined length of sequence.

Below we with A, B, C, D, E, the F point is a central point, is the sub-key address points with the ABCDEF point respectively promptly, intercepts 6 subsequences and illustrates that the L of PBS is 8GB.

If total length be the L byte the PBS sequence we be expressed as

PBS:u ₀, u ₁..., u _{A_1}, u _A, u _A+1..., u _{L_2}, u _{L_1}(might as well suppose A not with u ₀, u ₁Or u _{L_2}And u _{L_1}Overlap)

With the A address points is the center balanced method sequence at center

S _AZ：a ₁，..a _i，…

$a_1=u_{A\_1}\⊕u_{A+1}$

Be the XOR symbol, expression unit u _{A_1}With unit u _A+1Corresponding bit position XOR, down together

$a_2=u_{A\_2}\⊕u_{A+2}$

……

$a_i=u_{A\_i}\⊕u_{A+i}$ 1≤i≤L/2 u _xSubscript x 0≤x≤L-1 if subscript expression x=(A-i)＜0, definition x=x+L;

If x=(A+i)〉L-1, then whole subscript expression x=x-L

Similarly, we can to obtain with B be the center balanced method sequence S at center _BZS _BZ: b ₁..., b _i,

$b_i=u_{B\_i}\⊕u_{B+i}$

And with C, D, E, F are the center balanced method sequence S at center _CZ, S _DZ, S _EZ, S _FZSequence S _CZ: c ₁..., c _i, $c_i=u_{C\_i}\⊕u_{C+i}$

S _DZ：d ₁，…，d _i，… $d_i=u_{D\_i}\⊕u_{D+i}$

S _EZ：e ₁，…，e _i，… $e_i=u_{E\_i}\⊕u_{E+i}$

S _FZf ₁，…，f _i，… $f_i=u_{F\_i}\⊕f_{F+i}$

In fact, we can be S _AZRegard with A to be the left-hand sequence S of boundary as _ALWith dextrad sequence S _ARThe modular cascade sequence of the corresponding position of alignment.S is similarly arranged _BLAnd S _BRS _CLAnd S _CRS _DLAnd S _DR, S _ELAnd S _ERS _FLAnd S _FRThe L subscript is represented left-hand, and the R subscript is represented dextrad.

If with between unit on an A left side and the A as symmetrical centre,

PBS：u ₀，u ₁，…，u _{A_1}，u _A，…，u _{L_2}，u _{L_1}

Be that symmetrical centre is at u _{A_1}Unit and u _ABetween the unit, and not on the element number of PBS, such center balanced method sequence is designated as S _OAZ

For S _OAZA ₁..a _i,

$a_i=u_{A\_i}\⊕u_{A+i\_1}$

Equally, for the S of center symmetric points on a B left side _OBZSequence

$b_i=u_{B\_i}\⊕u_{B+i\_1}$

In fact, " rolling up the XOR method certainly ", " center balanced method " is identical in essence, but the former to be two ends from the predetermined length sequence begin to symmetrical centre code fetch Self-cascading, the latter begins to two ends code fetch Self-cascading from symmetrical centre.Sequence with identical symmetrical centre is with bunch sequence to " rolling up the XOR method certainly ", concerning " center balanced method " because itself does not have specific length, same symmetrical centre can be considered as same sequence.

Difference four word arrangements on the PBS and the sequence that does not have the same code arrangement more than five to make difference intercept can not be identical, and " center balanced method " needs only the center difference definitely, the just complete difference of sequence, and it is similar to have got rid of rule, overlapping possibility.This is easy to prove, does not repeat them here.

Like this, but we can have 2 times of reconnaissances of PBS length value L to select independent sequence on PBS at every turn.The PBS of 8GB is each, and we can have 2L=2*8G

May select independently sequence.If select and cascade for m time continuously, we can have (2*L) in theory ^mIndividual optional sequence.

The sequence cascade system is generally the corresponding position of the corresponding unit sign indicating number alignment XOR of sequence, and is relatively simpler and clearer.

But problem has then been come, and XOR is linear, and symmetry if A point and B point are 2 choice points that subsequence begins, i.e. sub-key K _AK _B, K so _BK _ASubsequence cascade result identical with it.

For the sub-key K that determines _A, K _B, K _C, K _D, K _E, K _F, what their combination in any XOR cascade (perhaps other linear cascade) went out all is same sequence.

And we always go up order code fetch one by one from PBS, and this also will be the weakness of pure XOR cascade, might be utilized and under attack.This is that possible safety is fragile.Thoroughly avoiding this possibility, is the another unique distinction of P-KY enciphered method.

2. " sequence rearrangement cascade "-P cascade

We can obtain diverse sequence S definitely _AZAnd S _BZ(being respectively the center balanced method sequence at center with A and B point)

S _AZ‖ S _BZThe sequence that " sequence rearrangement cascade " obtains is written as S _ABP

S _AZ：a ₁，a ₂，…，a _i，…，a _n

S _BZ：b ₁，b ₂，…，b _i，…，b _n

S _ABP：r ₁，r ₂，…，r _i，…，r _n

S _AZ, S _BZCascade output sequence S _ABPR ₁Take from S _BZAn element number on the sequence is a sequence number

For from b ₁The S that the some beginning is counted backward _BZSequence a ₁Individual byte item;

r ₂Take from S _BZAn element number on the sequence is from b ₂Beginning S backward _BZSequence a ₂Individual byte finds r ₂

r _iTake from S _BZAn element number on the sequence is from b _iBeginning S backward _BZSequence a _iIndividual byte finds r _i

……

r _nTake from S _BZAn element number on the sequence is at S _BZOn the sequence from b _nBegin mobile backward a _nIndividual byte finds r _nHere make S _BZHead and the tail connect into ring-type,

b _nBe b afterwards ₁, b ₂,

The S that cascade obtains _ABPSign indicating number r on the sequence _i, be S according to current location _AZSequence code a _iValue, at S _BZGo up by current location sign indicating number b _iBe offset a backward _iIndividual byte and the sign indicating number that finds.The P cascade is actually by a sequence as the sequence of pointers collection, finds the element number of each pointer correspondence as output from another sequence one by one.

This cascade, we are called and use S _AZSequence is to S _BZThe P ordering cascade of sequence, or be called for short the P cascade.Be designated as P under the sequence after the P cascade

The P cascade searches out correspondence code one by one according to each different code value of a sequence in another sequence, in other words, sequence is to another sequence code selection and rearranging one by one.It is non-linear fully, also has no rule.By the P cascade that 2 sequences are carried out, must obtain these complete two sequences simultaneously, what know just that cascade goes out is what.We may not go addressing with a byte, can use double byte, and three bytes are come addressing, with the scope of increase addressing, thereby have thoroughly broken away from original PBS sequential organization, and the ultimate sequence that makes cascade go out is more irregular more unpredictable.

The P cascade has solved simultaneously " for the sub-key K that determines _A, K _B, K _C, K _D, K _E, K _F, what their combination in any linear cascade went out all is same sequence." problem

Because we know, use S _ASequence is to S _BSequence P ordering is with using S _BTo S _AIt is diverse coming the P ordering.

Use S _AZThe addressing of sequence double byte is to S _BZCarry out the P ordering, S _ABPIt

r ₁At S _BZOn, from b ₁A backward ₁a ₂Individual sign indicating number

…

r _iAt b _iBack a _ia _I+1Individual sign indicating number (0≤i)

…

Non-linear cascade can also be with famous " abandoning method ":

S _AZAnd S _BZSequence alignment, S _AZEach unit bit code bit is to S _BZCorresponding each element number position bit-order carry out successively " abandoning method " operation:

S _AZThe position bit " 1 " of element number is then exported S _BZThe corresponding position of corresponding units sign indicating number bit;

S _AZElement number position bit " 0 " then abandons S _BZCorresponding units sign indicating number position bit.

All the bit of order output becomes S _AZAnd S _BZModular cascade sequence SIII.

The SIII sequence has not been 8 bit cells, and being necessary to reintegrate is the sequence code and the number consecutively of 8 bit cells.

The P-KY enciphered method is a repeatedly cascade method of sequence, be convenient and safety, the sequence that obtains on PBS must be at first to adopt the sequence of " center balanced method ", the simply combination of XOR cascade and P cascade then can abandon method cascade-be integrated into the then final S sign indicating number sequence of 8 bit cell sign indicating numbers at last.

S _AZ‖ S _BZSequence is S _ABP, same S _CZ‖ S _DZBe S _CDP, S _EZ‖ S _FZBe S _EFP, work as A, B combination and C, D and E, when the F combination is just in time identical, S _ABP=S _CDP=S _EFPThis just has destruction to final S sign indicating number sequence safety.The modular cascade sequence of first level " center method intercepting ", sequence cascade in twos, A, B cascade, C, D cascade, E, F cascade.We stipulate: A, what the B sequence adopted is the not sequence on the PBS sequence code of center, is defined in a left side, unit and is the center.The center that is the A sequence is not on this element number of A, on the left side of A--between A unit, a left side and the A, be designated as S _OAZSame B formation center is also on a B left side, and not on the PBS sign indicating number, is designated as S _OBZC, the center of D sequence just in time is respectively C, D, they are the code-points on the PBS sequence.Like this, though A, the B point just in time with C, the D point overlaps, their sequence is also inequality, so S _ABP(S _ABP=S _OAZ‖ S _OBZ) and S _CDP(S _CDP=S _CZ‖ S _DZ) just can not be identical.

S _EFPWe can use to S _ABP‖ S _CDPCascade cascade once more, can use S _EFPTo S _ABP‖ S _CDPAbandon the method cascade.

It is pointed out that sequence all is long, is not several, tens bytes, but easily with KB, MB is the long sequence of unit, the longest can several GB.

S _AZ, S _BZ, S _CZ, S _DZ, S _EZ, S _FZ, between and their modular cascade sequence S _ABP, S _CDP, S _EFPBetween accidental identical probability be relevant with their byte number, if byte number is n, equal probabilities is 1/2 so ⁸ⁿ, be exactly the probability of random number.30 byte equal probabilities are 1/2 ²⁴⁰, similarly, S _ABP‖ S _CDPThe accidental identical probability of the result of cascade is also like this.

In fact, PBS can be by byte at random, double byte, three bytes and nybble are formed, be better than pure nybble structure, we can make it not have the above same code of continuous 5 bytes to occur, and detecting simultaneously to get rid of about certain point has symmetry more than continuous 5 bytes.The length of PBS also can shorten as required and greatly.If the disposable code book maximum number of byte that encrypt to need is at 4M, the length that PBS can 16MB so, 6 cascades, key length is 144 bits (6 sub-keys, each sub-key are 24 bits), key space promptly 2 ¹⁴⁴To the attack of the P-KY enciphered method of the PBS of 16MB, uniquely effectively search attack thoroughly.Yet 2 ¹⁴⁴Definitely can't break through now.

We even PBS can be contracted shorter and keep its fail safe are as long as we increase the number of times of cascade.The length of PBS has determined our disposable obtainable sequence maximum length.For the very long plaintext that reaches tens hundreds of M even last G length, we will use isometric at least S sign indicating number sequence, we can not allow computer moment finish the S sign indicating number sequence of length like this (if pre-establish long S sign indicating number sequence, there is preparation good certainly, so directly with S sign indicating number sequence, on the basis of fail safe, encryption/decryption speed is better than any other enciphered method), concern the speed of computing, we are necessary it pre-grouping is promptly addressed this problem below.

The pre-grouping of P-KY for the unknown expressly length instant messaging and do not have preparation S code book, we can only be with the method reply of pre-grouping.The P-KY enciphered method begins with center method intercepting sequence from each sub-key address points, each center method sequence is actually by its corresponding left sided sequence and the corresponding XOR cascade of right side sequence and forms, notice left sided sequence and right side sequence, and their center method XOR cascades to go out sequence be isometric, and be corresponding be the same position section.Maximum length be PBS maximum length L 1/2.A left side and the right side sequence of the longest L/2 divide into groups in advance with this.

Basic grouped is 64KB, and it is basic m that the longest whole L/2 sequence is divided into 64KB length ₁, m ₂... m _j... m _n, n 64K grouping.The PBS of 16GB, n=2 ¹⁸, the PBS of 4GB, n=2 ¹⁶

We can stipulate in advance that a piece BLCK has 2 ⁶(=64) individual m grouping, promptly Blck1 comprises m ₁, m ₂, m ₆₄

The Blck2 scope is m ₆₅To m ₁₂₈, and the like.

Promptly draw piece, each piece Blck comprises 64 m groupings in advance, and each m is 64KB.Each Blck piece is 64*64KB=4MB.At first only carry out first piece computing and m and launch,, continue second Blck again if expressly do not finish ... carry out successively.Certainly the Blck piece should comprise that several m preferably have nothing to do with this explanation.

With A is the center method sequence S at center _AZCan be expressed as

S _AZ：(m ₁)a，(m ₂)a，…，(m _j)a，…，(m _n)a

The left sided sequence that it is corresponding, right side sequence is designated as:

S _AL: (m ₁) a _L, (m ₂) a _L..., (m _j) a _L..., (m _n) a _LThe L subscript is represented left sided sequence

S _AR：(m ₁)a _R，(m ₂)a _R，…，(m _j)a _R，…，(m _n)a _R

The R subscript is represented right side sequence.

S _AZSequence it $\left(m_j\right)a=\left(m_j\right)a_L\⊕\left(m_j\right)a_R$

Equally, S _BZSequence table is shown S _BZ: (m ₁) b, (m ₂) b ..., (m _j) b ..., (m _n) b

S _BZSequence it $\left(m_j\right)b=\left(m_j\right)b_L\⊕\left(m_j\right)b_R$

Similarly,

At first only draw piece, L/2 length is divided into the Blck piece of some (λ) individual 4MB, is respectively Blck1, Blck2 ..., Blck λ

And at first launch 64 m groupings of Blck1, as (m _j) j 62 o'clock, 6 m groupings that launch Blck2 are j up to last 2 m grouping of the 2nd grouping〉launch next piece Block during 126 (=λ * 64-2, λ are the Blck sequence number)

Usually, (m _j) j during λ * 64-2, all sequences that launches (λ+1) individual Blck cascade is stipulated each m of each sequence all with m grouping order five equilibrium from first to last

In the grouping 64k unit from the 0th successively to (64k-1) item

Not homotactic same grouping is called " equipotential section "

Except P cascade (from the equipotential section, comprising 2 adjacent m groupings), other all cascade computings are all strict to be carried out on the respective items of equipotential section.

The P cascade is expressed

With the P ordering, equally also can use S _BZTo S _AZCome the P ordering, if carry out simultaneously, we are called S _AZAnd S _BZMutual P ordering, be called for short " row mutually ".Mutual level of platoon leader joins the sequence that and still uses S _ABPExpression.S similarly _CZ‖ S _DZ, be S _CDPS _EZ‖ S _FZBe S _EFPWith S _AZ‖ S _BZS _ABPIllustrate.S _ABPSequence table is shown: S _ABP: (m ₁) r, (m ₂) r ..., (m _j) r ..., (m _n) the corresponding S of r _AZAnd S _BZEvery

The array of the mutual level of platoon leader connection of P is expressed

With S _AZ, S _BZM ₁, m ₂Two sections are write as the array form in proper order

a?m ₁m ₂[128K]＝{a ₀，a ₁，…，a _{128K_1}}

b?m ₁m ₂[128K]＝{b ₀，b ₁，…，b _{128K_1}}

S _ABPm ₁The r of section ₀=bm ₁m ₂[0+a ₀a ₁]; Promptly get r ₀Be array bm ₁m ₂(the 0+a of [128K] ₀a ₁) individual element

a ₀a ₁Be double byte, be worth and be 256a ₀+ a ₁Down together

S _ABPm ₁Section r1=am ₁m ₂[1+b ₀b ₁] promptly to get r1 be array am ₁m ₂(the 1+b of [128K] ₀b ₁) individual element

……

S _ABPM ₁Section r _i

Even number item r _i=bm ₁m ₂[i+a _ia _I+1] 0≤t≤32k-1 during i=2t

Odd term r _i=am ₁m ₂[i+b _{I_1}b _i] 1≤t≤32k-1 during i=2 t-1

S _ABPM _jSection is from S _AZAnd S _BZM _jm _J+1The array access code of Duan Zucheng, S _ABPM _jSection is written as (m _j) r

S _AZ, S _BZThe m of sequence _jm _J+1Section is written as (m respectively _jm _J+1) a and (m _jm _J+1) b

(m _jm _J+1) array of a is designated as a m _jm _J+1[128K]

(m _jm _J+1) array of b is designated as b m _jm _J+1[128k]

(m _j)r _i＝bm _jm _j+1[2t+(m _j)a _2ta _2t+1]i＝2t，0≤t≤32k-1

(m _j)r _i＝a?m _jm _j+1[2t+1+(m _j)b _2tb _2t+1]i＝2t+1，0≤t≤32k-1

Be S _ABPM _jSection is to use m _jAnd m _J+1The S of these 2 sections _AZ, S _BZArrange mutually, p row's shift value is m _jThe S of section _AZ, S _BZDouble byte a _2ta _2t+1(during i=2t) and b _2tb _2t+1(during i=2t+1)

The single cascade of P is expressed

The level of platoon leader connection has the symmetry of possibility, K mutually _AK _BAnd K _BK _AHave regularity, therefore, single level is associated in this aspect and is better than mutual level of platoon leader connection.

The array of the single cascade of P is expressed the mutual level of platoon leader connection of fundamental sum equally

S _AZSequence table is shown S _AZ: (m ₁) a, (m ₂) a ..., (m _j) a ..., (m _n) a

S _BZSequence table is shown S _BZ: (m ₁) b, (m ₂) b ..., (m _j) b ..., (m _n) b

S _ABP: (m ₁) r, (m ₂) r ..., (m _j) r ..., (m _n) the corresponding S of r _AZAnd S _BZEvery

With S _AZ, S _BZM _j, m _J+1Section is write as array respectively:

S _AZ(m _jm _J+1) array be designated as a m _jm _J+1[128K]

S _BZ(m _jm _J+1) array be designated as b m _jm _J+1[128k]

So, S _ABPM _jSection: (m _j) r _i=b m _jm _J+1[i+ (m _j) a _ia _I+1]

0≤i≤64k-1

Obviously work as a _I+1I+1=64k, but a _I+1Still at a m _jm _J+1On [128K]

a _i＝a?m _jm _j+1[i]

Double byte a _ia _I+1Value is: 256*a _i+ a _I+1

Generally by previous sequence a back sequence to be carried out P single for our regulation, and S is similarly arranged _CDPAnd S _EFP

The P cascade is actually by a sequence as the sequence of pointers collection, finds the element number of each pointer correspondence as output from another sequence one by one.

For prevention to the center method sequence set up a big table by sign indicating number search coupling P cascade thoroughly may sign indicating number, we can be to center method sequence code and output code " hydridization " displacement that participates in the P cascade, to increase the difficulty that the opponent attacks.For example:

S _AZSequence code a _iS to correspondence _BZThe sign indicating number b _iOperation that the corresponding bit position " abandons method " obtains a not fixing Bit String τ of figure place, the r that this string τ and P addressing are obtained _iThe head end alignment constitutes into each yard output of P cascade like this by the bit XOR.

Or string τ and r _iTandem junction (there is no harm in τ is placed on preceding) is removed more than 8 bits, promptly is equivalent to r _iRing shift right τ position also replaces high-order τ bit with τ string bit

Also can a _ia _I+1Dicode is to b _ib _I+1Dicode is with r _iAbandon more than 8 bits during hydridization.

When j near 64, to finish Blck λ when (j〉λ * 64-2) and expressly be not over yet, will carry out Block (λ+1) so, go down always.

The S sign indicating number sequence algorithm that typical P-KY enciphered method produces

S _OAZ‖ S _OBZ(the single cascade of P) → S _ABPS _CZ‖ S _DZ→ (the single cascade of P) S _CDPS _EZ‖ S _FZ(the single cascade of P) → S _EFP

S _ABP‖ S _CDP(XOR cascade) → S _IIS _II‖ S _EFP→ S _III(S _EFPTo S _IIThe method that abandons cascade); S _III→ be integrated into the S sign indicating number sequence of 8 bit cell sign indicating numbers

The some problems of agreement and algorithm

Must set up the disclosed base sign indicating number storehouse sequence PBS sequence ring of standard, any possible communication participant can be visited and be duplicated or download PBS

PBS can have multiple version dealing with different needs, smaller can 16MB, bigger as 16GB

Can be according to the cascade number of times that the demand of communication and encryption intercepts behind the subsequence from PBS for 4 cascades or more than 4 times, correspondingly disposable session key length is also different separately, which kind of version communication side must determine to use, the regulation key length promptly intercepts subsequence number of times and cascade number of times, and the combined method of different cascades, the pattern that also has communication---be instant messaging or big buffer memory standby mode, and agreement is used the method for S sign indicating number sequence.

S sign indicating number sequence is used regulation

Because S sign indicating number sequence code is disposable use, communication side can not use same segment encode to encrypt simultaneously and send, and is necessary regulation S sign indicating number sequence use section separately, odd number m packet communications side for example, even numbers m packet communications side

The agreement acknowledgement mechanism and the method for synchronization.

S sign indicating number sequence can directly send some idle bits with synchronously, also can use the current sign indicating number of section as identification with current the other side

Embodiment

The typical P-KY algorithm of PBS (6 cascades) during L=4GB

Input: disposable session key K, 192 bits

Output: the disposable S sign indicating number sequence of the longest 1GB

K is divided into 6 sub-keys (preface ground successively) K of 32 bits _A, K _B,

K _C, K _D, K _E, K _F, and on PBS, find corresponding address A, and B, C, D, E, F, respectively with an A left side, a B left side, and C, D, E, F this left-hand sequence and dextrad sequence, each length 2GB as center definite 6 subsequence correspondences on PBS

S _OAZTwo corresponding sequences are right: S _ALAnd S _AR

S _OBZTwo corresponding sequences are right: S _BL, S _BR

S _CZTwo corresponding sequences are right: S _CL, S _CR

S _DZTwo corresponding sequences are right: S _DL, S _DR

S _EZTwo corresponding sequences are right: S _EL, S _ER

S _FZTwo corresponding sequences are right: S _FL, S _FR

Respectively to top 6 groups of left and right sides sequences to piecemeal, 2GB is divided into 2 ⁹Individual Blck piece, each Blck piece 4MB comprise 64 m groupings; Each m is grouped into 64KB

Blck1 comprises m ₁～m ₆₄

Blck2 comprises m ₆₅～m128;

……；

Blck λ comprises m64 (λ-1)～m64 λ 1≤λ≤2 ⁹

Whole m ₁, m ₂... m _j... m _nN=2 is arranged ¹⁶1≤j≤2 ¹⁶

Definition j=2 ¹⁶The time, m _J+1=m ₁

At first, work as m to concrete m grouping of Blck1 and cascade computing (remaining Blck piece does not temporarily launch computing) _jJ during λ * 64-2, launch (λ+1) individual Blck and cascade computing, each m has the sequence units of 64kB.

Any one m grouping all is successively from item unit, the 0th unit to the (64k-1)

S _AL：(m ₁)a _L，(m ₂)a _L，…，(m _j)a _L，…，(m _n)a _L

S _AR：(m ₁)a _R，(m ₂)a _R，…，(m _j)a _R，…，(m _n)a _R

S _OAZ:(m ₁)a，(m ₂)a，…，(m _j)a，…，(m _n)a

Any one m grouping: (m _j) a=(m _j) a ₀, (m _j) a ₁, (m _j) a _i..., (m _j) a64k-1,

(0≤i≤64k-1) form by 64k element number, for other sequence, so statement similarly.

S _OAZIt (m _j) section, $\left(m_j\right)a_i=\left(m_j\right)a_{\mathrm{L\; i}}\⊕\left(m_j\right)a_{\mathrm{R\; i}}$

Be the XOR symbol, the element number corresponding bit is XOR 0≤i≤64k-1 one by one

S _BL：(m ₁)b _L，(m ₂)b _L，…，(m _j)b _L，…，(m _n)L _b

S _BR：(m ₁)b _R，(m ₂)b _R，…，(m _j)b _R，…，(m _n)b _R

S _OBZ：(m ₁)b，(m ₂)b，…，(m _j)b，…，(m _n)b

?0≤i≤64k-1

S _CL：(m ₁)c _L，(m ₂)c _L，…，(m _j)c _L，…，(m _n)c _L

S _CR：(m ₁)c _R，(m ₂)c _R，…，(m _j)c _R，…，(m _n)c _R

S _Cz：(m ₁)c，(m ₂)c，…，(m _j)c，…，(m _n)c

?0≤i≤64k-1

Equally, successively

S _OAZ‖ S _OBZ(the single cascade of P) → S _ABP

S _CZ‖ S _DZ(the single cascade of P) → S _CDP

S _EZ‖ S _FZ(the single cascade of P) → S _EFP

S _OAZ:(m ₁)a，(m ₂)a，…，(m _j)a，…，(m _n)a

S _OBZ：(m ₁)b，(m ₂)b，…，(m _j)b，…，(m _n)b

S _ABP: (m ₁) r, (m ₂) r ..., (m _j) r ..., (m _n) the corresponding S of r _AZAnd S _BZEvery with S _OAZ, S _OBZM _j, m _J+1Section is write as array respectively:

S _OAZ(m _jm _J+1) array be designated as a m _jm _J+1[128K], S _OBZ(m _jm _J+1) array be designated as b m _jm _J+1[128k]

S _ABPM _jSection: (m _j) r _i=b m _jm _J+1[i+ (m _j) a _ia _I+1]

0≤i≤64k-1; Double byte a _ia _I+1Value is: 256*a _i+ a _I+1

S _CZ：(m ₁)c，(m ₂)c，…，(m _j)c，…，(m _n)c

S _DZ：(m ₁)d，(m ₂)d，…，(m _j)d，…，(m _n)d

S _CZ‖ S _DzThe P cascade be designated as S _CDP

S _CDP：(m ₁)w，(m ₂)w，…，(m _j)w，…，(m _n)w

With S _CZ, S _DZM _j, m _J+1Section is write as array respectively:

S _CZ(m _jm _J+1) array be designated as c m _jm _J+1[128K],

S _DZ(m _jm _J+1) array be designated as d m _jm _J+1[128K]

S _CDPIt (m _j) section: (m _j) w _i=d m _jm _J+1[i+ (m _j) c _ic _I+1]

Same 0≤i≤64k-1, c _ic _I+1The expression double byte.

S _EZ, S _FZSingle P cascade be written as

S _EFP: (m ₁) v, (m ₂) v ..., (m _j) v ..., (m _n) v and use with quadrat method and get em _jm _J+1[128K], f m _jm _J+1[128K],

S _EFPIt (m _j) section: (m _j) v _i=f m _jm _J+1[i+ (m _j) e _ie _I+1],

Same 0≤i≤64k-1 e _ie _I+1The expression double byte

S _ABP：(m ₁)r，(m ₂)r，…，(m _j)r，…，(m _n)r

S _CDP：(m ₁)w，(m ₂)w，…，(m _j)w，…，(m _n)w

S _ABP‖ S _CDPBe the XOR cascade, obtain S _IISequence

S _IISequence: (m ₁) s, (m ₂) s ..., (m _j) s ..., (m _n) s

$\left(m_j\right)s_i=\left(m_j\right)r_i\⊕\left(m_j\right)w_i$

Use S _EFPSequence is to S _IISequence abandons the method cascade, output S bit sequence S _III

S _EFPEach element number and the S of sequence _IIThe corresponding alignment of each element number of sequence.

Be S _EFPIt (m _j) v _iItem and S _IIIt (m of sequence _j) s _i

Use S _EFPElement number (the m of sequence _j) v _i, to the S of correspondence alignment _IISequence units sign indicating number (m _j) s _iItem carries out bit operating by turn.S _EFPElement number (the m of sequence _j) v _iDuring item position bit " 1 ", the S of corresponding alignment _IISequence units sign indicating number (m _j) s _iThe bit output of item position; S _EFPElement number (the m of sequence _j) v _iDuring item position bit " 0 ", the S of corresponding alignment _IISequence units sign indicating number position bit abandons; S like this _EFP‖ S _IIObtain S _IIISequence.

S _IIISequence is with the sequence of digital ratio specially for elementary cell, and it is the sequence code sequence of 8 bit cells that this sequence bits is compiled successively, and successively each 8 bit cell sign indicating number is compiled sequence number 0,

1 ..., to the last about 1GB.

After finishing sequence number, output is exactly disposable sequence code-S sign indicating number sequence that we finally need.

It is pointed out that above-mentioned algorithm is not that the S sign indicating number sequence that will wait until whole about 1GB is finished just and can be carried out the encryption and decryption computing.In fact, what above-mentioned algorithm carried out is m packet concatenation computing one by one (computing that a m divides into groups is also replaced in P cascade just 2 m groupings of order one by one), and each m grouping is 64KB.As long as the S sign indicating number sequence output of 32KB is arranged, just computing continuously continuously.Simultaneously, write be adapted to polycaryon processor the concurrent operation program with computing quickly.Certainly it is still top-priority to leave certain buffer memory.If pre-establish S sign indicating number sequence, the encryption and decryption arithmetic speed can reach maximum undoubtedly.

The disposable code book sequence that this type of enciphered method produces, S sign indicating number sequence, each sequence does not have effective related with disposable session key K, do not have effectively related in the sequence between each sign indicating number, whole sequence becomes one-period, and disposable sequence can't be determined any next sign indicating number of sequence for the assailant, this yard is irregular for him " at random ", sequence of analytical attack with search key thoroughly and almost be equal to.

Therefore we can obtain the disposable code book that a communication of having only key K to share has just now, and this encrypts for demand, and authentication and legal communication side have huge meaning synchronously.

A. current sign indicating number, the current time is represented

Because s sign indicating number sequence kind is huge, each disposable sequence is only used once, and communication side's sequence code is to use in order, and removes one with one, and " current sign indicating number " arranged all the time

Confirm the reciever of disposable session key K, for example:

Communication side A and B A send to B with the public key encryption K of B, and both sides set up a S sign indicating number sequence, are divided into two parts, and agreement A uses the odd number position sequence code of S agate, and B uses the even numbers sign indicating number.

A and B fix on the public occasion that can confirm identity approximately, such as phone, random message encrypted challenge: A encrypts first message m with singledigit and issues B in the video, and return to A with even numbers code encryption m B deciphering back, after A determines that m is errorless, just identifiable B really with his communication.

Certainly A also can encrypt B with disposable singledigit again with the public key encryption m of B, returns m with the even numbers sign indicating number of oneself again after the B deciphering and gives A;

Also can use other modes to confirm.

Time validity is expressed

S current time of code encryption is used at the end of message, and the opponent knows also that certainly this may be the current time.For preventing that the opponent from distorting the time so that Replay Attack, we can encrypt one arbitrarily the time express equation, but not directly indicate the time, for example:

Current time is 18 points, can be write as 17*3-33 (=18 point)

Or (6/2-1) * 9 (=18 point)

………

Or the like expression formula and encrypt.

Can infinitely plant expression arbitrarily, because the opponent does not know to encrypt the corresponding S sign indicating number of usefulness, be unable to find out what expression formula of usefulness yet, the time of distorting just can not.

Current sign indicating number and current time are expressed in conjunction with also being used as the affirmation identity.Replay Attack after avoiding interdicting just requires each communication, must reply affirmation.

B. the S sign indicating number is arranged in order into matrix, each element of matrix is the element number of a S sign indicating number, and is simultaneously compound with display screen dot array, just can image or handwriting input writing encrypted transmission.The method is called " T figure " and encrypts.Dotted path such as hand-written process successively becomes one group of information data transmission and directly demonstration on the display screen of another communication side in proper order.Even the method has a large amount of interference also can recognize the information of reading.The method of reinforcement can consider how cover T figure overlaps, and has only overlapping ability to be approved, can scheme and rotation T figure by many T.In to a certain degree, T figure can repeat to encrypt.

C. during file encryption, the keeping of K

During communication, disposable K need not take care of.And behind the file encryption, then need keeping K, and 192 bit lengths of K are difficult to remember.

1) can be combined into K (hash with the data of self-defining statement and Computer Storage, computings such as XOR), can become K with storage of complex with the data fingerprint of making data by oneself, like this, open encrypt file and just needn't keep long string bit firmly in mind, only need provide self-defined statement or data information.

2) multi-zone supervision of key K

A administers the K key, in case A forgets K, can't open file, so A should back up the 2nd K: allow A and B respectively administer a piece of data, have only AB to use simultaneously just and can be merged into key K; Certainly back up the 3rd K, have only when ABC uses just simultaneously to be merged into key K ...

D.S sign indicating number sequence directly is used for the frequency agility Synchronization Control of wireless telecommunications as the Synchronization Control sign indicating number, make the opponent for the tracking of communication, disturb, control wait attack invalid!

Claims (3)

1. center balanced method cascade, a kind of from a kind of sequence, the subsequence Self-cascading that intercepts on the described PBS sequence ring becomes the not method of sequence of the same race.

Its objective is allow might be from then on avoid becoming the identical sequence of phase Sihe rule through after this cascade with the subsequence that intercepts on a kind of sequence.

It is characterized by: with this be the center symmetric points with certain some position of a kind of sequence (head and the tail connect to form ring-type), get bit code correspondence cascade one by one and be output into an independent sequence to the both sides, center from the center symmetric points successively.

2.P cascade, a kind of non-linear stages linked method that existing byte code sequence is rearranged.

It is characterized by: with the byte code sequence that will rearrange order order of arrangement preface or address and as target sequence, be the pointer data collection with the code value of another byte code sequence, order to the target sequence addressing and one by one the export target sequence code be cascade output.

3. the current time representation of a disposable code encryption

It is characterized by: the time at the privileged site of file format mark is the random time expression formula of an encryption, and its operation result is the current time, but not the Direct Mark current time.