ASH-160: A novel algorithm for secure hashing using geometric concepts

Cryptographic hash function plays a pivotal role in many parts of cryptographic algorithms and protocols, especially in authentication, non-repudiation and data integrity services. A cryptographic hash function takes an input of arbitrary large size message and produces a fixed small size hash code as an output. In the proposed hash algorithm ASH-160 (Algorithm for Secure Hashing-160), each 512-bit block of a message is first reduced to 480-bit block and then divided into ten equal blocks and each one is further divided into three sub-blocks of 16-bits each. These three sub-blocks act as three points of a triangle, which are used in Area calculation. The calculated area values are in turn processed to generate message digest. ASH-160 is simple to construct, easy to implement and exhibits strong avalanche effect, when compared to SHA1 and RIPEMD160.