Skip to Main Content
In this paper, we propose a new and efficient cryptographic hash function based on random Latin squares and non-linear transformations. The developed scheme satisfies basic as well as desirable properties of an ideal hash function. Use of repeated lookup on Latin squares, non-linear transformations and complex shift operations further increase the strength of our cryptographic hash function at a low computational overhead. It also ensures pre-image resistance and collision resistance as required for the present day lightweight cryptographic applications.
Date of Conference: 6-7 March 2009