Example of a Sha 256 Software Free Download
| Secure Hash Algorithms | |
|---|---|
| Concepts | |
| hash functions· SHA· DSA | |
| Chief standards | |
| SHA-0· SHA-1· SHA-2· SHA-3 | |
| General | |
|---|---|
| Designers | National Security Bureau |
| First published | 2001 (2001) |
| Series | (SHA-0), SHA-1, SHA-two, SHA-3 |
| Certification | FIPS PUB 180-4, CRYPTREC, NESSIE |
| Detail | |
| Digest sizes | 224, 256, 384, or 512 $.25 |
| Structure | Merkle–Damgård structure with Davies–Meyer pinch function |
| Rounds | 64 or 80 |
| Best public cryptanalysis | |
| A 2011 assault breaks preimage resistance for 57 out of 80 rounds of SHA-512, and 52 out of 64 rounds for SHA-256.[1] Pseudo-collision attack against up to 46 rounds of SHA-256.[2] SHA-256 and SHA-512 are prone to length extension attacks. By guessing the hidden part of the state, length extension attacks on SHA-224 and SHA-384 succeed with probability 2−(256−224) = 2−32 > 2−224 and 2−(512−384) = 2−128 > two−384 respectively. | |
SHA-2 (Secure Hash Algorithm two) is a set of cryptographic hash functions designed by the United States National Security Bureau (NSA) and starting time published in 2001.[3] [4] They are built using the Merkle–Damgård structure, from a i-mode compression part itself built using the Davies–Meyer structure from a specialized block aught.
SHA-two includes significant changes from its predecessor, SHA-i. The SHA-2 family consists of 6 hash functions with digests (hash values) that are 224, 256, 384 or 512 bits:[5] SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, SHA-512/256. SHA-256 and SHA-512 are novel hash functions computed with 8 32-bit and 64-bit words, respectively. They use different shift amounts and additive constants, merely their structures are otherwise almost identical, differing just in the number of rounds. SHA-224 and SHA-384 are truncated versions of SHA-256 and SHA-512 respectively, computed with dissimilar initial values. SHA-512/224 and SHA-512/256 are likewise truncated versions of SHA-512, but the initial values are generated using the method described in Federal Information Processing Standards (FIPS) PUB 180-4.
SHA-2 was first published past the National Plant of Standards and Technology (NIST) as a U.South. federal standard (FIPS). The SHA-2 family of algorithms are patented in United states of america patent 6829355.[six] The United States has released the patent under a royalty-gratuitous license.[7]
As of 2011, the best public attacks break preimage resistance for 52 out of 64 rounds of SHA-256 or 57 out of lxxx rounds of SHA-512, and collision resistance for 46 out of 64 rounds of SHA-256.[1] [2]
Hash standard [edit]
With the publication of FIPS PUB 180-two, NIST added 3 additional hash functions in the SHA family. The algorithms are collectively known as SHA-2, named after their digest lengths (in $.25): SHA-256, SHA-384, and SHA-512.
The algorithms were commencement published in 2001 in the draft FIPS PUB 180-2, at which time public review and comments were accustomed. In August 2002, FIPS PUB 180-2 became the new Secure Hash Standard, replacing FIPS PUB 180-1, which was released in Apr 1995. The updated standard included the original SHA-i algorithm, with updated technical notation consequent with that describing the inner workings of the SHA-ii family unit.[4]
In Feb 2004, a change notice was published for FIPS PUB 180-2, specifying an boosted variant, SHA-224, defined to match the key length of two-primal Triple DES.[8] In October 2008, the standard was updated in FIPS PUB 180-3, including SHA-224 from the change notice, but otherwise making no fundamental changes to the standard. The main motivation for updating the standard was relocating security information almost the hash algorithms and recommendations for their employ to Special Publications 800-107 and 800-57.[9] [10] [11] Detailed exam data and case bulletin digests were also removed from the standard, and provided as separate documents.[12]
In Jan 2011, NIST published SP800-131A, which specified a move from the then-electric current minimum of 80-bit security (provided by SHA-1) allowable for federal government utilise until the end of 2013, to 112-bit security (provided by SHA-2) being both the minimum requirement (starting in 2014) and the recommended security level (starting from the publication date in 2011).[xiii]
In March 2012, the standard was updated in FIPS PUB 180-4, adding the hash functions SHA-512/224 and SHA-512/256, and describing a method for generating initial values for truncated versions of SHA-512. Additionally, a brake on padding the input information prior to hash calculation was removed, assuasive hash information to be calculated simultaneously with content generation, such as a existent-time video or audio feed. Padding the final data cake must still occur prior to hash output.[14]
In July 2012, NIST revised SP800-57, which provides guidance for cryptographic fundamental direction. The publication disallowed creation of digital signatures with a hash security lower than 112 bits subsequently 2013. The previous revision from 2007 specified the cutoff to exist the finish of 2010.[eleven] In Baronial 2012, NIST revised SP800-107 in the aforementioned manner.[10]
The NIST hash function competition selected a new hash part, SHA-iii, in 2012.[15] The SHA-3 algorithm is not derived from SHA-two.
Applications [edit]
The SHA-2 hash office is implemented in some widely used security applications and protocols, including TLS and SSL, PGP, SSH, S/MIME, and IPsec.
SHA-256 is used for authenticating Debian software packages[16] and in the DKIM message signing standard; SHA-512 is part of a system to cosign archival video from the International Criminal Tribunal of the Rwandan genocide.[17] SHA-256 and SHA-512 are proposed for apply in DNSSEC.[18] Unix and Linux vendors are moving to using 256- and 512-bit SHA-two for secure countersign hashing.[xix]
Several cryptocurrencies, including Bitcoin, use SHA-256 for verifying transactions and calculating proof of work[twenty] or proof of pale.[21] The rise of ASIC SHA-two accelerator chips has led to the use of scrypt-based proof-of-work schemes.
SHA-one and SHA-2 are the Secure Hash Algorithms required by law for use in certain U.S. Government applications, including use inside other cryptographic algorithms and protocols, for the protection of sensitive unclassified information. FIPS PUB 180-1 as well encouraged adoption and utilize of SHA-1 past private and commercial organizations. SHA-1 is existence retired for well-nigh government uses; the U.S. National Institute of Standards and Technology says, "Federal agencies should stop using SHA-one for...applications that require collision resistance as soon equally practical, and must use the SHA-ii family of hash functions for these applications after 2010" (emphasis in original).[22] NIST's directive that U.S. government agencies must finish uses of SHA-1 subsequently 2010[23] was hoped to accelerate migration away from SHA-i.
The SHA-two functions were not quickly adopted initially, despite amend security than SHA-ane. Reasons might include lack of support for SHA-2 on systems running Windows XP SP2 or older[24] and a lack of perceived urgency since SHA-one collisions had not notwithstanding been establish. The Google Chrome team announced a plan to make their web browser gradually stop honoring SHA-1-dependent TLS certificates over a menstruation from tardily 2014 and early 2015.[25] [26] [27] Similarly, Microsoft announced[28] that Internet Explorer and Edge would stop honoring public SHA-1-signed TLS certificates from February 2017. Mozilla disabled SHA-1 in early January 2016, just had to re-enable it temporarily via a Firefox update, after issues with web-based user interfaces of some router models and security appliances.[29]
Cryptanalysis and validation [edit]
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 e'er be done using a brute force search in two 50 evaluations. This is called a preimage attack and may or may non exist applied depending on L and the item computing surroundings. The second criterion, finding two dissimilar messages that produce the same message digest, known as a collision, requires on average only 2 L/two evaluations using a birthday attack.
Some of the applications that use cryptographic hashes, such equally password storage, are merely minimally afflicted by a collision attack. Amalgam a countersign that works for a given account requires a preimage set on, as well as admission to the hash of the original password (typically in the shadow file) which may or may non be piffling. Reversing password encryption (e.g., to obtain a countersign to try confronting a user'southward account elsewhere) is not made possible by the attacks. (However, even a secure password hash cannot foreclose creature-force attacks on weak passwords.)
In the case of certificate signing, an attacker could not simply false a signature from an existing document—the attacker would have to produce a pair of documents, one innocuous and one damaging, and get the individual key holder to sign the innocuous document. There are practical circumstances in which this is possible; until the stop of 2008, it was possible to create forged SSL certificates using an MD5 collision which would be accepted by widely used spider web browsers.[xxx]
Increased interest in cryptographic hash analysis during the SHA-iii competition produced several new attacks on the SHA-two family unit, the best of which are given in the table below. Merely the collision attacks are of practical complexity; none of the attacks extend to the total round hash function.
At FSE 2012, researchers at Sony gave a presentation suggesting pseudo-collision attacks could be extended to 52 rounds on SHA-256 and 57 rounds on SHA-512 by building upon the biclique pseudo-preimage attack.[31]
| Published in | Year | Attack method | Attack | Variant | Rounds | Complexity |
|---|---|---|---|---|---|---|
| New Collision Attacks Against Up To 24-step SHA-two [32] | 2008 | Deterministic | Standoff | SHA-256 | 24/64 | ii28.5 |
| SHA-512 | 24/fourscore | two32.five | ||||
| Preimages for step-reduced SHA-2 [33] | 2009 | Come across-in-the-eye | Preimage | SHA-256 | 42/64 | two251.7 |
| 43/64 | 2254.nine | |||||
| SHA-512 | 42/80 | 2502.three | ||||
| 46/fourscore | 2511.5 | |||||
| Advanced encounter-in-the-eye preimage attacks [34] | 2010 | Run into-in-the-heart | Preimage | SHA-256 | 42/64 | 2248.iv |
| SHA-512 | 42/80 | two494.6 | ||||
| Higher-Society Differential Assault on Reduced SHA-256 [2] | 2011 | Differential | Pseudo-standoff | SHA-256 | 46/64 | 2178 |
| 33/64 | 246 | |||||
| Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family [1] | 2011 | Biclique | Preimage | SHA-256 | 45/64 | 2255.5 |
| SHA-512 | 50/lxxx | 2511.5 | ||||
| Pseudo-preimage | SHA-256 | 52/64 | 2255 | |||
| SHA-512 | 57/80 | 2511 | ||||
| Improving Local Collisions: New Attacks on Reduced SHA-256 [35] | 2013 | Differential | Collision | SHA-256 | 31/64 | 265.5 |
| Pseudo-collision | SHA-256 | 38/64 | 237 | |||
| Branching Heuristics in Differential Standoff Search with Applications to SHA-512 [36] | 2014 | Heuristic differential | Pseudo-collision | SHA-512 | 38/80 | two40.5 |
| Analysis of SHA-512/224 and SHA-512/256 [37] | 2016 | Differential | Collision | SHA-256 | 28/64 | practical |
| SHA-512 | 27/fourscore | practical | ||||
| Pseudo-collision | SHA-512 | 39/lxxx | applied |
Official validation [edit]
Implementations of all FIPS-approved security functions tin can be officially validated through the CMVP program, jointly run by the National Institute of Standards and Engineering science (NIST) and the Communications Security Establishment (CSE). For informal verification, a packet to generate a high number of test vectors is fabricated bachelor for download on the NIST site; the resulting verification, however, does not supercede the formal CMVP validation, which is required past law[ citation needed ] for certain applications.
As of December 2013[update], there are over 1300 validated implementations of SHA-256 and over 900 of SHA-512, with only v of them being capable of handling messages with a length in bits not a multiple of eight while supporting both variants.[38]
Examination vectors [edit]
Hash values of an empty string (i.e., a zero-length input text).
SHA224("") 0x d14a028c2a3a2bc9476102bb288234c415a2b01f828ea62ac5b3e42f SHA256("") 0x e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 SHA384("") 0x 38b060a751ac96384cd9327eb1b1e36a21fdb71114be07434c0cc7bf63f6e1da274edebfe76f65fbd51ad2f14898b95b SHA512("") 0x cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e SHA512/224("") 0x 6ed0dd02806fa89e25de060c19d3ac86cabb87d6a0ddd05c333b84f4 SHA512/256("") 0x c672b8d1ef56ed28ab87c3622c5114069bdd3ad7b8f9737498d0c01ecef0967a
Even a pocket-sized change in the message will (with overwhelming probability) event in a mostly unlike hash, due to the barrage effect. For example, adding a flow to the end of the following sentence changes near one-half (111 out of 224) of the bits in the hash:
SHA224("The quick brown fox jumps over the lazy domestic dog") 0x 730e109bd7a8a32b1cb9d9a09aa2325d2430587ddbc0c38bad911525 SHA224("The quick brown pull a fast one on jumps over the lazy dog.") 0x 619cba8e8e05826e9b8c519c0a5c68f4fb653e8a3d8aa04bb2c8cd4c
Pseudocode [edit]
Pseudocode for the SHA-256 algorithm follows. Annotation the great increase in mixing between bits of the due west[16..63] words compared to SHA-ane.
Note one: All variables are 32 bit unsigned integers and improver is calculated modulo 232 Annotation 2: For each round, in that location is 1 round abiding thousand[i] and one entry in the message schedule array west[i], 0 ≤ i ≤ 63 Note three: The compression function uses viii working variables, a through h Note 4: Big-endian convention is used when expressing the constants in this pseudocode, and when parsing message block data from bytes to words, for example, the kickoff word of the input message "abc" after padding is 0x61626380 Initialize hash values: (outset 32 $.25 of the fractional parts of the square roots of the outset eight primes 2..19): h0 := 0x6a09e667 h1 := 0xbb67ae85 h2 := 0x3c6ef372 h3 := 0xa54ff53a h4 := 0x510e527f h5 := 0x9b05688c h6 := 0x1f83d9ab h7 := 0x5be0cd19 Initialize array of circular constants: (starting time 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311): k[0..63] := 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 Pre-processing (Padding): begin with the original message of length L bits append a unmarried '1' bit append K '0' $.25, where K is the minimum number >= 0 such that (L + 1 + K + 64) is a multiple of 512 append L as a 64-bit large-endian integer, making the total post-candy length a multiple of 512 bits such that the bits in the message are: <original message of length L> 1 <Grand zeros> <L equally 64 scrap integer> , (the number of bits will be a multiple of 512) Procedure the message in successive 512-bit chunks: break message into 512-scrap chunks for each chunk create a 64-entry message schedule array west[0..63] of 32-bit words (The initial values in westward[0..63] don't matter, then many implementations zero them here) copy chunk into starting time xvi words w[0..15] of the bulletin schedule array Extend the first 16 words into the remaining 48 words w[sixteen..63] of the message schedule array: for i from xvi to 63 s0 := (due west[i-15] rightrotate vii) xor (w[i-15] rightrotate 18) xor (w[i-15] rightshift 3) s1 := (westward[i-2] rightrotate 17) xor (w[i-2] rightrotate 19) xor (w[i-2] rightshift 10) w[i] := w[i-16] + s0 + w[i-vii] + s1 Initialize working variables to current hash value: a := h0 b := h1 c := h2 d := h3 e := h4 f := h5 g := h6 h := h7 Compression function main loop: for i from 0 to 63 S1 := (due east rightrotate vi) xor (east rightrotate 11) xor (e rightrotate 25) ch := (east and f) xor ((not e) and g) temp1 := h + S1 + ch + k[i] + w[i] S0 := (a rightrotate 2) xor (a rightrotate 13) xor (a rightrotate 22) maj := (a and b) xor (a and c) xor (b and c) temp2 := S0 + maj h := k g := f f := e eastward := d + temp1 d := c c := b b := a a := temp1 + temp2 Add the compressed chunk to the current hash value: h0 := h0 + a h1 := h1 + b h2 := h2 + c h3 := h3 + d h4 := h4 + e h5 := h5 + f h6 := h6 + g h7 := h7 + h Produce the terminal hash value (large-endian): assimilate := hash := h0 append h1 suspend h2 append h3 append h4 append h5 append h6 append h7
The computation of the ch and maj values can be optimized the same way equally described for SHA-1.
SHA-224 is identical to SHA-256, except that:
- the initial hash values
h0throughh7are different, and - the output is constructed by omitting
h7.
SHA-224 initial hash values (in large endian): (The 2d 32 bits of the partial parts of the square roots of the 9th through 16th primes 23..53) h[0..seven] := 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4
SHA-512 is identical in structure to SHA-256, but:
- the message is broken into 1024-bit chunks,
- the initial hash values and round constants are extended to 64 bits,
- there are fourscore rounds instead of 64,
- the bulletin schedule array w has 80 64-scrap words instead of 64 32-bit words,
- to extend the message schedule array westward, the loop is from 16 to 79 instead of from 16 to 63,
- the round constants are based on the first 80 primes two..409,
- the word size used for calculations is 64 bits long,
- the appended length of the message (earlier pre-processing), in bits, is a 128-bit big-endian integer, and
- the shift and rotate amounts used are different.
SHA-512 initial hash values (in big-endian): h[0..7] := 0x6a09e667f3bcc908, 0xbb67ae8584caa73b, 0x3c6ef372fe94f82b, 0xa54ff53a5f1d36f1, 0x510e527fade682d1, 0x9b05688c2b3e6c1f, 0x1f83d9abfb41bd6b, 0x5be0cd19137e2179 SHA-512 round constants: k[0..79] := 0x428a2f98d728ae22, 0x7137449123ef65cd, 0xb5c0fbcfec4d3b2f, 0xe9b5dba58189dbbc, 0x3956c25bf348b538, 0x59f111f1b605d019, 0x923f82a4af194f9b, 0xab1c5ed5da6d8118, 0xd807aa98a3030242, 0x12835b0145706fbe, 0x243185be4ee4b28c, 0x550c7dc3d5ffb4e2, 0x72be5d74f27b896f, 0x80deb1fe3b1696b1, 0x9bdc06a725c71235, 0xc19bf174cf692694, 0xe49b69c19ef14ad2, 0xefbe4786384f25e3, 0x0fc19dc68b8cd5b5, 0x240ca1cc77ac9c65, 0x2de92c6f592b0275, 0x4a7484aa6ea6e483, 0x5cb0a9dcbd41fbd4, 0x76f988da831153b5, 0x983e5152ee66dfab, 0xa831c66d2db43210, 0xb00327c898fb213f, 0xbf597fc7beef0ee4, 0xc6e00bf33da88fc2, 0xd5a79147930aa725, 0x06ca6351e003826f, 0x142929670a0e6e70, 0x27b70a8546d22ffc, 0x2e1b21385c26c926, 0x4d2c6dfc5ac42aed, 0x53380d139d95b3df, 0x650a73548baf63de, 0x766a0abb3c77b2a8, 0x81c2c92e47edaee6, 0x92722c851482353b, 0xa2bfe8a14cf10364, 0xa81a664bbc423001, 0xc24b8b70d0f89791, 0xc76c51a30654be30, 0xd192e819d6ef5218, 0xd69906245565a910, 0xf40e35855771202a, 0x106aa07032bbd1b8, 0x19a4c116b8d2d0c8, 0x1e376c085141ab53, 0x2748774cdf8eeb99, 0x34b0bcb5e19b48a8, 0x391c0cb3c5c95a63, 0x4ed8aa4ae3418acb, 0x5b9cca4f7763e373, 0x682e6ff3d6b2b8a3, 0x748f82ee5defb2fc, 0x78a5636f43172f60, 0x84c87814a1f0ab72, 0x8cc702081a6439ec, 0x90befffa23631e28, 0xa4506cebde82bde9, 0xbef9a3f7b2c67915, 0xc67178f2e372532b, 0xca273eceea26619c, 0xd186b8c721c0c207, 0xeada7dd6cde0eb1e, 0xf57d4f7fee6ed178, 0x06f067aa72176fba, 0x0a637dc5a2c898a6, 0x113f9804bef90dae, 0x1b710b35131c471b, 0x28db77f523047d84, 0x32caab7b40c72493, 0x3c9ebe0a15c9bebc, 0x431d67c49c100d4c, 0x4cc5d4becb3e42b6, 0x597f299cfc657e2a, 0x5fcb6fab3ad6faec, 0x6c44198c4a475817 SHA-512 Sum & Sigma: S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39) S1 := (east rightrotate xiv) xor (e rightrotate 18) xor (due east rightrotate 41) s0 := (due west[i-15] rightrotate i) xor (w[i-15] rightrotate 8) xor (westward[i-15] rightshift 7) s1 := (west[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-ii] rightshift 6)
SHA-384 is identical to SHA-512, except that:
- the initial hash values
h0throughh7are dissimilar (taken from the 9th through 16th primes), and - the output is constructed by omitting
h6andh7.
SHA-384 initial hash values (in large-endian): h[0..7] := 0xcbbb9d5dc1059ed8, 0x629a292a367cd507, 0x9159015a3070dd17, 0x152fecd8f70e5939, 0x67332667ffc00b31, 0x8eb44a8768581511, 0xdb0c2e0d64f98fa7, 0x47b5481dbefa4fa4 SHA-512/t is identical to SHA-512 except that:
- the initial hash values
h0throughh7are given by the SHA-512/t Iv generation function, - the output is constructed by truncating the concatenation of
h0throughh7at t bits, - t equal to 384 is not allowed, instead SHA-384 should be used as specified, and
- t values 224 and 256 are especially mentioned as approved.
The SHA-512/t Iv generation function evaluates a modified SHA-512 on the ASCII string "SHA-512/t", substituted with the decimal representation of t. The modified SHA-512 is the same as SHA-512 except its initial values h0 through h7 accept each been XORed with the hexadecimal abiding 0xa5a5a5a5a5a5a5a5.
Sample C implementation for SHA-two family of hash functions can be plant in RFC 6234.
Comparison of SHA functions [edit]
In the table below, internal state ways the "internal hash sum" later on each compression of a data block.
| Algorithm and variant | Output size (bits) | Internal country size (bits) | Cake size ($.25) | Rounds | Operations | Security against collision attacks ($.25) | Security confronting length extension attacks (bits) | Operation on Skylake (median cpb)[39] | Offset published | ||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Long letters | 8 bytes | ||||||||||
| MD5 (as reference) | 128 | 128 (4 × 32) | 512 | 64 | And, Xor, Rot, Add (mod 232), Or | ≤ xviii (collisions found)[40] | 0 | 4.99 | 55.00 | 1992 | |
| SHA-0 | 160 | 160 (v × 32) | 512 | 80 | And, Xor, Rot, Add (mod 232), Or | < 34 (collisions constitute) | 0 | ≈ SHA-ane | ≈ SHA-i | 1993 | |
| SHA-1 | < 63 (collisions found)[41] | 3.47 | 52.00 | 1995 | |||||||
| SHA-2 | SHA-224 SHA-256 | 224 256 | 256 (8 × 32) | 512 | 64 | And, Xor, Rot, Add together (mod ii32), Or, Shr | 112 128 | 32 0 | vii.62 7.63 | 84.50 85.25 | 2004 2001 |
| SHA-384 | 384 | 512 (8 × 64) | 1024 | 80 | And, Xor, Rot, Add (mod 264), Or, Shr | 192 | 128 (≤ 384) | 5.12 | 135.75 | 2001 | |
| SHA-512 | 512 | 512 (viii × 64) | 1024 | eighty | And, Xor, Rot, Add (mod 264), Or, Shr | 256 | 0[42] | 5.06 | 135.fifty | 2001 | |
| SHA-512/224 SHA-512/256 | 224 256 | 512 (8 × 64) | 1024 | 80 | And, Xor, Rot, Add (mod ii64), Or, Shr | 112 128 | 288 256 | ≈ SHA-384 | ≈ SHA-384 | 2012 | |
| SHA-3 | SHA3-224 SHA3-256 SHA3-384 SHA3-512 | 224 256 384 512 | 1600 (v × v × 64) | 1152 1088 832 576 | 24 [43] | And, Xor, Rot, Non | 112 128 192 256 | 448 512 768 1024 | 8.12 8.59 11.06 15.88 | 154.25 155.fifty 164.00 164.00 | 2015 |
| SHAKE128 SHAKE256 | d (arbitrary) d (arbitrary) | 1344 1088 | min(d/2, 128) min(d/2, 256) | 256 512 | vii.08 8.59 | 155.25 155.fifty | |||||
In the bitwise operations cavalcade, "Rot" stands for rotate no carry, and "Shr" stands for right logical shift. All of these algorithms utilize modular improver in some fashion except for SHA-iii.
More detailed operation measurements on modern processor architectures are given in the table below.
| CPU architecture | Frequency | Algorithm | Word size (bits) | Cycles/byte x86 | MiB/southward x86 | Cycles/byte x86-64 | MiB/s x86-64 |
|---|---|---|---|---|---|---|---|
| Intel Ivy Bridge | 3.5 GHz | SHA-256 | 32 | xvi.80 | 199 | xiii.05 | 256 |
| SHA-512 | 64 | 43.66 | 76 | 8.48 | 394 | ||
| AMD Piledriver APU | iii.8 GHz | SHA-256 | 32 | 22.87 | 158 | xviii.47 | 196 |
| SHA-512 | 64 | 88.36 | 41 | 12.43 | 292 |
The performance numbers labeled 'x86' were running using 32-scrap lawmaking on 64-bit processors, whereas the 'x86-64' numbers are native 64-bit code. While SHA-256 is designed for 32-bit calculations, it does benefit from code optimized for 64-bit processors on the x86 compages. 32-bit implementations of SHA-512 are significantly slower than their 64-bit counterparts. Variants of both algorithms with unlike output sizes will perform similarly, since the message expansion and compression functions are identical, and just the initial hash values and output sizes are different. The best implementations of MD5 and SHA-1 perform between 4.5 and 6 cycles per byte on modern processors.
Testing was performed past the University of Illinois at Chicago on their hydra8 system running an Intel Xeon E3-1275 V2 at a clock speed of 3.5 GHz, and on their hydra9 system running an AMD A10-5800K APU at a clock speed of 3.8 GHz.[44] The referenced cycles per byte speeds above are the median performance of an algorithm digesting a iv,096 byte message using the SUPERCOP cryptographic benchmarking software.[45] The MiB/s performance is extrapolated from the CPU clockspeed on a unmarried core; real-world performance will vary due to a diversity of factors.
Implementations [edit]
Below is a list of cryptography libraries that support SHA-2:
- Botan
- Bouncy Castle
- Cryptlib
- Crypto++
- Libgcrypt
- Mbed TLS[46] [47]
- libsodium
- Nettle
- LibreSSL
- OpenSSL
- GnuTLS
- wolfSSL
Hardware acceleration is provided by the following processor extensions:
- Intel SHA extensions: Bachelor on some Intel and AMD x86 processors.
- VIA PadLock
- ARMv8 Cryptography Extensions [48]
Encounter too [edit]
- Comparison of cryptographic hash functions
- Comparison of cryptography libraries
- Hash role security summary
- Hashcash
- HMAC
- International Association for Cryptologic Research (IACR)
-
sha1sum(sha224sum,sha256sum,sha384sumandsha512sum) commands - Trusted timestamping
References [edit]
- ^ a b c Dmitry Khovratovich, Christian Rechberger & Alexandra Savelieva (2011). "Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family unit" (PDF). IACR Cryptology ePrint Archive. 2011:286.
- ^ a b c Mario Lamberger & Florian Mendel (2011). "Higher-Order Differential Assault on Reduced SHA-256" (PDF). IACR Cryptology ePrint Annal. 2011:37.
- ^ "On the Secure Hash Algorithm family" (PDF). Archived from the original (PDF) on 2016-03-30.
- ^ a b Federal Register Notice 02-21599, Announcing Approving of FIPS Publication 180-ii
- ^ "IPR Details: The The states of America equally represented by the National Security Bureau's full general license argument". IETF Datatracker. 858. Retrieved 2008-02-17 .
- ^ US 6829355
- ^ "IPR Details: The United states of America as represented past the National Security Agency's general license statement". IETF Datatracker. 858. Retrieved 2008-02-17 .
- ^ "FIPS 180-two with Alter Notice ane" (PDF). csrc.nist.gov.
- ^ Federal Annals Discover E8-24743, Announcing Approving of FIPS Publication 180-3
- ^ a b FIPS SP 800-107 Recommendation for Applications Using Canonical Hash Algorithms
- ^ a b FIPS SP 800-57 Recommendation for Key Management: Function one: General
- ^ "NIST.gov – Computer Security Division – Computer Security Resources Center". 29 December 2016.
- ^ FIPS SP 800-131A Recommendation for Transitioning the Employ of Cryptographic Algorithms and Key Lengths
- ^ Federal Register Find 2012-5400, Announcing Approval of FIPS Publication 180-four
- ^ "NIST Selects Winner of Secure Hash Algorithm (SHA-3) Competition". 2 October 2012. Retrieved 24 Feb 2015.
- ^ "Debian codebase in Google Code". Archived from the original on November 7, 2011. Retrieved 2011-11-08 .
- ^ John Markoff, A Tool to Verify Digital Records, Even equally Technology Shifts, New York Times, January 26, 2009
- ^ RFC 5702,RFC-Editor.org
- ^ Ulrich Drepper, Unix crypt with SHA-256/512
- ^ Bitcoin, Surplus. "Bitcoin Does Not Waste Energy". Surplus Bitcoin . Retrieved 2020-04-20 .
- ^ "What Is SHA-256 And How Is Information technology Related to Bitcoin? - Mycryptopedia". Mycryptopedia. 2017-09-21. Retrieved 2018-09-17 .
- ^ National Institute on Standards and Technology Figurer Security Resource Heart, NIST's Policy on Hash Functions Archived 2011-06-09 at the Wayback Motorcar, accessed March 29, 2009.
- ^ "Secure Hashing". NIST. Archived from the original on 2011-06-25. Retrieved 2010-11-25 .
- ^ "Overview of Windows XP Service Pack three" (PDF). Microsoft Corporation. Archived from the original (PDF) on May 30, 2008.
- ^ Chromium Blog, September 5, 2014, Gradually sunsetting SHA-i
- ^ Eric Manufactory. "SHAAAAAAAAAAAAA". SHAAAAAAAAAAAAA.com.
- ^ Filippo Valsorda, The Unofficial Chrome SHA1 Deprecation FAQ
- ^ "An update to our SHA-ane deprecation roadmap – Microsoft Edge Dev BlogMicrosoft Edge Dev Blog". blogs.windows.com. 29 Apr 2016. Retrieved 2016-xi-28 .
- ^ Fabian A. Scherschel, HeiseSecurity: Firefox: Mozilla schaltet SHA-1 ab ... und direkt wieder an (German)
- ^ Alexander Sotirov, Marc Stevens, Jacob Appelbaum, Arjen Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger, MD5 considered harmful today: Creating a rogue CA certificate, accessed March 29, 2009.
- ^ Ji Li, Takanori Isobe and Kyoji Shibutani, Sony China Inquiry Laboratory and Sony Corporation, Converting Run across-in-the-Middle Preimage Assault into Pseudo Collision Assault: Awarding to SHA-two
- ^ Somitra Kumar Sanadhya & Palash Sarkar (2008). "New Collision Attacks Against Up To 24-stride SHA-2" (PDF). IACR Cryptology ePrint Archive. 2008:270.
- ^ Kazumaro Aoki; Jian Guo; Krystian Matusiewicz; Yu Sasaki & Lei Wang (2009). Preimages for step-reduced SHA-2. Advances in Cryptology – ASIACRYPT 2009. Lecture Notes in Reckoner Science. Vol. 5912. Springer Berlin Heidelberg. pp. 578–597. doi:10.1007/978-iii-642-10366-7_34. ISBN978-3-642-10366-7. ISSN 0302-9743.
- ^ Jian Guo; San Ling; Christian Rechberger & Huaxiong Wang (2010). Advanced meet-in-the-middle preimage attacks: First results on full Tiger, and improved results on MD4 and SHA-2 (PDF). Advances in Cryptology – ASIACRYPT 2010. Lecture Notes in Informatics. Vol. 6477. Springer Berlin Heidelberg. pp. 56–75. doi:10.1007/978-3-642-17373-8_4. ISBN978-three-642-17373-eight. ISSN 0302-9743.
- ^ Florian Mendel; Tomislav Nad; Martin Schläffer (2013). Improving Local Collisions: New Attacks on Reduced SHA-256. Advances in Cryptology – EUROCRYPT 2013. Lecture Notes in Computer science. Vol. 7881. Springer Berlin Heidelberg. pp. 262–278. doi:10.1007/978-3-642-38348-9_16. ISBN978-3-642-38348-nine. ISSN 0302-9743.
- ^ Maria Eichlseder and Florian Mendel and Martin Schläffer (2014). "Branching Heuristics in Differential Standoff Search with Applications to SHA-512" (PDF). IACR Cryptology ePrint Annal. 2014:302.
- ^ Christoph Dobraunig; Maria Eichlseder & Florian Mendel (2016). "Analysis of SHA-512/224 and SHA-512/256" (PDF). International Association for Cryptologic Enquiry.
- ^ "SHS Validation List". NIST. 2017-06-xvi. Archived from the original on 2017-06-17.
- ^ "Measurements tabular array". bench.cr.yp.to.
- ^ Tao, Xie; Liu, Fanbao; Feng, Dengguo (2013). Fast Collision Assault on MD5 (PDF). Cryptology ePrint Archive (Technical report). IACR.
- ^ Stevens, Marc; Bursztein, Elie; Karpman, Pierre; Albertini, Ange; Markov, Yarik. The commencement collision for full SHA-1 (PDF) (Technical written report). Google Inquiry. Lay summary – Google Security Blog (Feb 23, 2017).
- ^ Without truncation, the total internal state of the hash function is known, regardless of standoff resistance. If the output is truncated, the removed office of the state must be searched for and plant before the hash office can exist resumed, allowing the set on to keep.
- ^ "The Keccak sponge function family unit". Retrieved 2016-01-27 .
- ^ SUPERCOP Benchmarks Measurements of hash functions, indexed by machine
- ^ "SUPERCOP". Retrieved 24 February 2015.
- ^ Supported SSL / TLS ciphersuites
- ^ Mbed TLS Changelog, 7 July 2007
- ^ "ARM Cortex-A53 MPCore Processor Technical Reference Manual Cryptography Extension".
Farther reading [edit]
- Henri Gilbert, Helena Handschuh: Security Analysis of SHA-256 and Sisters. Selected Areas in Cryptography 2003: pp175–193
- "Proposed Revision of Federal Information Processing Standard (FIPS) 180, Secure Hash Standard". Federal Annals. 59 (131): 35317–35318. 1994-07-xi. Retrieved 2007-04-26 . [ permanent dead link ]
External links [edit]
- Descriptions of SHA-256, SHA-384, and SHA-512 from NIST
- SHA-2 Checker – SHAChecker to cheque one's SSL compatibility for SHA-2
- Specifications for a Secure Hash Standard (SHS) – Draft for proposed SHS (SHA-0)
- Secure Hash Standard (SHS) – Proposed SHS (SHA-0)
- CSRC Cryptographic Toolkit – Official NIST site for the Secure Hash Standard
- FIPS PUB 180-iv: Secure Hash Standard (SHS) (PDF, 834 KB) – Current version of the Secure Hash Standard (SHA-one, SHA-224, SHA-256, SHA-384, and SHA-512), Baronial 2015
- Exam vectors for SHA-256/384/512 from the NESSIE project
- Test vectors for SHA-1, SHA-2 from NIST site
- NIST Cryptographic Hash Projection – SHA-three competition
- RFC 3874: "A 224-chip One-way Hash Role: SHA-224"
- RFC 6234: "Us Secure Hash Algorithms (SHA and SHA-based HMAC and HKDF)"; contains sample C implementation
- SHA-256 algorithm demonstration
Example of a Sha 256 Software Free Download
DOWNLOAD HERE
Source: https://en.wikipedia.org/wiki/SHA-2
Posted by: aaknewstoday211.blogspot.com
comment 0 komentar
more_vert