![]() The computer program product of claim 13, wherein the data block is divided into an equal number of segments.ġ7. The computer program product of claim 13, wherein the S(b) references a salt value.ġ6. The computer program of claim 1, wherein the y number of bytes selected is a function of a number of computations needed to avoid producing the same hash for two different blocks.ġ5. A computer program product embodied on a non-transitory computer readable medium, the computer program product including instructions that, when executed by a computer causes the computer to perform operations comprising: identifying a data block (block b) of a given size dividing the data block into x number of segments selecting y number of bytes from each of the segments, totaling y_total bytes performing a bitwise and/or operation on a z number of the y_total bytes, the bitwise and/or operation producing S(b) calculating a hash function on the data block producing a number of bytes hash, the hash function resulting in a hash value (H′(b)) and calculating the hash function on a concatenation of the hash value and S(b).ġ4. ![]() The system of claim 7, wherein the hash function is a MURMUR function.ġ3. ![]() The system of claim 7, wherein the hash function is one of a SHA1 function and a SHA2 function.ġ2. The system of claim 7, wherein the data block is divided into an equal number of segments.ġ1. The system of claim 7, wherein the S(b) references a salt value.ġ0. The system of claim 7, wherein the y number of bytes selected is a function of a number of computations needed to avoid producing the same hash for two different blocks.ĩ. A system, comprising: a memory comprising computer-executable instructions and a processor executing the computer-executable instructions, the computer-executable instructions when executed by the processor cause the processor to perform operations comprising: identifying a data block (block b) of a given size dividing the data block into x number of segments selecting y number of bytes from each of the segments, totaling y_total bytes performing a bitwise and/or operation on a z number of the y_total bytes, the bitwise and/or operation producing S(b) calculating a hash function on the data block producing a number of bytes hash, the hash function resulting in a hash value (H′(b)) and calculating the hash function on a concatenation of the hash value and S(b).Ĩ. The method of claim 1, wherein the hash function is a MURMUR function.ħ. ![]() The method of claim 1, wherein the hash function is one of a SHA1 function and a SHA2 function.Ħ. The method of claim 1, wherein the data block is divided into an equal number of segments.ĥ. The method of claim 1, wherein the S(b) references a salt value.Ĥ. The method of claim 1, wherein the y number of bytes selected is a function of a number of computations needed to avoid producing the same hash for two different blocks.ģ. A method comprising: identifying a data block (block b) of a given size dividing the data block into x number of segments selecting y number of bytes from each of the segments, totaling y_total bytes performing a bitwise and/or operation on a z number of the y_total bytes, the bitwise and/or operation producing S(b) calculating a hash function on the data block producing a number of bytes hash, the hash function resulting in a hash value (H′(b)) and calculating the hash function on a concatenation of the hash value and S(b).Ģ. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |