projects / BK-2020-09.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
chore(en:Kyoto_Animation_arson_attack):Update reflist
[BK-2020-09.git] / en.wikipedia.org / BLAKE_(hash_function) / article.txt
CommitLineData
317d5614
SBS		 1{{short description|Cryptographic hash function}}
2{{Infobox cryptographic hash function
3| name = BLAKE
4| image =
5| caption =
6<!-- General -->
7| designers = Jean-Philippe Aumasson, Luca Henzen, Willi Meier, Raphael C.-W. Phan
8| publish date =
9| series =
10| derived from =
11| derived to = [[BLAKE2]]
12| related to =
13| certification = [[NIST hash function competition|SHA-3 finalist]]
14<!-- Detail -->
15| digest size = 224, 256, 384 or 512 bits
16| structure = [[HAIFA construction]]
17| rounds = 14 or 16
18| speed = 8.4 [[cycles per byte|cpb]] on [[Core 2]] for BLAKE-256; 7.8 cpb for BLAKE-512
19| cryptanalysis =
20}}
21
22'''BLAKE''' is a [[cryptographic hash function]] based on [[Dan Bernstein]]'s [[ChaCha (cipher)|ChaCha]] [[stream cipher]], but a permuted copy of the input block, [[XOR]]ed with round constants, is added before each ChaCha round. Like [[SHA-2]], there are two variants differing in the [[Word (computer architecture)|word]] size. ChaCha operates on a 4×4 array of words. BLAKE repeatedly combines an 8-word hash value with 16 message words, truncating the ChaCha result to obtain the next hash value. '''BLAKE-256''' and '''BLAKE-224''' use 32-bit words and produce digest sizes of 256 bits and 224 bits, respectively, while '''BLAKE-512''' and '''BLAKE-384''' use 64-bit words and produce digest sizes of 512 bits and 384 bits, respectively.
23
24The [[BLAKE_(hash_function)#BLAKE2|BLAKE2]] hash function, based on BLAKE, was announced in 2012. The [[BLAKE_(hash_function)#BLAKE3|BLAKE3]] hash function, based on BLAKE2, was announced in 2020.
25
26==History==
27BLAKE was submitted to the [[NIST hash function competition]] by Jean-Philippe Aumasson, Luca Henzen, Willi Meier, and Raphael C.-W. Phan. In 2008, there were 51 entries. BLAKE made it to the final round consisting of five candidates but lost to ''Keccak'' in 2012, which was selected for the [[SHA-3]] algorithm.
28
29==Algorithm==
30Like [[SHA-2]], BLAKE comes in two variants: one that uses 32-bit words, used for computing hashes up to 256 bits long, and one that uses 64-bit words, used for computing hashes up to 512 bits long. The core block transformation combines 16 words of input with 16 working variables, but only 8 words (256 or 512 bits) are preserved between blocks.
31
32It uses a table of 16 constant words (the leading 512 or 1024 bits of the fractional part of [[Pi|π]]), and a table of 10 16-element permutations:
33 σ[0] = 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
34 σ[1] = 14 10 4 8 9 15 13 6 1 12 0 2 11 7 5 3
35 σ[2] = 11 8 12 0 5 2 15 13 10 14 3 6 7 1 9 4
36 σ[3] = 7 9 3 1 13 12 11 14 2 6 5 10 4 0 15 8
37 σ[4] = 9 0 5 7 2 4 10 15 14 1 11 12 6 8 3 13
38 σ[5] = 2 12 6 10 0 11 8 3 4 13 7 5 15 14 1 9
39 σ[6] = 12 5 1 15 14 13 4 10 0 7 6 3 9 2 8 11
40 σ[7] = 13 11 7 14 12 1 3 9 5 0 15 4 8 6 2 10
41 σ[8] = 6 15 14 9 11 3 0 8 12 2 13 7 1 4 10 5
42 σ[9] = 10 2 8 4 7 6 1 5 15 11 9 14 3 12 13 0
43
44The core operation, equivalent to ChaCha's quarter round, operates on a 4-word column or diagonal <code>a b c d</code>, which is combined with 2 words of message <code>m[]</code> and two constant words <code>n[]</code>. It is performed 8 times per full round:
45 j ← σ[r%10][2×i] <span style="color:green">// Index computations</span>
46 k ← σ[r%10][2×i+1]
47 a ← a + b + (m[j] ⊕ n[k]) <span style="color:green">// Step 1 (with input)</span>
48 d ← (d ⊕ a) >>> 16
49 c ← c + d <span style="color:green">// Step 2 (no input)</span>
50 b ← (b ⊕ c) >>> 12
51 a ← a + b + (m[k] ⊕ n[j]) <span style="color:green">// Step 3 (with input)</span>
52 d ← (d ⊕ a) >>> 8
53 c ← c + d <span style="color:green">// Step 4 (no input)</span>
54 b ← (b ⊕ c) >>> 7
55In the above, <code>r</code> is the round number (0–13), and <code>i</code> varies from 0 to 7.
56
57The differences from the ChaCha quarter-round function are:
58* The addition of the message words has been added.
59* The rotation directions have been reversed.
60
61The 64-bit version (which does not exist in ChaCha) is identical, but the rotation amounts are 32, 25, 16 and 11, respectively, and the number of rounds is increased to 16.
62
63==Tweaks==
64Throughout the NIST hash function competition, entrants are permitted to "tweak" their algorithms to address issues that are discovered. Changes that have been made to BLAKE are: the number of rounds was increased from 10/14 to 14/16. This is to be more conservative about security while still being fast.
65
66==Example digests==
67Hash values of an empty string:
68
69 {{color|green|BLAKE-224("")}} =
70 7dc5313b1c04512a174bd6503b89607aecbee0903d40a8a569c94eed
71 {{color|green|BLAKE-256("")}} =
72 716f6e863f744b9ac22c97ec7b76ea5f5908bc5b2f67c61510bfc4751384ea7a
73 {{color|green|BLAKE-384("")}} =
74 c6cbd89c926ab525c242e6621f2f5fa73aa4afe3d9e24aed727faaadd6af38b620bdb623dd2b4788b1c8086984af8706
75 {{color|green|BLAKE-512("")}} =
76 a8cfbbd73726062df0c6864dda65defe58ef0cc52a5625090fa17601e1eecd1b628e94f396ae402a00acc9eab77b4d4c2e852aaaa25a636d80af3fc7913ef5b8
77
78Changing a single bit causes each bit in the output to change with 50% probability, demonstrating an [[avalanche effect]]:
79
80 {{color|green|BLAKE-512("The quick brown fox jumps over the lazy dog")}} =
81 1f7e26f63b6ad25a0896fd978fd050a1766391d2fd0471a77afb975e5034b7ad2d9ccf8dfb47abbbe656e1b82fbc634ba42ce186e8dc5e1ce09a885d41f43451
82 {{color|green|BLAKE-512("The quick brown fox jumps over the lazy do{{color|red|f}}")}} =
83 a701c2a1f9baabd8b1db6b75aee096900276f0b86dc15d247ecc03937b370324a16a4ffc0c3a85cd63229cfa15c15f4ba6d46ae2e849ed6335e9ff43b764198a
84
85==BLAKE2==
86{{Infobox encryption method
87| name = BLAKE2
88| image =
89| caption =
90<!-- General -->
91| designers = Jean-Philippe Aumasson, Samuel Neves, [[Zooko Wilcox-O'Hearn]], Christian Winnerlein
92| publish date =
93| series =
94| derived from = BLAKE
95| derived to =
96| related to =
97| certification =
98<!-- Detail -->
99| digest size = up to 64 bytes (BLAKE2b); up to 32 bytes (BLAKE2s); arbitrary (BLAKE2X)
100| structure =
101| rounds = 10 or 12
102| speed = 3.5 [[cycles per byte|cpb]] on [[Core i5]] (Ivy Bridge) for BLAKE2b<ref>{{cite web|url=https://blake2.net/acns/slides.html|title=BLAKE2 – an alternative to MD5/SHA-1}}</ref>
103| cryptanalysis =
104}}
105
106'''BLAKE2''' is a cryptographic hash function based on BLAKE, created by Jean-Philippe Aumasson, Samuel Neves, [[Zooko Wilcox-O'Hearn]], and Christian Winnerlein. The design goal was to replace the widely used, but broken, [[MD5]] and [[SHA-1]] algorithms in applications requiring high performance in software. BLAKE2 was announced on December 21, 2012.<ref>{{cite web|url=http://lists.randombit.net/pipermail/cryptography/2012-December/003562.html|title=introducing BLAKE2 – an alternative to SHA-3, SHA-2 and MD5|first=Zooko|last=O'Whielacronx|date=21 December 2012}}</ref> A [[reference implementation]] is available under [[CC0]], the [[OpenSSL license#License incompatibilities|OpenSSL License]], and the [[Apache_License#Version_2.0|Apache Public License 2.0]].<ref name="blake2.net" /><ref name="reference-implementation-repo">{{cite web|url=https://github.com/BLAKE2/BLAKE2|title=BLAKE2 official implementations|accessdate=7 July 2019}}</ref>
107
5221bb2c 108BLAKE2b is faster than MD5, SHA-1, SHA-2, and SHA-3, on 64-bit x86-64 and ARM architectures.<ref name="blake2.net">{{cite web|url=https://blake2.net/|title=BLAKE2|website=blake2.net}}</ref> BLAKE2 provides better security than SHA-2 and similar to that of SHA-3: immunity to [[Length extension attack|length extension]], indifferentiability from a random oracle, etc.<ref>{{cite journal |last1=Aumasson |first=Jean-Philippe |last2=Neves |first2=Samuel |last3=Wilcox-O’Hearn |first3=Zooko |last4=Winnerlein |first4=Christian |title=BLAKE2: simpler, smaller, fast as MD5 |url=https://eprint.iacr.org/2013/322.pdf |website=Cryptology ePrint Archive |publisher=IACR|year=2013 }}</ref>
317d5614
SBS		 109
110BLAKE2 removes addition of constants to message words from BLAKE round function, changes two rotation constants, simplifies padding, adds parameter block that is XOR'ed with initialization vectors, and reduces the number of rounds from 16 to 12 for '''BLAKE2b''' (successor of BLAKE-512), and from 14 to 10 for '''BLAKE2s''' (successor of BLAKE-256).
111
112BLAKE2 supports keying, salting, personalization, and hash tree modes, and can output digests from 1 up to 64 bytes for BLAKE2b, or up to 32 bytes for BLAKE2s. There are also parallel versions designed for increased performance on [[multi-core processor]]s; '''BLAKE2bp''' (4-way parallel) and '''BLAKE2sp''' (8-way parallel).
113
114'''BLAKE2X''' is a family of extensible-output functions (XOFs). Whereas BLAKE2 is limited to 64-byte digests, BLAKE2X allows for digests of up to 256 GiB. BLAKE2X is itself not an instance of a hash function, and must be based on an actual BLAKE2 instance. An example of a BLAKE2X instance could be '''BLAKE2Xb16MiB''', which would be a BLAKE2X version based on BLAKE2b producing 16,777,216-byte digests (or exactly 16 [[Mebibyte|MiB]], hence the name of such an instance).<ref>{{cite web|url=https://blake2.net/blake2x.pdf|title=BLAKE2X}}</ref>
115
116BLAKE2b and BLAKE2s are specified in RFC 7693. Optional features using the parameter block (salting, personalized hashes, tree hashing, et cetera), are not specified, and thus neither is support for BLAKE2bp, BLAKE2sp, or BLAKE2X.<ref>{{cite IETF |title=The BLAKE2 Cryptographic Hash and Message Authentication Code (MAC) |rfc=7693 |sectionname= |section= |page= |last=Saarinen |first=M-J |last2=Aumasson|first2=J-P |date=November 2015 |publisher=[[Internet Engineering Task Force|IETF]] |accessdate=4 December 2015 }}</ref>
117
118===Initialization vector===
119BLAKE2b uses an initialization vector that is the same as the [https://tools.ietf.org/html/rfc6234#section-6.3 IV used by SHA-512.] These values are [[Nothing-up-my-sleeve number|transparently obtained]] by taking the first 64 bits of the fractional parts of the positive square roots of the first eight prime numbers.
120
121 IV<sub>0</sub> = 0x6a09e667f3bcc908 <span style="color: green">// Frac(sqrt(2))</span>
122 IV<sub>1</sub> = 0xbb67ae8584caa73b <span style="color: green">// Frac(sqrt(3))</span>
123 IV<sub>2</sub> = 0x3c6ef372fe94f82b <span style="color: green">// Frac(sqrt(5))</span>
124 IV<sub>3</sub> = 0xa54ff53a5f1d36f1 <span style="color: green">// Frac(sqrt(7))</span>
125 IV<sub>4</sub> = 0x510e527fade682d1 <span style="color: green">// Frac(sqrt(11))</span>
126 IV<sub>5</sub> = 0x9b05688c2b3e6c1f <span style="color: green">// Frac(sqrt(13))</span>
127 IV<sub>6</sub> = 0x1f83d9abfb41bd6b <span style="color: green">// Frac(sqrt(17))</span>
128 IV<sub>7</sub> = 0x5be0cd19137e2179 <span style="color: green">// Frac(sqrt(19))</span>
129
130===BLAKE2b algorithm===
131[[Pseudocode]] for the BLAKE2b algorithm. The BLAKE2b algorithm uses 8-byte (UInt64) words, and 128-byte chunks.
132 <span style="color: #004DBB;">'''Algorithm'''</span> BLAKE2b
133 <span style="color: #004DBB;">'''Input:'''</span>
134 M <span style="color: green;">''Message to be hashed''</span>
135 cbMessageLen: Number, (0..2<sup>128</sup>) <span style="color: green;">''Length of the message in bytes''</span>
136 Key <span style="color: green;">''Optional 0..64 byte key''</span>
137 cbKeyLen: Number, (0..64) <span style="color: green;">''Length of optional key in bytes''</span>
138 cbHashLen: Number, (1..64) <span style="color: green;">''Desired hash length in bytes''</span>
139 <span style="color: #004DBB;">'''Output:'''</span>
140 Hash <span style="color: green;">''Hash of cbHashLen bytes''</span>
141
142 <span style="color: green;">''Initialize State vector '''h''' with '''IV'''''</span>
143 h<sub>0..7</sub> ← IV<sub>0..7</sub>
144
145 <span style="color: green;">''Mix key size (cbKeyLen) and desired hash length (cbHashLen) into h<sub>0</sub>''</span>
146 h<sub>0</sub> ← h<sub>0</sub> xor 0x0101kknn
147 <span style="color: green;">''where '''kk''' is Key Length (in bytes)''</span>
148 <span style="color: green;">'''nn''' ''is Desired Hash Length (in bytes)''</span>
149
150 <span style="color: green;">''Each time we Compress we record how many bytes have been compressed''</span>
151 cBytesCompressed ← 0
152 cBytesRemaining ← cbMessageLen
153
154 <span style="color: green;">''If there was a key supplied (i.e. cbKeyLen > 0)''
155 ''then pad with trailing zeros to make it 128-bytes (i.e. 16 words) ''
156 ''and prepend it to the message '''M'''''</span>
157 <span style="color: #004DBB;">'''if'''</span> (cbKeyLen > 0) <span style="color: #004DBB;">'''then'''</span>
158 M ← Pad(Key, 128) || M
159 cBytesRemaining ← cBytesRemaining + 128
160 <span style="color: #004DBB;">'''end if'''</span>
161
162 <span style="color: green;">''Compress whole 128-byte chunks of the message, except the last chunk''</span>
163 <span style="color: #004DBB;">'''while'''</span> (cBytesRemaining > 128) <span style="color: #004DBB;">'''do'''</span>
164 chunk ← get next 128 bytes of message '''M'''
165 cBytesCompressed ← cBytesCompressed + 128 <span style="color: green;">''increase count of bytes that have been compressed''</span>
166 cBytesRemaining ← cBytesRemaining - 128 <span style="color: green;">''decrease count of bytes in '''M''' remaining to be processed''</span>
167
168 h ← Compress(h, chunk, cBytesCompressed, false) <span style="color: green;">''false ⇒ this is not the last chunk''</span>
169 <span style="color: #004DBB;">'''end while'''</span>
170
171 <span style="color: green;">''Compress the final bytes from '''M'''''</span>
172 chunk ← get next 128 bytes of message '''M''' <span style="color: green;">''We will get cBytesRemaining bytes (i.e. 0..128 bytes)''</span>
173 cBytesCompressed ← cBytesCompressed+cBytesRemaining <span style="color: green;">''The actual number of bytes leftover in '''M'''''</span>
174 chunk ← Pad(chunk, 128) <span style="color: green;">''If '''M''' was empty, then we will still compress a final chunk of zeros''</span>
175
176 h ← Compress(h, chunk, cBytesCompressed, true) <span style="color: green;">''true ⇒ this is the last chunk''</span>
177
178 <span style="color: #004DBB;">'''Result'''</span> ← first cbHashLen bytes of little endian state vector h
179 <span style="color: #004DBB;">'''End Algorithm'''</span> BLAKE2b
180
181====Compress====
182The '''Compress''' function takes a full 128-byte chunk of the input message and mixes it into the ongoing state array:
183
184 <span style="color: #004DBB;">'''Function'''</span> Compress
185 <span style="color: #004DBB;">'''Input:'''</span>
186 h <span style="color: green;">''Persistent state vector''</span>
187 chunk <span style="color: green;">''128-byte (16 double word) chunk of message to compress''</span>
188 t: Number, 0..2<sup>128</sup> <span style="color: green;">''Count of bytes that have been fed into the Compression''</span>
189 IsLastBlock: Boolean <span style="color: green;">''Indicates if this is the final round of compression''</span>
190 <span style="color: #004DBB;">'''Output:'''</span>
191 h <span style="color: green;">''Updated persistent state vector''</span>
192
193 <span style="color: green;">''Setup local work vector V''</span>
194 V<sub>0..7</sub> ← h<sub>0..7</sub> <span style="color: green;">''First eight items are copied from persistent state vector '''h'''''</span>
195 V<sub>8..15</sub> ← IV<sub>0..7</sub> <span style="color: green;">''Remaining eight items are initialized from the '''IV'''''</span>
196
197 <span style="color: green;">''Mix the 128-bit counter '''t''' into V''<sub>12</sub>:V<sub>13</sub></span>
198 V<sub>12</sub> ← V<sub>12</sub> <span style="color: #004DBB;">'''xor'''</span> Lo(t) <span style="color: green;">''Lo 64-bits of UInt128 '''t'''''</span>
199 V<sub>13</sub> ← V<sub>13</sub> <span style="color: #004DBB;">'''xor'''</span> Hi(t) <span style="color: green;">''Hi 64-bits of UInt128 '''t'''''</span>
200
201 <span style="color: green;">''If this is the last block then invert all the bits in V<sub>14</sub>''</span>
202 <span style="color: #004DBB;">'''if'''</span> IsLastBlock <span style="color: #004DBB;">'''then'''</span>
203 V<sub>14</sub> ← V<sub>14</sub> <span style="color: #004DBB;">'''xor'''</span> 0xFFFFFFFFFFFFFFFF
204
205 <span style="color: green;">''Treat each 128-byte message '''chunk''' as sixteen 8-byte (64-bit) words '''m'''''</span>
206 m<sub>0..15</sub> ← chunk
207
208 <span style="color: green;">''Twelve rounds of cryptographic message mixing''</span>
209 <span style="color: #004DBB;">'''for'''</span> i <span style="color: #004DBB;">'''from'''</span> 0 <span style="color: #004DBB;">'''to'''</span> 11 <span style="color: #004DBB;">'''do'''</span>
210 <span style="color: green;">''Select message mixing schedule for this round.''
211 ''BLAKE2b uses 12 rounds, while SIGMA has only 10 entries.''</span>
212 S<sub>0..15</sub> ← SIGMA[i <span style="color: #004DBB;">'''mod'''</span> 10] <span style="color: green;">''Rounds 10 and 11 use SIGMA[0] and SIGMA[1] respectively''</span>
213
214 Mix(V<sub>0</sub>, V<sub>4</sub>, V<sub>8</sub>, V<sub>12</sub>, m[S<sub>0</sub>], m[S<sub>1</sub>])
215 Mix(V<sub>1</sub>, V<sub>5</sub>, V<sub>9</sub>, V<sub>13</sub>, m[S<sub>2</sub>], m[S<sub>3</sub>])
216 Mix(V<sub>2</sub>, V<sub>6</sub>, V<sub>10</sub>, V<sub>14</sub>, m[S<sub>4</sub>], m[S<sub>5</sub>])
217 Mix(V<sub>3</sub>, V<sub>7</sub>, V<sub>11</sub>, V<sub>15</sub>, m[S<sub>6</sub>], m[S<sub>7</sub>])
218
219 Mix(V<sub>0</sub>, V<sub>5</sub>, V<sub>10</sub>, V<sub>15</sub>, m[S<sub>8</sub>], m[S<sub>9</sub>])
220 Mix(V<sub>1</sub>, V<sub>6</sub>, V<sub>11</sub>, V<sub>12</sub>, m[S<sub>10</sub>], m[S<sub>11</sub>])
221 Mix(V<sub>2</sub>, V<sub>7</sub>, V<sub>8</sub>, V<sub>13</sub>, m[S<sub>12</sub>], m[S<sub>13</sub>])
222 Mix(V<sub>3</sub>, V<sub>4</sub>, V<sub>9</sub>, V<sub>14</sub>, m[S<sub>14</sub>], m[S<sub>15</sub>])
223 <span style="color: #004DBB;">'''end for'''</span>
224
225 <span style="color: green;">''Mix the upper and lower halves of V into ongoing state vector h''</span>
226 h<sub>0..7</sub> ← h<sub>0..7</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>0..7</sub>
227 h<sub>0..7</sub> ← h<sub>0..7</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>8..15</sub>
228
229 '''Result''' ← h
230 <span style="color: #004DBB;">'''End Function'''</span> Compress
231
232====Mix====
233The '''Mix''' function is called by the '''Compress''' function, and mixes two 8-byte words from the message into the hash state. In most implementations this function would be written inline, or as an inlined function.
234
235 <span style="color: #004DBB;">'''Function'''</span> Mix
236 <span style="color: #004DBB;">'''Inputs:'''</span>
237 V<sub>a</sub>, V<sub>b</sub>, V<sub>c</sub>, V<sub>d</sub> <span style="color: green;">''four 8-byte word entries from the work vector V''</span>
238 x, y <span style="color: green;">''two 8-byte word entries from padded message m''</span>
239 <span style="color: #004DBB;">'''Output:'''</span>
240 V<sub>a</sub>, V<sub>b</sub>, V<sub>c</sub>, V<sub>d</sub> <span style="color: green;">''the modified versions of V<sub>a</sub>, V<sub>b</sub>, V<sub>c</sub>, V<sub>d</sub>''</span>
241
242 V<sub>a</sub> ← V<sub>a</sub> + V<sub>b</sub> + x <span style="color: green;">''with input''</span>
243 V<sub>d</sub> ← (V<sub>d</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>a</sub>) <span style="color: #004DBB;">'''rotateright'''</span> 32
244
245 V<sub>c</sub> ← V<sub>c</sub> + V<sub>d</sub> <span style="color: green;">''no input''</span>
246 V<sub>b</sub> ← (V<sub>b</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>c</sub>) <span style="color: #004DBB;">'''rotateright'''</span> 24
247
248 V<sub>a</sub> ← V<sub>a</sub> + V<sub>b</sub> + y <span style="color: green;">''with input''</span>
249 V<sub>d</sub> ← (V<sub>d</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>a</sub>) <span style="color: #004DBB;">'''rotateright'''</span> 16
250
251 V<sub>c</sub> ← V<sub>c</sub> + V<sub>d</sub> <span style="color: green;">''no input''</span>
252 V<sub>b</sub> ← (V<sub>b</sub> <span style="color: #004DBB;">'''xor'''</span> V<sub>c</sub>) <span style="color: #004DBB;">'''rotateright'''</span> 63
253
254 '''Result''' ← V<sub>a</sub>, V<sub>b</sub>, V<sub>c</sub>, V<sub>d</sub>
255 <span style="color: #004DBB;">'''End Function'''</span> Mix
256
257===Example digests===
258Hash values of an empty string:
259
260 {{color|green|BLAKE2s-224("")}} =
261 1fa1291e65248b37b3433475b2a0dd63d54a11ecc4e3e034e7bc1ef4
262 {{color|green|BLAKE2s-256("")}} =
263 69217a3079908094e11121d042354a7c1f55b6482ca1a51e1b250dfd1ed0eef9
264 {{color|green|BLAKE2b-384("")}} =
265 b32811423377f52d7862286ee1a72ee540524380fda1724a6f25d7978c6fd3244a6caf0498812673c5e05ef583825100
266 {{color|green|BLAKE2b-512("")}} =
267 786a02f742015903c6c6fd852552d272912f4740e15847618a86e217f71f5419d25e1031afee585313896444934eb04b903a685b1448b755d56f701afe9be2ce
268
269Changing a single bit causes each bit in the output to change with 50% probability, demonstrating an [[avalanche effect]]:
270
271 {{color|green|BLAKE2b-512("The quick brown fox jumps over the lazy dog")}} =
272 a8add4bdddfd93e4877d2746e62817b116364a1fa7bc148d95090bc7333b3673f82401cf7aa2e4cb1ecd90296e3f14cb5413f8ed77be73045b13914cdcd6a918
273 {{color|green|BLAKE2b-512("The quick brown fox jumps over the lazy do{{color|red|f}}")}} =
274 ab6b007747d8068c02e25a6008db8a77c218d94f3b40d2291a7dc8a62090a744c082ea27af01521a102e42f480a31e9844053f456b4b41e8aa78bbe5c12957bb
275
276===Users of BLAKE2===
277* [[Argon2]], the winner of the [[Password Hashing Competition]] uses BLAKE2b
278* [[Chef (company)|Chef]]'s Habitat deployment system uses BLAKE2b for package signing<ref>[https://www.habitat.sh/docs/internals-crypto/ Habitat Internals: Cryptography]</ref>
279* [[FreeBSD Ports]] package management tool uses BLAKE2b
280* [[GNU Core Utilities]] implements BLAKE2b in its b2sum command<ref>{{cite web|url=https://github.com/coreutils/coreutils/tree/master/src/blake2|title=coreutils/src/blake2/|website=github.com}}</ref>
281* [[IPFS]] allows use of BLAKE2b for tree hashing
282* [[librsync]] uses BLAKE2b<ref>{{cite web|url=https://github.com/librsync/librsync/tree/master/src/blake2|title=librsync/src/blake2/|website=github.com}}</ref>
283* [[Noise (cryptographic protocol)]], which is used in [[WhatsApp]] includes BLAKE2 as an option.<ref>{{cite web|url=https://www.whatsapp.com/security/WhatsApp-Security-Whitepaper.pdf|title=WhatsApp Security Whitepaper}}</ref>{{Citation needed|reason=WhatsApp Security Whitepaper doesn't support claim.|date=July 2019}}
284* [[RAR (file format)|RAR]] file archive format version 5 supports an optional 256-bit BLAKE2sp file checksum instead of the default 32-bit [[CRC32]]; it was implemented in [[WinRAR]] v5+<ref>{{cite web|url=http://rarsoft.com/rarnew.htm|title=WinRAR archiver, a powerful tool to process RAR and ZIP files|website=rarsoft.com}}</ref>
285* [[rmlint]] uses BLAKE2b for duplicate file detection<ref>{{cite web|url=https://rmlint.readthedocs.io/en/latest/rmlint.1.html|title=rmlint — rmlint documentation}}</ref>
286* [[WireGuard]] uses BLAKE2s for hashing<ref>{{cite web|url=https://www.wireguard.com/papers/wireguard.pdf|title=WireGuard: Next Generation Kernel Network Tunnel}}</ref>
287* [[Zcash]], a cryptocurrency, uses BLAKE2b in the [[Equihash]] proof of work, and as a [[key derivation function]]
288* [[Nano_(cryptocurrency)|NANO]], a cryptocurrency, uses BLAKE2b in the proof of work, for hashing digital signatures and as a [[key derivation function]]<ref>{{cite web|url=https://docs.nano.org/integration-guides/work-generation/?h=+blake2b#work-equation|title=work|website=docs.nano.org}}</ref> <ref>{{cite web|url=https://docs.nano.org/whitepaper/english/?h=+blake2b#signing-algorithm|title=signatures|website=docs.nano.org}}</ref> <ref>{{cite web|url=https://docs.nano.org/integration-guides/the-basics/?h=+blake2b#seed|title=key derivation|website=docs.nano.org}}</ref>
289
290===Implementations===
291In addition to the reference implementation,<ref name="reference-implementation-repo" /> the following cryptography libraries provide implementations of BLAKE2:
292
293* [[Botan (programming library)|Botan]]
294* [[Bouncy Castle (cryptography)|Bouncy Castle]]
295* [[Crypto++]]
296* [[Libgcrypt]]
297* [[NaCl (software)|libsodium]]
298* [[OpenSSL]]
299* [[wolfSSL]]
300
301==BLAKE3==
302{{Infobox encryption method
303| name = BLAKE3
304| image =
305| caption =
306<!-- General -->
307| designers = Jack O'Connor, Samuel Neves, Jean-Philippe Aumasson, [[Zooko Wilcox-O'Hearn]]
308| publish date = {{Start date and age|2020|01|09}}
309| series =
310| derived from = Bao, BLAKE2
311| derived to =
312| related to =
313| certification =
314<!-- Detail -->
315| digest size = 256 bits, arbitrarily extensible
316| structure = [[Merkle tree]]
317| rounds = 7
318| speed = 0.49 [[cycles per byte|cpb]] on Cascade Lake-SP with AVX-512<ref>{{cite web|url=https://github.com/BLAKE3-team/BLAKE3-specs/raw/master/blake3.pdf|title=BLAKE3 – one function, fast everywhere}}</ref>
319| cryptanalysis =
320}}
321
322'''BLAKE3''' is a cryptographic hash function based on Bao and BLAKE2, created by Jack O'Connor, Jean-Philippe Aumasson, Samuel Neves, and [[Zooko Wilcox-O'Hearn]]. It was announced on January 9th, 2020 at [[Real World Crypto]].<ref>{{cite web|url=https://github.com/oconnor663/bao/blob/ae247d2aff286dfe0a31d41b6afc02b263956091/docs/spec.md|title=An earlier version of Bao specified its own custom tree mode, which eventually grew into BLAKE3.}}</ref>
323
324BLAKE3 is a single algorithm with many desirable features (parallelism, XOF, KDF, PRF and MAC), in contrast to BLAKE and BLAKE2, which are algorithm families with multiple variants. BLAKE3 is a [[Merkle tree]], so it supports a practically unlimited degree of parallelism (both SIMD and multithreading) on large files. The official [[Rust (programming language)|Rust]] and [[C (programming language)|C]] implementations<ref name="BLAKE3-repo">{{cite web|url=https://github.com/BLAKE3-team/BLAKE3|title=BLAKE3 official implementations|accessdate=12 January 2020}}</ref> are [[Multi-licensing|dual-licensed]] as public domain ([[CC0]]) and the [[Apache License]].<ref>{{cite web|url=https://github.com/BLAKE3-team/BLAKE3/blob/master/LICENSE|title=This work is released into the public domain with CC0 1.0. Alternatively, it is licensed under the Apache License 2.0.}}</ref>
325
326BLAKE3 is designed to be as fast as possible. It is consistently a few times faster than BLAKE2. The BLAKE3 compression function is closely based on that of BLAKE2s, with the biggest difference being that the number of rounds is reduced from 10 to 7, a change based on the assumption that current cryptography is too conservative.<ref>{{cite conference |last1=Aumasson |first1=Jean-Philippe |title=Too Much Crypto |url=https://eprint.iacr.org/2019/1492.pdf |date=2020 |conference=Real World Crypto Symposium}}</ref> In addition to providing parallelism, the Merkle tree format also allows for verified streaming (on-the-fly verifying) and incremental updates.<ref name="BLAKE3-repo"/>
327
328==References==
329{{Reflist|30em}}
330
331==External links==
332* [https://131002.net/blake/ The BLAKE web site]
333* [https://blake2.net/ The BLAKE2 web site]
334* [https://blake3.io/ The BLAKE3 web site]
335* [http://cryptography.gmu.edu/athena/index.php?id=source_codes VHDL implmentation of BLAKE], developed by the Cryptographic Engineering Research Group (CERG) at [[George Mason University]]
336
337{{Cryptography navbox | hash}}
338
339{{DEFAULTSORT:Blake}}
340[[Category:Extendable-output functions]]
341[[Category:NIST hash function competition]]
342[[Category:Public-domain software with source code]]
Wikimedia Edits