A fast portable implementation of the Secure Hash Algorithm, III.
In 1992, NIST announced a proposed standard for a collision-free hash function. The algorithm for producing the hash value is known as the Secure Hash Algorithm (SHA), and the standard using the algorithm in known as the Secure Hash Standard (SHS). Later, an announcement was made that a scientist at NSA had discovered a weakness in the original algorithm. A revision to this standard was then announced as FIPS 180-1, and includes a slight change to the algorithm that eliminates the weakness. This new algorithm is called SHA-1. In this report we describe a portable and efficient implementation of SHA-1 in the C language. Performance information is given, as well as tips for porting the code to other architectures. We conclude with some observations on the efficiency of the algorithm, and a discussion of how the efficiency of SHA might be improved.
- Research Organization:
- Sandia National Laboratories
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 966238
- Report Number(s):
- SAND93-2591
- Country of Publication:
- United States
- Language:
- English
Similar Records
Implementation of the AES as a Hash Function for Confirming the Identity of Software on a Computer System
Module-OT: A Turnkey Solution for Securing Energy Systems
Parallelism of the SANDstorm hash algorithm.
Technical Report
·
Sun Jan 19 23:00:00 EST 2003
·
OSTI ID:15010189
Module-OT: A Turnkey Solution for Securing Energy Systems
Conference
·
Tue Sep 27 00:00:00 EDT 2022
·
OSTI ID:1890744
Parallelism of the SANDstorm hash algorithm.
Technical Report
·
Tue Sep 01 00:00:00 EDT 2009
·
OSTI ID:993877