International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Simple and Provably Good Code for SHA Message Expansion

Authors:
Charanjit S. Jutla
Anindya C. Patthak
Download:
URL: http://eprint.iacr.org/2005/247
Search ePrint
Search Google
Abstract: 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 attacks.
BibTeX
@misc{eprint-2005-12581,
  title={A Simple and Provably Good Code for SHA Message Expansion},
  booktitle={IACR Eprint archive},
  keywords={Hash Functions, Differential Cryptanalysis, Codes, minimum distance},
  url={http://eprint.iacr.org/2005/247},
  note={ csjutla@us.ibm.com 13000 received 27 Jul 2005, last revised 5 Aug 2005},
  author={Charanjit S. Jutla and Anindya C. Patthak},
  year=2005
}