This paper contains techniques for enhancing the strength of any cryptographic hash function. For an ”ideal”, traditional hash function with an m-bit result, the complexity of a collision attack is approximately 2^m/2. Here constructions are presented where collisions are harder to find.

With the succumbing of various Hash functions to collision attacks, there have been serious research efforts to design new Hash functions which are robust against various contemporary attacks. MAYHAM is one such hash function that has been designed keeping in view the cryptographic properties needed yet resistant to all the publically known attacks. MAYHAM is designed as a simple and efficient hash function as compared to other dedicated hash functions. Main operations involved in MAYHAM’s hash computation include S-box, MDS Matrix multiplication, data mixing, XOR, addition and interleaving. MAYHAM supports parallel processing in its compression function and can be efficiently implemented by using lookup tables.

background

/pdf/mayham-a-new-hash-function-1blz78qr53.pdf

Small Size Hashes with Enhanced Security

MAYHAM - A New Hash Function

/pdf/small-size-hashes-with-enhanced-security-4i3iimg4ei.pdf

Small Size Hashes with Enhanced Security

Citations

MAYHAM - A New Hash Function

Related Papers (5)

Elliptic Curve Multiset Hash

Polynomial Hash Functions Are Reliable (Extended Abstract)

Hash function security : cryptanalysis of the Very Smooth Hash and multicollisions in generalised iterated hash functions

Efficient chameleon hash functions in the enhanced collision resistant model

Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures