A New (n, n) Blockcipher Hash Function: Apposite for Short Messages

In this paper, a new (n, n) double block length hash function has been introduced where collision and preimage security bound is respectively O (2^tn) and O (2^2tn). The strategic point of this scheme is able to handle short message tn (t <; 1) bit, which is very significant issue for RFID tag security. It is known that the RFID tag needs to proceed short message but MDC-2, MDC-4, MJH are not properly suitable for meeting this criteria due to their constructions where these schemes can handle message size n bit (n = 128). Additionally the security bound of the proposed scheme is better than existing other (n, n) blockcipher schemes such as MDC-2, MDC-4, MJH and as well as obtaining higher efficient rate.