Cryptology ePrint Archive: Report 2017/891

Finding Bugs in Cryptographic Hash Function Implementations

Nicky Mouha and Mohammad S Raunak and D. Richard Kuhn and Raghu Kacker

Abstract: Cryptographic hash functions are security-critical algorithms with many practical applications, notably in digital signatures. Developing an approach to test them can be particularly difficult, and bugs can remain unnoticed for many years. We revisit the NIST hash function competition, which was used to develop the SHA-3 standard, and apply a new testing strategy to all available reference implementations. Motivated by the cryptographic properties that a hash function should satisfy, we develop four tests. The Bit-Contribution Test checks if changes in the message affect the hash value, and the Bit-Exclusion Test checks that changes beyond the last message bit leave the hash value unchanged. We develop the Update Test to verify that messages are processed correctly in chunks, and then use combinatorial testing methods to reduce the test set size by several orders of magnitude while retaining the same fault-detection capability. Our tests detect bugs in 41 of the 86 reference implementations submitted to the SHA-3 competition, including the rediscovery of a bug in all submitted implementations of the SHA-3 finalist BLAKE. This bug remained undiscovered for seven years, and is particularly serious because it provides a simple strategy to modify the message without changing the hash value returned by the implementation. We detect these bugs using a fully-automated testing approach.

Category / Keywords: implementation / Cryptographic Algorithm, Cryptographic Hash Function, Combinatorial Testing, Metamorphic Testing, SHA-3 Competition

Date: received 13 Sep 2017, last revised 4 May 2018

Contact author: nicky at mouha be

Available format(s): PDF | BibTeX Citation

Version: 20180504:185149 (All versions of this report)

Short URL: ia.cr/2017/891


[ Cryptology ePrint archive ]