SHA-1

Applications

Cryptography

SHA-1 forms part of several widely used security applications and protocols, including TLS and SSL, PGP, SSH, S/MIME, and IPsec. Those applications can also use MD5; both MD5 and SHA-1 are descended from MD4.

SHA-1 and SHA-2 are the hash algorithms required by law for use in certain U.S. government applications, including use within other cryptographic algorithms and protocols, for the protection of sensitive unclassified information. FIPS PUB 180-1 also encouraged adoption and use of SHA-1 by private and commercial organizations. SHA-1 is being retired from most government uses; the U.S. National Institute of Standards and Technology said, "Federal agencies should stop using SHA-1 for...applications that require collision resistance as soon as practical, and must use the SHA-2 family of hash functions for these applications after 2010", though that was later relaxed to allow SHA-1 to be used for verifying old digital signatures and time stamps.

A prime motivation for the publication of the Secure Hash Algorithm was the Digital Signature Standard, in which it is incorporated.

The SHA hash functions have been used for the basis of the SHACAL block ciphers.

Data integrity

Version control systems such as Git, Mercurial, and Monotone use SHA-1, not for security, but to identify revisions and to ensure that the data has not changed due to accidental corruption. Linus Torvalds said about Git in 2007:

If you have disk corruption, if you have DRAM corruption, if you have any kind of problems at all, Git will notice them. It's not a question of if, it's a guarantee. You can have people who try to be malicious. They won't succeed. [...] Nobody has been able to break SHA-1, but the point is the SHA-1, as far as Git is concerned, isn't even a security feature. It's purely a consistency check. The security parts are elsewhere, so a lot of people assume that since Git uses SHA-1 and SHA-1 is used for cryptographically secure stuff, they think that, Okay, it's a huge security feature. It has nothing at all to do with security, it's just the best hash you can get. ...

I guarantee you, if you put your data in Git, you can trust the fact that five years later, after it was converted from your hard disk to DVD to whatever new technology and you copied it along, five years later you can verify that the data you get back out is the exact same data you put in. [...]

One of the reasons I care is for the kernel, we had a break in on one of the BitKeeper sites where people tried to corrupt the kernel source code repositories.

However Git does not require the second preimage resistance of SHA-1 as a security feature, since it will always prefer to keep the earliest version of an object in case of collision, preventing an attacker from surreptitiously overwriting files. The known attacks (as of 2020) also do not break second preimage resistance.

Cryptanalysis and validation

For a hash function for which L is the number of bits in the message digest, finding a message that corresponds to a given message digest can always be done using a brute force search in approximately 2^L evaluations. This is called a preimage attack and may or may not be practical depending on L and the particular computing environment. However, a collision, consisting of finding two different messages that produce the same message digest, requires on average only about 1.2 × 2^L/2 evaluations using a birthday attack. Thus the strength of a hash function is usually compared to a symmetric cipher of half the message digest length. SHA-1, which has a 160-bit message digest, was originally thought to have 80-bit strength.

Some of the applications that use cryptographic hashes, like password storage, are only minimally affected by a collision attack. Constructing a password that works for a given account requires a preimage attack, as well as access to the hash of the original password, which may or may not be trivial. Reversing password encryption (e.g. to obtain a password to try against a user's account elsewhere) is not made possible by the attacks. However, even a secure password hash can't prevent brute-force attacks on weak passwords. See Password cracking.

In the case of document signing, an attacker could not simply fake a signature from an existing document: The attacker would have to produce a pair of documents, one innocuous and one damaging, and get the private key holder to sign the innocuous document. There are practical circumstances in which this is possible; until the end of 2008, it was possible to create forged SSL certificates using an MD5 collision.

Due to the block and iterative structure of the algorithms and the absence of additional final steps, all SHA functions (except SHA-3) are vulnerable to length-extension and partial-message collision attacks. These attacks allow an attacker to forge a message signed only by a keyed hash – SHA(key || message), but not SHA(message || key) – by extending the message and recalculating the hash without knowing the key. A simple improvement to prevent these attacks is to hash twice: SHA_d(message) = SHA(SHA(0^b || message)) (the length of 0^b, zero block, is equal to the block size of the hash function).

SHA-0

At CRYPTO 98, two French researchers, Florent Chabaud and Antoine Joux, presented an attack on SHA-0: collisions can be found with complexity 2⁶¹, fewer than the 2⁸⁰ for an ideal hash function of the same size.

In 2004, Biham and Chen found near-collisions for SHA-0 – two messages that hash to nearly the same value; in this case, 142 out of the 160 bits are equal. They also found full collisions of SHA-0 reduced to 62 out of its 80 rounds.

Subsequently, on 12 August 2004, a collision for the full SHA-0 algorithm was announced by Joux, Carribault, Lemuet, and Jalby. This was done by using a generalization of the Chabaud and Joux attack. Finding the collision had complexity 2⁵¹ and took about 80,000 processor-hours on a supercomputer with 256 Itanium 2 processors (equivalent to 13 days of full-time use of the computer).

On 17 August 2004, at the Rump Session of CRYPTO 2004, preliminary results were announced by Wang, Feng, Lai, and Yu, about an attack on MD5, SHA-0 and other hash functions. The complexity of their attack on SHA-0 is 2⁴⁰, significantly better than the attack by Joux et al.

In February 2005, an attack by Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu was announced which could find collisions in SHA-0 in 2³⁹ operations.

Another attack in 2008 applying the boomerang attack brought the complexity of finding collisions down to 2^33.6, which was estimated to take 1 hour on an average PC from the year 2008.

In light of the results for SHA-0, some experts suggested that plans for the use of SHA-1 in new cryptosystems should be reconsidered. After the CRYPTO 2004 results were published, NIST announced that they planned to phase out the use of SHA-1 by 2010 in favor of the SHA-2 variants.

Attacks

In early 2005, Vincent Rijmen and Elisabeth Oswald published an attack on a reduced version of SHA-1 – 53 out of 80 rounds – which finds collisions with a computational effort of fewer than 2⁸⁰ operations.

In February 2005, an attack by Xiaoyun Wang, Yiqun Lisa Yin, and Hongbo Yu was announced. The attacks can find collisions in the full version of SHA-1, requiring fewer than 2⁶⁹ operations. (A brute-force search would require 2⁸⁰ operations.)

The authors write: "In particular, our analysis is built upon the original differential attack on SHA-0, the near collision attack on SHA-0, the multiblock collision techniques, as well as the message modification techniques used in the collision search attack on MD5. Breaking SHA-1 would not be possible without these powerful analytical techniques." The authors have presented a collision for 58-round SHA-1, found with 2³³ hash operations. The paper with the full attack description was published in August 2005 at the CRYPTO conference.

In an interview, Yin states that, "Roughly, we exploit the following two weaknesses: One is that the file preprocessing step is not complicated enough; another is that certain math operations in the first 20 rounds have unexpected security problems."

On 17 August 2005, an improvement on the SHA-1 attack was announced on behalf of Xiaoyun Wang, Andrew Yao and Frances Yao at the CRYPTO 2005 Rump Session, lowering the complexity required for finding a collision in SHA-1 to 2⁶³. On 18 December 2007 the details of this result were explained and verified by Martin Cochran.

Christophe De Cannière and Christian Rechberger further improved the attack on SHA-1 in "Finding SHA-1 Characteristics: General Results and Applications," receiving the Best Paper Award at ASIACRYPT 2006. A two-block collision for 64-round SHA-1 was presented, found using unoptimized methods with 2³⁵ compression function evaluations. Since this attack requires the equivalent of about 2³⁵ evaluations, it is considered to be a significant theoretical break. Their attack was extended further to 73 rounds (of 80) in 2010 by Grechnikov. In order to find an actual collision in the full 80 rounds of the hash function, however, tremendous amounts of computer time are required. To that end, a collision search for SHA-1 using the volunteer computing platform BOINC began August 8, 2007, organized by the Graz University of Technology. The effort was abandoned May 12, 2009 due to lack of progress.

At the Rump Session of CRYPTO 2006, Christian Rechberger and Christophe De Cannière claimed to have discovered a collision attack on SHA-1 that would allow an attacker to select at least parts of the message.

In 2008, an attack methodology by Stéphane Manuel reported hash collisions with an estimated theoretical complexity of 2⁵¹ to 2⁵⁷ operations. However he later retracted that claim after finding that local collision paths were not actually independent, and finally quoting for the most efficient a collision vector that was already known before this work.

Cameron McDonald, Philip Hawkes and Josef Pieprzyk presented a hash collision attack with claimed complexity 2⁵² at the Rump Session of Eurocrypt 2009. However, the accompanying paper, "Differential Path for SHA-1 with complexity O(2⁵²)" has been withdrawn due to the authors' discovery that their estimate was incorrect.

One attack against SHA-1 was Marc Stevens with an estimated cost of $2.77M (2012) to break a single hash value by renting CPU power from cloud servers. Stevens developed this attack in a project called HashClash, implementing a differential path attack. On 8 November 2010, he claimed he had a fully working near-collision attack against full SHA-1 working with an estimated complexity equivalent to 2^57.5 SHA-1 compressions. He estimated this attack could be extended to a full collision with a complexity around 2⁶¹.

The SHAppening

On 8 October 2015, Marc Stevens, Pierre Karpman, and Thomas Peyrin published a freestart collision attack on SHA-1's compression function that requires only 2⁵⁷ SHA-1 evaluations. This does not directly translate into a collision on the full SHA-1 hash function (where an attacker is not able to freely choose the initial internal state), but undermines the security claims for SHA-1. In particular, it was the first time that an attack on full SHA-1 had been demonstrated; all earlier attacks were too expensive for their authors to carry them out. The authors named this significant breakthrough in the cryptanalysis of SHA-1 The SHAppening.

The method was based on their earlier work, as well as the auxiliary paths (or boomerangs) speed-up technique from Joux and Peyrin, and using high performance GPU cards. The collision was found on a 16-node cluster with a total of 64 graphics cards. The authors estimated that a similar collision could be found by buying US$2,000 of GPU time on EC2.

The authors estimated that the cost of renting enough of EC2 CPU/GPU time to generate a full collision for SHA-1 at the time of publication was between US$75K and $120K, and noted that was well within the budget of criminal organizations, not to mention national intelligence agencies. As such, the authors recommended that SHA-1 be deprecated as quickly as possible.

SHAttered – first public collision

On 23 February 2017, the CWI (Centrum Wiskunde & Informatica) and Google announced the SHAttered attack, in which they generated two different PDF files with the same SHA-1 hash in roughly 2^63.1 SHA-1 evaluations. This attack is about 100,000 times faster than brute forcing a SHA-1 collision with a birthday attack, which was estimated to take 2⁸⁰ SHA-1 evaluations. The attack required "the equivalent processing power of 6,500 years of single-CPU computations and 110 years of single-GPU computations".

Birthday-Near-Collision Attack – first practical chosen-prefix attack

On 24 April 2019 a paper by Gaëtan Leurent and Thomas Peyrin presented at Eurocrypt 2019 described an enhancement to the previously best chosen-prefix attack in Merkle–Damgård–like digest functions based on Davies–Meyer block ciphers. With these improvements, this method is capable of finding chosen-prefix collisions in approximately 2⁶⁸ SHA-1 evaluations. This is approximately 550 times faster (and now usable for many targeted attacks, thanks to the possibility of choosing a prefix, for example malicious code or faked identities in signed certificates) than the previous attack's 2^77.1 evaluations (but without chosen prefix, which was impractical for most targeted attacks because the found collisions were almost random) and is fast enough to be practical for resourceful attackers, requiring approximately $100,000 of cloud processing. This method is also capable of finding chosen-prefix collisions in the MD5 function, but at a complexity of 2^46.3 does not surpass the prior best available method at a theoretical level (2³⁹), though potentially at a practical level (≤2⁴⁹). This attack has a memory requirement of 500+ GB.

On 5 January 2020 the authors published an improved attack called "shambles". In this paper they demonstrate a chosen-prefix collision attack with a complexity of 2^63.4, that at the time of publication would cost US$45K per generated collision.

Official validation

Implementations of all FIPS-approved security functions can be officially validated through the CMVP program, jointly run by the National Institute of Standards and Technology (NIST) and the Communications Security Establishment (CSE). For informal verification, a package to generate a high number of test vectors is made available for download on the NIST site; the resulting verification, however, does not replace the formal CMVP validation, which is required by law for certain applications.

As of December 2013, there are over 2000 validated implementations of SHA-1, with 14 of them capable of handling messages with a length in bits not a multiple of eight (see SHS Validation List Archived 2011-08-23 at the Wayback Machine).

Examples and pseudocode

Example hashes

These are examples of SHA-1 message digests in hexadecimal and in Base64 binary to ASCII text encoding.

• SHA1("The quick brown fox jumps over the lazy dog")
  • Outputted hexadecimal: 2fd4e1c67a2d28fced849ee1bb76e7391b93eb12
  • Outputted Base64 binary to ASCII text encoding: L9ThxnotKPzthJ7hu3bnORuT6xI=

Even a small change in the message will, with overwhelming probability, result in many bits changing due to the avalanche effect. For example, changing dog to cog produces a hash with different values for 81 of the 160 bits:

• SHA1("The quick brown fox jumps over the lazy cog")
  • Outputted hexadecimal: de9f2c7fd25e1b3afad3e85a0bd17d9b100db4b3
  • Outputted Base64 binary to ASCII text encoding: 3p8sf9JeGzr60+haC9F9mxANtLM=

The hash of the zero-length string is:

• SHA1("")
  • Outputted hexadecimal: da39a3ee5e6b4b0d3255bfef95601890afd80709
  • Outputted Base64 binary to ASCII text encoding: 2jmj7l5rSw0yVb/vlWAYkK/YBwk=

SHA-1 pseudocode

Pseudocode for the SHA-1 algorithm follows:

<span style="color: green;" id="mwAjw"><i id="mwAj0">Note 1: All variables are unsigned 32-bit quantities and wrap modulo 2<sup id="mwAj4">32</sup> when calculating, except for</i></span> <span style="color: green;" id="mwAj8"><i id="mwAkA">ml, the message length, which is a 64-bit quantity, and</i></span> <span style="color: green;" id="mwAkE"><i id="mwAkI">hh, the message digest, which is a 160-bit quantity.</i></span> <span style="color: green;" id="mwAkM"><i id="mwAkQ">Note 2: All constants in this pseudo code are in <a rel="mw:WikiLink" href="./Endianness" title="Endianness" id="mwAkU">big endian</a>.</i></span> <span style="color: green;" id="mwAkY"><i id="mwAkc">Within each word, the most significant byte is stored in the leftmost byte position</i></span> <span style="color: green;" id="mwAkg"><i id="mwAkk">Initialize variables:</i></span> h0 = 0x67452301 h1 = 0xEFCDAB89 h2 = 0x98BADCFE h3 = 0x10325476 h4 = 0xC3D2E1F0 ml = message length in bits (always a multiple of the number of bits in a character). <span style="color: green;" id="mwAko"><i id="mwAks">Pre-processing:</i></span> append the bit '1' to the message e.g. by adding 0x80 if message length is a multiple of 8 bits. append 0 ≤ k <span typeof="mw:Entity" id="mwAkw"><</span> 512 bits '0', such that the resulting message length in <i id="mwAk0">bits</i> is <a rel="mw:WikiLink" href="./Modular_arithmetic" title="Modular arithmetic" id="mwAk4">congruent</a> to −64 ≡ 448 (mod 512) append ml, the original message length in bits, as a 64-bit <a rel="mw:WikiLink" href="./Endianness" title="Endianness" id="mwAk8">big-endian</a> integer. Thus, the total length is a multiple of 512 bits. <span style="color: green;" id="mwAlA"><i id="mwAlE">Process the message in successive 512-bit chunks:</i></span> break message into 512-bit chunks <b id="mwAlI">for</b> each chunk break chunk into sixteen 32-bit big-endian words w[i], 0 ≤ i ≤ 15 <span style="color: green;" id="mwAlM"><i id="mwAlQ">Message schedule: extend the sixteen 32-bit words into eighty 32-bit words:</i></span> <b id="mwAlU">for</b> i <b id="mwAlY">from</b> 16 to 79 <span style="color: green;" id="mwAlc"><i id="mwAlg">Note 3: SHA-0 differs by not having this leftrotate.</i></span> w[i] = (w[i-3] <b id="mwAlk">xor</b> w[i-8] <b id="mwAlo">xor</b> w[i-14] <b id="mwAls">xor</b> w[i-16]) <b id="mwAlw"><a rel="mw:WikiLink" href="./Circular_shift" title="Circular shift" id="mwAl0">leftrotate</a></b> 1 <span style="color: green;" id="mwAl4"><i id="mwAl8">Initialize hash value for this chunk:</i></span> a = h0 b = h1 c = h2 d = h3 e = h4 <span style="color: green;" id="mwAmA"><i id="mwAmE">Main loop:</i></span><sup about="#mwt212" class="mw-ref reference" id="cite_ref-:0_3-1" rel="dc:references" typeof="mw:Extension/ref" data-mw='{"name":"ref","attrs":{"name":":0"}}'><a href="./SHA-1#cite_note-:0-3" id="mwAmI"><span class="mw-reflink-text" id="mwAmM"><span class="cite-bracket" id="mwAmQ">[</span>3<span class="cite-bracket" id="mwAmU">]</span></span></a></sup><sup about="#mwt215" class="mw-ref reference" id="cite_ref-56" rel="dc:references" typeof="mw:Extension/ref" data-mw='{"name":"ref","attrs":{},"body":{"id":"mw-reference-text-cite_note-56"}}'><a href="./SHA-1#cite_note-56" id="mwAmY"><span class="mw-reflink-text" id="mwAmc"><span class="cite-bracket" id="mwAmg">[</span>56<span class="cite-bracket" id="mwAmk">]</span></span></a></sup> <b id="mwAmo">for</b> i <b id="mwAms">from</b> 0 <b id="mwAmw">to</b> 79 <b id="mwAm0">if</b> 0 ≤ i ≤ 19 <b id="mwAm4">then</b> f = (b <b id="mwAm8">and</b> c) <b id="mwAnA">or</b> ((<b id="mwAnE">not</b> b) <b id="mwAnI">and</b> d) k = 0x5A827999 <b id="mwAnM">else if</b> 20 ≤ i ≤ 39 f = b <b id="mwAnQ">xor</b> c <b id="mwAnU">xor</b> d k = 0x6ED9EBA1 <b id="mwAnY">else if</b> 40 ≤ i ≤ 59 f = (b <b id="mwAnc">and</b> c) <b id="mwAng">or</b> (b <b id="mwAnk">and</b> d) <b id="mwAno">or</b> (c <b id="mwAns">and</b> d) k = 0x8F1BBCDC <b id="mwAnw">else if</b> 60 ≤ i ≤ 79 f = b <b id="mwAn0">xor</b> c <b id="mwAn4">xor</b> d k = 0xCA62C1D6 temp = (a <b id="mwAn8">leftrotate</b> 5) + f + e + k + w[i] e = d d = c c = b <b id="mwAoA">leftrotate</b> 30 b = a a = temp <span style="color: green;" id="mwAoE"><i id="mwAoI">Add this chunk's hash to result so far:</i></span> h0 = h0 + a h1 = h1 + b h2 = h2 + c h3 = h3 + d h4 = h4 + e <span style="color:green;" id="mwAoM"><i id="mwAoQ">Produce the final hash value (big-endian) as a 160-bit number:</i></span> hh = (h0 <b id="mwAoU">leftshift</b> 128) <b id="mwAoY">or</b> (h1 <b id="mwAoc">leftshift</b> 96) <b id="mwAog">or</b> (h2 <b id="mwAok">leftshift</b> 64) <b id="mwAoo">or</b> (h3 <b id="mwAos">leftshift</b> 32) <b id="mwAow">or</b> h4

The number hh is the message digest, which can be written in hexadecimal (base 16).

The chosen constant values used in the algorithm were assumed to be nothing up my sleeve numbers:

• The four round constants k are 2³⁰ times the square roots of 2, 3, 5 and 10. However they were incorrectly rounded to the nearest integer instead of being rounded to the nearest odd integer, with equilibrated proportions of zero and one bits. As well, choosing the square root of 10 (which is not a prime) made it a common factor for the two other chosen square roots of primes 2 and 5, with possibly usable arithmetic properties across successive rounds, reducing the strength of the algorithm against finding collisions on some bits.
• The first four starting values for h0 through h3 are the same with the MD5 algorithm, and the fifth (for h4) is similar. However they were not properly verified for being resistant against inversion of the few first rounds to infer possible collisions on some bits, usable by multiblock differential attacks.

Instead of the formulation from the original FIPS PUB 180-1 shown, the following equivalent expressions may be used to compute f in the main loop above:

<span style="color: green;" id="mwApw"><i id="mwAp0">Bitwise choice between </i>c<i id="mwAp4"> and </i>d<i id="mwAp8">, controlled by </i>b<i id="mwAqA">.</i></span> (0 ≤ i ≤ 19): f = d <b id="mwAqE">xor</b> (b <b id="mwAqI">and</b> (c <b id="mwAqM">xor</b> d)) <span style="color: green;" id="mwAqQ"><i id="mwAqU">(alternative 1)</i></span> (0 ≤ i ≤ 19): f = (b <b id="mwAqY">and</b> c) <b id="mwAqc">or</b> ((<b id="mwAqg">not</b> b) <b id="mwAqk">and</b> d) <span style="color: green;" id="mwAqo"><i id="mwAqs">(alternative 2)</i></span> (0 ≤ i ≤ 19): f = (b <b id="mwAqw">and</b> c) <b id="mwAq0">xor</b> ((<b id="mwAq4">not</b> b) <b id="mwAq8">and</b> d) <span style="color: green;" id="mwArA"><i id="mwArE">(alternative 3)</i></span> (0 ≤ i ≤ 19): f = vec_sel(d, c, b) <span style="color: green;" id="mwArI"><i id="mwArM">(alternative 4)</i></span> <span typeof="mw:Entity" id="mwArQ"> </span>[premo08] <span style="color: green;" id="mwArU"><i id="mwArY">Bitwise majority function.</i></span> (40 ≤ i ≤ 59): f = (b <b id="mwArc">and</b> c) <b id="mwArg">or</b> (d <b id="mwArk">and</b> (b <b id="mwAro">or</b> c)) <span style="color: green;" id="mwArs"><i id="mwArw">(alternative 1)</i></span> (40 ≤ i ≤ 59): f = (b <b id="mwAr0">and</b> c) <b id="mwAr4">or</b> (d <b id="mwAr8">and</b> (b <b id="mwAsA">xor</b> c)) <span style="color: green;" id="mwAsE"><i id="mwAsI">(alternative 2)</i></span> (40 ≤ i ≤ 59): f = (b <b id="mwAsM">and</b> c) <b id="mwAsQ">xor</b> (d <b id="mwAsU">and</b> (b <b id="mwAsY">xor</b> c)) <span style="color: green;" id="mwAsc"><i id="mwAsg">(alternative 3)</i></span> (40 ≤ i ≤ 59): f = (b <b id="mwAsk">and</b> c) <b id="mwAso">xor</b> (b <b id="mwAss">and</b> d) <b id="mwAsw">xor</b> (c <b id="mwAs0">and</b> d) <span style="color: green;" id="mwAs4"><i id="mwAs8">(alternative 4)</i></span> (40 ≤ i ≤ 59): f = vec_sel(c, b, c <b id="mwAtA">xor</b> d) <span style="color: green;" id="mwAtE"><i id="mwAtI">(alternative 5)</i></span>

It was also shown that for the rounds 32–79 the computation of:

w[i] = (w[i-3] <b id="mwAtk">xor</b> w[i-8] <b id="mwAto">xor</b> w[i-14] <b id="mwAts">xor</b> w[i-16]) <b id="mwAtw"><a rel="mw:WikiLink" href="./Circular_shift" title="Circular shift" id="mwAt0">leftrotate</a></b> 1

can be replaced with:

w[i] = (w[i-6] <b id="mwAuA">xor</b> w[i-16] <b id="mwAuE">xor</b> w[i-28] <b id="mwAuI">xor</b> w[i-32]) <b id="mwAuM"><a rel="mw:WikiLink" href="./Circular_shift" title="Circular shift" id="mwAuQ">leftrotate</a></b> 2

This transformation keeps all operands 64-bit aligned and, by removing the dependency of w[i] on w[i-3], allows efficient SIMD implementation with a vector length of 4 like x86 SSE instructions.

Comparison of SHA functions

In the table below, internal state means the "internal hash sum" after each compression of a data block.

Implementations

Below is a list of cryptography libraries that support SHA-1:

• Botan
• Bouncy Castle
• cryptlib
• Crypto++
• Libgcrypt
• Mbed TLS
• Nettle
• LibreSSL
• OpenSSL
• GnuTLS

Hardware acceleration is provided by the following processor extensions:

• Intel SHA extensions: Available on some Intel and AMD x86 processors.
• VIA PadLock
• IBM z/Architecture: Available since 2003 as part of the Message-Security-Assist Extension

Collision countermeasure

In the wake of SHAttered, Marc Stevens and Dan Shumow published "sha1collisiondetection" (SHA-1CD), a variant of SHA-1 that detects collision attacks and changes the hash output when one is detected. The false positive rate is 2⁻⁹⁰. SHA-1CD is used by GitHub since March 2017 and git since version 2.13.0 of May 2017.