Eapmessage digest method and system based on path hash
Eapmessage digest method and system based on path hash
 CN 106,301,764 A
 Filed: 10/09/2016
 Published: 01/04/2017
 Est. Priority Date: 10/09/2016
 Status: Active Application
First Claim
1. eapmessage digest method and system based on path hash, principal character includes:
 First set transform sequence, eapmessage digest, paths planning method, then message packet, packet hash, be in harmonious proportion and hash,Rear output message summary character string.Message packet and path hashing algorithm are the principal characters of system.
Chinese PRB Reexamination
Abstract
Present invention relates generally to information security and message identification field, information is hashed by packet, packet path, result sequence reconciliation paths hash calculates, and ultimately produces eapmessage digest.Stepbystep packet and path hash are the principal characters of system.By the k packet every k bit of expression as an elementary cell, multiple unit form one group and participate in packet path hash calculating.Path hash calculates to refer to calculate to be needed to carry out by the path specified, the pathdepth specified, and each grouping information can affect multiple elements of path setting, thus reaches the purpose of hash.Eapmessage digest method and system based on path hash, can extend and derive different digest algorithms, by different packets, different transform sequences, different path hashing algorithms, all can produce different eapmessage digests, thus meet different demands for security.Message packet enables the system to process jumbo information, and path hash calculations incorporated k packet can realize the eapmessage digest that k is multiplied by the k power bit of 2.

5 Citations
A kind of integrality detection method and device of network message  
Patent #
CN 108,718,314 A
Filed 06/01/2018

Current Assignee

Method for password protection for constructing unidirectional hash function based on infinite dimension ultrachaos  
Patent #
CN 101,237,320 A
Filed 02/04/2008

Current Assignee

Integral nonlinear mappingbased hash function constructing method  
Patent #
CN 101,741,560 A
Filed 11/14/2008

Current Assignee

Method and system for generating message digest  
Patent #
CN 102,412,961 A
Filed 09/19/2010

Current Assignee

SM3 password hash algorithm and method for determining variable characters therein  
Patent #
CN 102,761,414 A
Filed 04/26/2011

Current Assignee

9 Claims

1. eapmessage digest method and system based on path hash, principal character includes:

First set transform sequence, eapmessage digest, paths planning method, then message packet, packet hash, be in harmonious proportion and hash,Rear output message summary character string. Message packet and path hashing algorithm are the principal characters of system.


2. group technology principal character based on right 1 is as follows:

Packet refers to be grouped by the bit number of computer, and the definition having k position is k packet.Assuming that packet count is h, the word chosenSymbol number is g, then have g*8=h*k, and packet sequence is defined as D_{i}[h], i represents the ith packet of list entries. Setting the steplength chosen, the information of input is divided into some groups, often organize the requirement needing to meet packet, not enough needs benefitFilling, the general sequence number supplementing this packet adds sequence number and the packet size remainder of compensating elements.Assuming that grouping serial number is i,Serial number h required supplementation with, packet sequence is D_{i}, the size of transform sequence be n, n be the k power of 2, then have supplementary element D_{i}[h]=(i+h) %n, % represent complementation.


3. transform sequence based on right 1, it is characterised in that:

Transform sequence is mainly used in Path selection.Being defined as R [i], have k power the element of 2, k is the figure place of packet；
Conversion sequenceRow need to represent that the k power that the value that all of k bit is grouped, the i.e. value of transform sequence are 0 to 2 subtracts one.R [i] is the next node of inode, defines path according to this.


4. eapmessage digest based on right 1, it is characterised in that:

Have k power the element of 2, k be packet figure place, value be 0 to 2 k power subtract one.Initialization value can be transform sequenceValue, it is also possible to additionally set. Eapmessage digest store path hash calculate result, be defined as S [i], i be 0 to 2 k power subtract one.


5. describing according to right 1, path hashing algorithm is characterised by:
Path planning, selected computing unit, algorithm is selected.The information of input can affect p unit of path planning, and p is pathThe degree of depth, concrete impact is determined by algorithm H.

6. the path planning described based on right 5 is characterised by:

Transform sequence R, the degree of depth is p, selects function F.Unitary Path selection definition F (i+1)=R [F (i)]. Transform sequence R, the degree of depth is p, selects function Rf.Binary Path selection definition Rf (i+1, j+1)=R [Rf (i, j)], j isThe disturbance hash factor.Considering the disturbance of packet sequence, selection algorithm is defined as Rf (i+1, D_{i+1}[h])=R [Rf (i, D_{i}[h])]。 Path diversity selects similar with binary Path selection.


7. packet based on right 1 hash, it is characterised in that:

Grouping information hashes.Grouping information D_{i}[h], is circulated computing to h. Computing unit comes from eapmessage digest sequence S [i], grouping information D_{i}[h], path planning is shown in the requirement of right 6.Assuming that roadFootpath is chosen as unitary routing algorithm, i.e. F (i+1)=R [F (i)]. Grouping information hashes again.Computing unit comes from eapmessage digest sequence, transform sequence, and path planning is shown in the requirement of right 6,Assuming that Path selection is binary routing algorithm, i.e. Rf (i+1, D_{i+1}[h])=R [F (i, D_{i}[h]]。 Assuming that algorithm is H (S [i], D_{i}[h]), then there are S [i]=H (S [i], D_{i}[h]), h is the size of grouping information. Packet hashing algorithm is expressed as follows; Algorithms selection participates in value S [F (i)] calculated, D by path_{i}[h], path planning is shown in the requirement of right 6, it is assumed that path functionFor F (i), pathdepth is p, and algorithm is H (S [i], D_{i}[h]), then descend column count to circulate p time； Pt=F (i), S [Pt]=H (S [Pt], D_{i}[h])； Select next step path, F (i+1)=R [F (i)], i.e. Pt=F (i+1)=R [F (i)], repeat previous step and calculate, untilMeet cycling condition. Hash again.Algorithms selection participates in value S [Pt] calculated by path, and path planning is shown in the requirement of right 6, it is assumed that Rf is i and D_{i}The binary Path selection function of [h], pathdepth is p, and algorithm is H (S [i], R [i]), then descend column count to circulate p time; Pt=Rf (i, D_{i}[h]), S [Pt]=H (S [Pt], R [i])； Select next step path, i.e. Pt=R [Pt], repeat previous step and calculate, until meeting cycling condition.


8. blending based on right 1 hash, it is characterised in that:

The algorithm hashed the value of eapmessage digest sequence by path calculates, and blending hash operations unit is eapmessage digest sequenceIn value.Path planning is shown in the requirement of right 6, it is assumed that Path selection is unitary routing algorithm F (i), computational methods definition H(O [i], S [Pt]).It is described in detail below; Definition output sequence is O [i], and size is equal to the size of summary sequence, and summary sequence is S [i], then have; Mediation computing unit is S [i], O [i]； Compose initial value, O [i]=S [i]； Calculating Path selection, path planning is shown in the requirement of right 6, and it is p that definition calculates pathdepth, then circulation p time; Pt=F (i) is chosen in path； O [i]=H (O [i], S [Pt])； Select next step path, i.e. Pt=R [Pt], repeat previous step and calculate, until meeting cycling condition. O [i] is copied to S [i].Eapmessage digest sequence is S [i].


9. eapmessage digest based on right 1 output, is primarily characterized in that:

Definition character string represents, k power character representation Ch [n] of definition 2, and wherein n is expressed as the k power of 0 to 2 and subtracts one；
SThe eapmessage digest of [i] is output as Ch [S [i]], and wherein i is expressed as the k power of 0 to 2 and subtracts one.Such as;
the digest algorithm of 6bit packet, eapmessage digest a length of 6 is multiplied by 6 powers of 2,384bit altogether, string representationCan choose;
0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRST UVWXYZ=disappearsAfter breath summary is converted to 8 of standard, exporting with hexadecimal representation, string table is shown as 0123456789abcdef.

Specification(s)