Design of Hash Algorithm Using Latin Square

Abstract In this paper, we have proposed a new and an efficient cryptographic hash function based on random Latin squares generated through padding, shift operations and non-linear transformations. The developed hash scheme satisfies basic as well as desirable properties of an ideal hash function. Generation of Latin Squares for each plain text block strengthens the hash function. Removal of Duplicates and random padding have been implemented to achieve confusion and diffusion. Use of repeated lookups on Latin squares, non-linear transformations and complex shift operations further increase the strength of our cryptographic hash function at a low computational overhead and ensures that the hashing algorithm satisfy the principal properties of pre-image resistance and collision resistance.

[1]  Omer Reingold,et al.  A New Interactive Hashing Theorem , 2007, Computational Complexity Conference.

[2]  Kristin E. Lauter,et al.  Cryptographic Hash Functions from Expander Graphs , 2008, Journal of Cryptology.

[3]  María Naya-Plasencia,et al.  Quark: A Lightweight Hash , 2010, CHES.

[4]  Saibal K. Pal,et al.  A New Cryptographic Hash Function based on Latin Squares and Non-linear Transformations , 2009, 2009 IEEE International Advance Computing Conference.

[5]  Václav Snásel,et al.  Hash Functions Based on Large Quasigroups , 2009, ICCS.