unithash

Unithash hashing algorithm - a variable length segmentable hashing algorithm calculated by recursively adding the digits in a number till the sum is a single digit.

Hashing algorithm

Given a large number, break up the number into equal length segments. Then apply the unit-sum function recursively on each segment and combine all segments to form a single hash value. The length of the segments can also depending on the type of content being hashed. An important aspect here is handling of alphabetic and non-alphanumeric characters. In order to handle these, the algorithm converts the character to their ASCII values and then converts them to corresponding mappings to the positions in the alphabets series and use them to create the hash. Thus the mappings become a = 0, z = 26 and likewise for the other characters.

Functions usage

There are 2 major functions defined in this library -

        + find.get_unithash (arg1: integer)
       
        + find.set_unithash (arg1: string, arg2: integer)

The first function is used to get the unit sum value of a given number. It expects only 1 argument of type integer as input, which would be the number for which we wish to calculate the unit sum.

The second function is actual hashing algorithm implementation. It takes in 2 arguments. Argument 1 is the content to be hashed in the form of a string. Argument 2 is used to set the segment distribution length. Varying the segmentation length, would generate varying hash digests for the same text.

Using the Library

In order to use this hashing algorithm in your code, do a pip install for the library.

pip install unithash

Then in the python code import the library and its corresponding functions and that's it! Here's a sample code -