A method of collision-free hashing of near-match by selecting bit positions d that differ between a first input and a second input, selecting a degree of a first polynomial for a cyclic code proportional to d, selecting a bit length i of the first input and the second input, selecting a bit length cv of a check value greater than or equal to d, setting n>=i+cv, generating the first polynomial that divides x.sup.n+1, factoring the first polynomial into a second and a third polynomials, receiving the first input, dividing the first input by the second polynomial, dividing the first input by the third polynomial, and identifying the results of the last two steps as a hash of the first input.Method of collision-free hashing for near-match inputs835550115/01/201303/02/20122013347Newhart; Donald W.US Patent and Trademark OfficeGoogle Patent Searchpatentimages.storage.googleapis.com/US8355501B1/US08355501-20130115-D00000.pngUniquefirst inputsecond inputthird polynomialbit lengthmethodcyclic codefirst polynomialbit positionsnear-match inputssecond polynomial