mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-08 22:30:07 +00:00
106 lines
2.9 KiB
C
106 lines
2.9 KiB
C
#include <stdint.h>
|
|
|
|
/* Process LEN bytes of BUFFER, accumulating context into CTX.
|
|
It is assumed that LEN % 128 == 0. */
|
|
void
|
|
__sha512_process_block (const void *buffer, size_t len, struct sha512_ctx *ctx)
|
|
{
|
|
const uint64_t *words = buffer;
|
|
size_t nwords = len / sizeof (uint64_t);
|
|
uint64_t a = ctx->H[0];
|
|
uint64_t b = ctx->H[1];
|
|
uint64_t c = ctx->H[2];
|
|
uint64_t d = ctx->H[3];
|
|
uint64_t e = ctx->H[4];
|
|
uint64_t f = ctx->H[5];
|
|
uint64_t g = ctx->H[6];
|
|
uint64_t h = ctx->H[7];
|
|
|
|
/* First increment the byte count. FIPS 180-2 specifies the possible
|
|
length of the file up to 2^128 bits. Here we only compute the
|
|
number of bytes. Do a double word increment. */
|
|
#ifdef USE_TOTAL128
|
|
ctx->total128 += len;
|
|
#else
|
|
uint64_t lolen = len;
|
|
ctx->total[TOTAL128_low] += lolen;
|
|
ctx->total[TOTAL128_high] += ((len >> 31 >> 31 >> 2)
|
|
+ (ctx->total[TOTAL128_low] < lolen));
|
|
#endif
|
|
|
|
/* Process all bytes in the buffer with 128 bytes in each round of
|
|
the loop. */
|
|
while (nwords > 0)
|
|
{
|
|
uint64_t W[80];
|
|
uint64_t a_save = a;
|
|
uint64_t b_save = b;
|
|
uint64_t c_save = c;
|
|
uint64_t d_save = d;
|
|
uint64_t e_save = e;
|
|
uint64_t f_save = f;
|
|
uint64_t g_save = g;
|
|
uint64_t h_save = h;
|
|
|
|
/* Operators defined in FIPS 180-2:4.1.2. */
|
|
#define Ch(x, y, z) ((x & y) ^ (~x & z))
|
|
#define Maj(x, y, z) ((x & y) ^ (x & z) ^ (y & z))
|
|
#define S0(x) (CYCLIC (x, 28) ^ CYCLIC (x, 34) ^ CYCLIC (x, 39))
|
|
#define S1(x) (CYCLIC (x, 14) ^ CYCLIC (x, 18) ^ CYCLIC (x, 41))
|
|
#define R0(x) (CYCLIC (x, 1) ^ CYCLIC (x, 8) ^ (x >> 7))
|
|
#define R1(x) (CYCLIC (x, 19) ^ CYCLIC (x, 61) ^ (x >> 6))
|
|
|
|
/* It is unfortunate that C does not provide an operator for
|
|
cyclic rotation. Hope the C compiler is smart enough. */
|
|
#define CYCLIC(w, s) ((w >> s) | (w << (64 - s)))
|
|
|
|
/* Compute the message schedule according to FIPS 180-2:6.3.2 step 2. */
|
|
for (unsigned int t = 0; t < 16; ++t)
|
|
{
|
|
W[t] = SWAP (*words);
|
|
++words;
|
|
}
|
|
for (unsigned int t = 16; t < 80; ++t)
|
|
W[t] = R1 (W[t - 2]) + W[t - 7] + R0 (W[t - 15]) + W[t - 16];
|
|
|
|
/* The actual computation according to FIPS 180-2:6.3.2 step 3. */
|
|
for (unsigned int t = 0; t < 80; ++t)
|
|
{
|
|
uint64_t T1 = h + S1 (e) + Ch (e, f, g) + K[t] + W[t];
|
|
uint64_t T2 = S0 (a) + Maj (a, b, c);
|
|
h = g;
|
|
g = f;
|
|
f = e;
|
|
e = d + T1;
|
|
d = c;
|
|
c = b;
|
|
b = a;
|
|
a = T1 + T2;
|
|
}
|
|
|
|
/* Add the starting values of the context according to FIPS 180-2:6.3.2
|
|
step 4. */
|
|
a += a_save;
|
|
b += b_save;
|
|
c += c_save;
|
|
d += d_save;
|
|
e += e_save;
|
|
f += f_save;
|
|
g += g_save;
|
|
h += h_save;
|
|
|
|
/* Prepare for the next round. */
|
|
nwords -= 16;
|
|
}
|
|
|
|
/* Put checksum in context given as argument. */
|
|
ctx->H[0] = a;
|
|
ctx->H[1] = b;
|
|
ctx->H[2] = c;
|
|
ctx->H[3] = d;
|
|
ctx->H[4] = e;
|
|
ctx->H[5] = f;
|
|
ctx->H[6] = g;
|
|
ctx->H[7] = h;
|
|
}
|