论文信息 - Modified Grøstl: An Efficient Hash Function

Modified Grøstl: An Efficient Hash Function

The cryptographic hash function Grostl is one of the five finalists of SHA-3 competition organized by US National Institute of Standards and Technology (NIST). In this paper we propose a modified Grostl-256 hash algorithm, which is 1.2 times faster than Grostl-256 and as secure as Grostl-256. We further show that the modified Grostl performs equally well as the original one when compared against standard metrics that are used to evaluate hash functions. A prototype tool developed to compare and evaluate the modified and the original Grostl-256 algorithm has been used for this purpose.

Gurpreet Kaur | Saibal K. Pal | Vidyavati S. Nayak | Dhananjoy Dey

[1] Vasilios Zorkadis,et al. A novel suite of tests for evaluating one-way hash functions for electronic commerce applications , 2000, Proceedings of the 26th Euromicro Conference. EUROMICRO 2000. Informatics: Inventing the Future.

[2] Helena Handschuh,et al. Security Analysis of SHA-256 and Sisters , 2003, Selected Areas in Cryptography.

[3] Dhananjoy Dey,et al. R-hash : Hash Function Using Random Quadratic Polynomials Over GF(2) , 2011, IACR Cryptol. ePrint Arch..

[4] Florian Mendel,et al. Symmetric Cryptography , 2009 .

[5] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[6] Aggelos Kiayias,et al. Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[7] Willi Meier,et al. SHA-3 proposal BLAKE , 2009 .

[8] Shirley M. Radack,et al. Secure Hash Standard: Updated Specifications Approved and Issued as Federal Information Processing Standard (FIPS) 180-4 | NIST , 2012 .