1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
|
/*
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Copyright (c) 2012, Intel Corporation
;
; All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are
; met:
;
; * Redistributions of source code must retain the above copyright
; notice, this list of conditions and the following disclaimer.
;
; * Redistributions in binary form must reproduce the above copyright
; notice, this list of conditions and the following disclaimer in the
; documentation and/or other materials provided with the
; distribution.
;
; * Neither the name of the Intel Corporation nor the names of its
; contributors may be used to endorse or promote products derived from
; this software without specific prior written permission.
;
;
; THIS SOFTWARE IS PROVIDED BY INTEL CORPORATION "AS IS" AND ANY
; EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
; IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
; PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL INTEL CORPORATION OR
; CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
; EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
; PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
; PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
; LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
; NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
; SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
*/
/*
* Conversion to GAS assembly and integration to libgcrypt
* by Jussi Kivilinna <jussi.kivilinna@iki.fi>
*/
#ifdef __x86_64
#include <config.h>
#if (defined(HAVE_COMPATIBLE_GCC_AMD64_PLATFORM_AS) || \
defined(HAVE_COMPATIBLE_GCC_WIN64_PLATFORM_AS)) && \
defined(HAVE_INTEL_SYNTAX_PLATFORM_AS) && \
defined(HAVE_GCC_INLINE_ASM_AVX) && defined(USE_SHA512)
#include "asm-common-amd64.h"
.intel_syntax noprefix
.text
/* Virtual Registers */
#define msg rdi /* ARG1 */
#define digest rsi /* ARG2 */
#define msglen rdx /* ARG3 */
#define T1 rcx
#define T2 r8
#define a_64 r9
#define b_64 r10
#define c_64 r11
#define d_64 r12
#define e_64 r13
#define f_64 r14
#define g_64 r15
#define h_64 rbx
#define tmp0 rax
/*
; Local variables (stack frame)
; Note: frame_size must be an odd multiple of 8 bytes to XMM align RSP
*/
#define frame_W 0 /* Message Schedule */
#define frame_W_size (80 * 8)
#define frame_WK ((frame_W) + (frame_W_size)) /* W[t] + K[t] | W[t+1] + K[t+1] */
#define frame_WK_size (2 * 8)
#define frame_GPRSAVE ((frame_WK) + (frame_WK_size))
#define frame_GPRSAVE_size (5 * 8)
#define frame_size ((frame_GPRSAVE) + (frame_GPRSAVE_size))
/* Useful QWORD "arrays" for simpler memory references */
#define MSG(i) msg + 8*(i) /* Input message (arg1) */
#define DIGEST(i) digest + 8*(i) /* Output Digest (arg2) */
#define K_t(i) .LK512 + 8*(i) ADD_RIP /* SHA Constants (static mem) */
#define W_t(i) rsp + frame_W + 8*(i) /* Message Schedule (stack frame) */
#define WK_2(i) rsp + frame_WK + 8*((i) % 2) /* W[t]+K[t] (stack frame) */
/* MSG, DIGEST, K_t, W_t are arrays */
/* WK_2(t) points to 1 of 2 qwords at frame.WK depdending on t being odd/even */
#define RORQ(p1, p2) \
/* shld is faster than ror on Intel Sandybridge */ \
shld p1, p1, (64 - p2)
#define SHA512_Round(t, a, b, c, d, e, f, g, h) \
/* Compute Round %%t */; \
mov T1, f /* T1 = f */; \
mov tmp0, e /* tmp = e */; \
xor T1, g /* T1 = f ^ g */; \
RORQ( tmp0, 23) /* 41 ; tmp = e ror 23 */; \
and T1, e /* T1 = (f ^ g) & e */; \
xor tmp0, e /* tmp = (e ror 23) ^ e */; \
xor T1, g /* T1 = ((f ^ g) & e) ^ g = CH(e,f,g) */; \
add T1, [WK_2(t)] /* W[t] + K[t] from message scheduler */; \
RORQ( tmp0, 4) /* 18 ; tmp = ((e ror 23) ^ e) ror 4 */; \
xor tmp0, e /* tmp = (((e ror 23) ^ e) ror 4) ^ e */; \
mov T2, a /* T2 = a */; \
add T1, h /* T1 = CH(e,f,g) + W[t] + K[t] + h */; \
RORQ( tmp0, 14) /* 14 ; tmp = ((((e ror23)^e)ror4)^e)ror14 = S1(e) */; \
add T1, tmp0 /* T1 = CH(e,f,g) + W[t] + K[t] + S1(e) */; \
mov tmp0, a /* tmp = a */; \
xor T2, c /* T2 = a ^ c */; \
and tmp0, c /* tmp = a & c */; \
and T2, b /* T2 = (a ^ c) & b */; \
xor T2, tmp0 /* T2 = ((a ^ c) & b) ^ (a & c) = Maj(a,b,c) */; \
mov tmp0, a /* tmp = a */; \
RORQ( tmp0, 5) /* 39 ; tmp = a ror 5 */; \
xor tmp0, a /* tmp = (a ror 5) ^ a */; \
add d, T1 /* e(next_state) = d + T1 */; \
RORQ( tmp0, 6) /* 34 ; tmp = ((a ror 5) ^ a) ror 6 */; \
xor tmp0, a /* tmp = (((a ror 5) ^ a) ror 6) ^ a */; \
lea h, [T1 + T2] /* a(next_state) = T1 + Maj(a,b,c) */; \
RORQ( tmp0, 28) /* 28 ; tmp = ((((a ror5)^a)ror6)^a)ror28 = S0(a) */; \
add h, tmp0 /* a(next_state) = T1 + Maj(a,b,c) S0(a) */
#define SHA512_2Sched_2Round_avx_PART1(t, a, b, c, d, e, f, g, h) \
/* \
; Compute rounds %%t-2 and %%t-1 \
; Compute message schedule QWORDS %%t and %%t+1 \
; \
; Two rounds are computed based on the values for K[t-2]+W[t-2] and \
; K[t-1]+W[t-1] which were previously stored at WK_2 by the message \
; scheduler. \
; The two new schedule QWORDS are stored at [W_t(%%t)] and [W_t(%%t+1)]. \
; They are then added to their respective SHA512 constants at \
; [K_t(%%t)] and [K_t(%%t+1)] and stored at dqword [WK_2(%%t)] \
; For brievity, the comments following vectored instructions only refer to \
; the first of a pair of QWORDS. \
; Eg. XMM4=W[t-2] really means XMM4={W[t-2]|W[t-1]} \
; The computation of the message schedule and the rounds are tightly \
; stitched to take advantage of instruction-level parallelism. \
; For clarity, integer instructions (for the rounds calculation) are indented \
; by one tab. Vectored instructions (for the message scheduler) are indented \
; by two tabs. \
*/ \
\
vmovdqa xmm4, [W_t(t-2)] /* XMM4 = W[t-2] */; \
vmovdqu xmm5, [W_t(t-15)] /* XMM5 = W[t-15] */; \
mov T1, f; \
vpsrlq xmm0, xmm4, 61 /* XMM0 = W[t-2]>>61 */; \
mov tmp0, e; \
vpsrlq xmm6, xmm5, 1 /* XMM6 = W[t-15]>>1 */; \
xor T1, g; \
RORQ( tmp0, 23) /* 41 */; \
vpsrlq xmm1, xmm4, 19 /* XMM1 = W[t-2]>>19 */; \
and T1, e; \
xor tmp0, e; \
vpxor xmm0, xmm0, xmm1 /* XMM0 = W[t-2]>>61 ^ W[t-2]>>19 */; \
xor T1, g; \
add T1, [WK_2(t)]; \
vpsrlq xmm7, xmm5, 8 /* XMM7 = W[t-15]>>8 */; \
RORQ( tmp0, 4) /* 18 */; \
vpsrlq xmm2, xmm4, 6 /* XMM2 = W[t-2]>>6 */; \
xor tmp0, e; \
mov T2, a; \
add T1, h; \
vpxor xmm6, xmm6, xmm7 /* XMM6 = W[t-15]>>1 ^ W[t-15]>>8 */; \
RORQ( tmp0, 14) /* 14 */; \
add T1, tmp0; \
vpsrlq xmm8, xmm5, 7 /* XMM8 = W[t-15]>>7 */; \
mov tmp0, a; \
xor T2, c; \
vpsllq xmm3, xmm4, (64-61) /* XMM3 = W[t-2]<<3 */; \
and tmp0, c; \
and T2, b; \
vpxor xmm2, xmm2, xmm3 /* XMM2 = W[t-2]>>6 ^ W[t-2]<<3 */; \
xor T2, tmp0; \
mov tmp0, a; \
vpsllq xmm9, xmm5, (64-1) /* XMM9 = W[t-15]<<63 */; \
RORQ( tmp0, 5) /* 39 */; \
vpxor xmm8, xmm8, xmm9 /* XMM8 = W[t-15]>>7 ^ W[t-15]<<63 */; \
xor tmp0, a; \
add d, T1; \
RORQ( tmp0, 6) /* 34 */; \
xor tmp0, a; \
vpxor xmm6, xmm6, xmm8 /* XMM6 = W[t-15]>>1 ^ W[t-15]>>8 ^ W[t-15]>>7 ^ W[t-15]<<63 */; \
lea h, [T1 + T2]; \
RORQ( tmp0, 28) /* 28 */; \
vpsllq xmm4, xmm4, (64-19) /* XMM4 = W[t-2]<<25 */; \
add h, tmp0
#define SHA512_2Sched_2Round_avx_PART2(t, a, b, c, d, e, f, g, h) \
vpxor xmm0, xmm0, xmm4 /* XMM0 = W[t-2]>>61 ^ W[t-2]>>19 ^ W[t-2]<<25 */; \
mov T1, f; \
vpxor xmm0, xmm0, xmm2 /* XMM0 = s1(W[t-2]) */; \
mov tmp0, e; \
xor T1, g; \
vpaddq xmm0, xmm0, [W_t(t-16)] /* XMM0 = s1(W[t-2]) + W[t-16] */; \
vmovdqu xmm1, [W_t(t- 7)] /* XMM1 = W[t-7] */; \
RORQ( tmp0, 23) /* 41 */; \
and T1, e; \
xor tmp0, e; \
xor T1, g; \
vpsllq xmm5, xmm5, (64-8) /* XMM5 = W[t-15]<<56 */; \
add T1, [WK_2(t+1)]; \
vpxor xmm6, xmm6, xmm5 /* XMM6 = s0(W[t-15]) */; \
RORQ( tmp0, 4) /* 18 */; \
vpaddq xmm0, xmm0, xmm6 /* XMM0 = s1(W[t-2]) + W[t-16] + s0(W[t-15]) */; \
xor tmp0, e; \
vpaddq xmm0, xmm0, xmm1 /* XMM0 = W[t] = s1(W[t-2]) + W[t-7] + s0(W[t-15]) + W[t-16] */; \
mov T2, a; \
add T1, h; \
RORQ( tmp0, 14) /* 14 */; \
add T1, tmp0; \
vmovdqa [W_t(t)], xmm0 /* Store W[t] */; \
vpaddq xmm0, xmm0, [K_t(t)] /* Compute W[t]+K[t] */; \
vmovdqa [WK_2(t)], xmm0 /* Store W[t]+K[t] for next rounds */; \
mov tmp0, a; \
xor T2, c; \
and tmp0, c; \
and T2, b; \
xor T2, tmp0; \
mov tmp0, a; \
RORQ( tmp0, 5) /* 39 */; \
xor tmp0, a; \
add d, T1; \
RORQ( tmp0, 6) /* 34 */; \
xor tmp0, a; \
lea h, [T1 + T2]; \
RORQ( tmp0, 28) /* 28 */; \
add h, tmp0
#define SHA512_2Sched_2Round_avx(t, a, b, c, d, e, f, g, h) \
SHA512_2Sched_2Round_avx_PART1(t, a, b, c, d, e, f, g, h); \
SHA512_2Sched_2Round_avx_PART2(t, h, a, b, c, d, e, f, g)
/*
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; void sha512_avx(const void* M, void* D, uint64_t L);
; Purpose: Updates the SHA512 digest stored at D with the message stored in M.
; The size of the message pointed to by M must be an integer multiple of SHA512
; message blocks.
; L is the message length in SHA512 blocks
*/
.globl _gcry_sha512_transform_amd64_avx
ELF(.type _gcry_sha512_transform_amd64_avx,@function;)
.align 16
_gcry_sha512_transform_amd64_avx:
CFI_STARTPROC()
xor eax, eax
cmp msglen, 0
je .Lnowork
vzeroupper
/* Allocate Stack Space */
sub rsp, frame_size
CFI_ADJUST_CFA_OFFSET(frame_size);
/* Save GPRs */
mov [rsp + frame_GPRSAVE + 8 * 0], rbx
mov [rsp + frame_GPRSAVE + 8 * 1], r12
mov [rsp + frame_GPRSAVE + 8 * 2], r13
mov [rsp + frame_GPRSAVE + 8 * 3], r14
mov [rsp + frame_GPRSAVE + 8 * 4], r15
CFI_REL_OFFSET(rbx, frame_GPRSAVE + 8 * 0);
CFI_REL_OFFSET(r12, frame_GPRSAVE + 8 * 1);
CFI_REL_OFFSET(r13, frame_GPRSAVE + 8 * 2);
CFI_REL_OFFSET(r14, frame_GPRSAVE + 8 * 3);
CFI_REL_OFFSET(r15, frame_GPRSAVE + 8 * 4);
.Lupdateblock:
/* Load state variables */
mov a_64, [DIGEST(0)]
mov b_64, [DIGEST(1)]
mov c_64, [DIGEST(2)]
mov d_64, [DIGEST(3)]
mov e_64, [DIGEST(4)]
mov f_64, [DIGEST(5)]
mov g_64, [DIGEST(6)]
mov h_64, [DIGEST(7)]
/* BSWAP 2 QWORDS */
vmovdqa xmm1, [.LXMM_QWORD_BSWAP ADD_RIP]
vmovdqu xmm0, [MSG(0)]
vpshufb xmm0, xmm0, xmm1 /* BSWAP */
vmovdqa [W_t(0)], xmm0 /* Store Scheduled Pair */
vpaddq xmm0, xmm0, [K_t(0)] /* Compute W[t]+K[t] */
vmovdqa [WK_2(0)], xmm0 /* Store into WK for rounds */
#define T_2_14(t, a, b, c, d, e, f, g, h) \
/* BSWAP 2 QWORDS, Compute 2 Rounds */; \
vmovdqu xmm0, [MSG(t)]; \
vpshufb xmm0, xmm0, xmm1 /* BSWAP */; \
SHA512_Round(((t) - 2), a##_64, b##_64, c##_64, d##_64, \
e##_64, f##_64, g##_64, h##_64); \
vmovdqa [W_t(t)], xmm0 /* Store Scheduled Pair */; \
vpaddq xmm0, xmm0, [K_t(t)] /* Compute W[t]+K[t] */; \
SHA512_Round(((t) - 1), h##_64, a##_64, b##_64, c##_64, \
d##_64, e##_64, f##_64, g##_64); \
vmovdqa [WK_2(t)], xmm0 /* W[t]+K[t] into WK */
#define T_16_78(t, a, b, c, d, e, f, g, h) \
SHA512_2Sched_2Round_avx((t), a##_64, b##_64, c##_64, d##_64, \
e##_64, f##_64, g##_64, h##_64)
#define T_80(t, a, b, c, d, e, f, g, h) \
/* Compute 2 Rounds */; \
SHA512_Round((t - 2), a##_64, b##_64, c##_64, d##_64, \
e##_64, f##_64, g##_64, h##_64); \
SHA512_Round((t - 1), h##_64, a##_64, b##_64, c##_64, \
d##_64, e##_64, f##_64, g##_64)
T_2_14(2, a, b, c, d, e, f, g, h)
T_2_14(4, g, h, a, b, c, d, e, f)
T_2_14(6, e, f, g, h, a, b, c, d)
T_2_14(8, c, d, e, f, g, h, a, b)
T_2_14(10, a, b, c, d, e, f, g, h)
T_2_14(12, g, h, a, b, c, d, e, f)
T_2_14(14, e, f, g, h, a, b, c, d)
T_16_78(16, c, d, e, f, g, h, a, b)
T_16_78(18, a, b, c, d, e, f, g, h)
T_16_78(20, g, h, a, b, c, d, e, f)
T_16_78(22, e, f, g, h, a, b, c, d)
T_16_78(24, c, d, e, f, g, h, a, b)
T_16_78(26, a, b, c, d, e, f, g, h)
T_16_78(28, g, h, a, b, c, d, e, f)
T_16_78(30, e, f, g, h, a, b, c, d)
T_16_78(32, c, d, e, f, g, h, a, b)
T_16_78(34, a, b, c, d, e, f, g, h)
T_16_78(36, g, h, a, b, c, d, e, f)
T_16_78(38, e, f, g, h, a, b, c, d)
T_16_78(40, c, d, e, f, g, h, a, b)
T_16_78(42, a, b, c, d, e, f, g, h)
T_16_78(44, g, h, a, b, c, d, e, f)
T_16_78(46, e, f, g, h, a, b, c, d)
T_16_78(48, c, d, e, f, g, h, a, b)
T_16_78(50, a, b, c, d, e, f, g, h)
T_16_78(52, g, h, a, b, c, d, e, f)
T_16_78(54, e, f, g, h, a, b, c, d)
T_16_78(56, c, d, e, f, g, h, a, b)
T_16_78(58, a, b, c, d, e, f, g, h)
T_16_78(60, g, h, a, b, c, d, e, f)
T_16_78(62, e, f, g, h, a, b, c, d)
T_16_78(64, c, d, e, f, g, h, a, b)
T_16_78(66, a, b, c, d, e, f, g, h)
T_16_78(68, g, h, a, b, c, d, e, f)
T_16_78(70, e, f, g, h, a, b, c, d)
T_16_78(72, c, d, e, f, g, h, a, b)
T_16_78(74, a, b, c, d, e, f, g, h)
T_16_78(76, g, h, a, b, c, d, e, f)
T_16_78(78, e, f, g, h, a, b, c, d)
T_80(80, c, d, e, f, g, h, a, b)
/* Update digest */
add [DIGEST(0)], a_64
add [DIGEST(1)], b_64
add [DIGEST(2)], c_64
add [DIGEST(3)], d_64
add [DIGEST(4)], e_64
add [DIGEST(5)], f_64
add [DIGEST(6)], g_64
add [DIGEST(7)], h_64
/* Advance to next message block */
add msg, 16*8
dec msglen
jnz .Lupdateblock
/* Restore GPRs */
mov rbx, [rsp + frame_GPRSAVE + 8 * 0]
mov r12, [rsp + frame_GPRSAVE + 8 * 1]
mov r13, [rsp + frame_GPRSAVE + 8 * 2]
mov r14, [rsp + frame_GPRSAVE + 8 * 3]
mov r15, [rsp + frame_GPRSAVE + 8 * 4]
CFI_RESTORE(rbx)
CFI_RESTORE(r12)
CFI_RESTORE(r13)
CFI_RESTORE(r14)
CFI_RESTORE(r15)
vzeroall
/* Burn stack */
mov eax, 0
.Lerase_stack:
vmovdqu [rsp + rax], ymm0
add eax, 32
cmp eax, frame_W_size
jne .Lerase_stack
vmovdqu [rsp + frame_WK], xmm0
xor eax, eax
/* Restore Stack Pointer */
add rsp, frame_size
CFI_ADJUST_CFA_OFFSET(-frame_size);
.Lnowork:
ret
CFI_ENDPROC()
/*
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;;; Binary Data
*/
.align 16
/* Mask for byte-swapping a couple of qwords in an XMM register using (v)pshufb. */
.LXMM_QWORD_BSWAP:
.octa 0x08090a0b0c0d0e0f0001020304050607
/* K[t] used in SHA512 hashing */
.LK512:
.quad 0x428a2f98d728ae22,0x7137449123ef65cd
.quad 0xb5c0fbcfec4d3b2f,0xe9b5dba58189dbbc
.quad 0x3956c25bf348b538,0x59f111f1b605d019
.quad 0x923f82a4af194f9b,0xab1c5ed5da6d8118
.quad 0xd807aa98a3030242,0x12835b0145706fbe
.quad 0x243185be4ee4b28c,0x550c7dc3d5ffb4e2
.quad 0x72be5d74f27b896f,0x80deb1fe3b1696b1
.quad 0x9bdc06a725c71235,0xc19bf174cf692694
.quad 0xe49b69c19ef14ad2,0xefbe4786384f25e3
.quad 0x0fc19dc68b8cd5b5,0x240ca1cc77ac9c65
.quad 0x2de92c6f592b0275,0x4a7484aa6ea6e483
.quad 0x5cb0a9dcbd41fbd4,0x76f988da831153b5
.quad 0x983e5152ee66dfab,0xa831c66d2db43210
.quad 0xb00327c898fb213f,0xbf597fc7beef0ee4
.quad 0xc6e00bf33da88fc2,0xd5a79147930aa725
.quad 0x06ca6351e003826f,0x142929670a0e6e70
.quad 0x27b70a8546d22ffc,0x2e1b21385c26c926
.quad 0x4d2c6dfc5ac42aed,0x53380d139d95b3df
.quad 0x650a73548baf63de,0x766a0abb3c77b2a8
.quad 0x81c2c92e47edaee6,0x92722c851482353b
.quad 0xa2bfe8a14cf10364,0xa81a664bbc423001
.quad 0xc24b8b70d0f89791,0xc76c51a30654be30
.quad 0xd192e819d6ef5218,0xd69906245565a910
.quad 0xf40e35855771202a,0x106aa07032bbd1b8
.quad 0x19a4c116b8d2d0c8,0x1e376c085141ab53
.quad 0x2748774cdf8eeb99,0x34b0bcb5e19b48a8
.quad 0x391c0cb3c5c95a63,0x4ed8aa4ae3418acb
.quad 0x5b9cca4f7763e373,0x682e6ff3d6b2b8a3
.quad 0x748f82ee5defb2fc,0x78a5636f43172f60
.quad 0x84c87814a1f0ab72,0x8cc702081a6439ec
.quad 0x90befffa23631e28,0xa4506cebde82bde9
.quad 0xbef9a3f7b2c67915,0xc67178f2e372532b
.quad 0xca273eceea26619c,0xd186b8c721c0c207
.quad 0xeada7dd6cde0eb1e,0xf57d4f7fee6ed178
.quad 0x06f067aa72176fba,0x0a637dc5a2c898a6
.quad 0x113f9804bef90dae,0x1b710b35131c471b
.quad 0x28db77f523047d84,0x32caab7b40c72493
.quad 0x3c9ebe0a15c9bebc,0x431d67c49c100d4c
.quad 0x4cc5d4becb3e42b6,0x597f299cfc657e2a
.quad 0x5fcb6fab3ad6faec,0x6c44198c4a475817
#endif
#endif
|