[Resource Topic] 2005/247: A Simple and Provably Good Code for SHA Message Expansion

Welcome to the resource topic for 2005/247

A Simple and Provably Good Code for SHA Message Expansion

Authors: Charanjit S. Jutla, Anindya C. Patthak


We develop a new computer assisted technique for lower bounding the
minimum distance of linear codes similar to those used in SHA-1
message expansion. Using this technique, we prove that a modified
SHA-1 like code has minimum distance at least 82, and that too in
just the last 64 of the 80 expanded words. Further the minimum
weight in the last 60 words (last 48 words) is at least 75 (52
respectively). We propose a new compression function which is
identical to SHA-1 except for the modified message expansion code.
We argue that the high minimum weight of the message expansion code
makes the new compression function resistant to recent differential

ePrint: https://eprint.iacr.org/2005/247

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .