pd.if.org Git - zpackage/blob - crypto/libeddsa/lib/sha512.c

   1 /*
   2  * sha512 - calculates sha512 hash
   3  *
   4  * Written by Philipp Lay <philipp.lay@illunis.net> using code from
   5  * LibTomCrypt by Tom St Denis as reference.
   6  *
   7  * This code is under public domain.
   8  */
   9
  10 #include <stddef.h>
  11 #include <stdint.h>
  12 #include <string.h>
  13
  14 #include "sha512.h"
  15
  16 static const uint64_t K[80] = {
  17         0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL, 0xb5c0fbcfec4d3b2fULL,
  18         0xe9b5dba58189dbbcULL, 0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
  19         0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL, 0xd807aa98a3030242ULL,
  20         0x12835b0145706fbeULL, 0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
  21         0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL, 0x9bdc06a725c71235ULL,
  22         0xc19bf174cf692694ULL, 0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
  23         0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL, 0x2de92c6f592b0275ULL,
  24         0x4a7484aa6ea6e483ULL, 0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
  25         0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL, 0xb00327c898fb213fULL,
  26         0xbf597fc7beef0ee4ULL, 0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
  27         0x06ca6351e003826fULL, 0x142929670a0e6e70ULL, 0x27b70a8546d22ffcULL,
  28         0x2e1b21385c26c926ULL, 0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
  29         0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL, 0x81c2c92e47edaee6ULL,
  30         0x92722c851482353bULL, 0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
  31         0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL, 0xd192e819d6ef5218ULL,
  32         0xd69906245565a910ULL, 0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
  33         0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL, 0x2748774cdf8eeb99ULL,
  34         0x34b0bcb5e19b48a8ULL, 0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
  35         0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL, 0x748f82ee5defb2fcULL,
  36         0x78a5636f43172f60ULL, 0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
  37         0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL, 0xbef9a3f7b2c67915ULL,
  38         0xc67178f2e372532bULL, 0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
  39         0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL, 0x06f067aa72176fbaULL,
  40         0x0a637dc5a2c898a6ULL, 0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
  41         0x28db77f523047d84ULL, 0x32caab7b40c72493ULL, 0x3c9ebe0a15c9bebcULL,
  42         0x431d67c49c100d4cULL, 0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
  43         0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
  44 };
  45
  46
  47 #define ROR(x, n)       ( ((x) >> (n)) | ((x) << (64-(n))) )
  48 #define S0(x)           (ROR(x, 28) ^ ROR(x, 34) ^ ROR(x, 39))
  49 #define S1(x)           (ROR(x, 14) ^ ROR(x, 18) ^ ROR(x, 41))
  50 #define G0(x)           (ROR(x, 1) ^ ROR(x, 8) ^ (x >> 7))
  51 #define G1(x)           (ROR(x, 19) ^ ROR(x, 61) ^ (x >> 6))
  52
  53
  54 #define ROUND(i, a,b,c,d,e,f,g,h)                       \
  55      t = h + S1(e) + (g ^ (e & (f ^ g))) + K[i] + W[i]; \
  56      d += t;                                            \
  57      h  = t + S0(a) + ( ((a | b) & c) | (a & b) )
  58
  59
  60 static void
  61 store_be64(uint8_t *p, uint64_t x)
  62 {
  63         p[0] = (x >> 56) & 0xff;
  64         p[1] = (x >> 48) & 0xff;
  65         p[2] = (x >> 40) & 0xff;
  66         p[3] = (x >> 32) & 0xff;
  67         p[4] = (x >> 24) & 0xff;
  68         p[5] = (x >> 16) & 0xff;
  69         p[6] = (x >>  8) & 0xff;
  70         p[7] = (x >>  0) & 0xff;
  71 }
  72
  73 static uint64_t
  74 load_be64(const uint8_t *p)
  75 {
  76         return ((uint64_t)p[0] << 56) | ((uint64_t)p[1] << 48) |
  77                 ((uint64_t)p[2] << 40) | ((uint64_t)p[3] << 32) |
  78                 ((uint64_t)p[4] << 24) | ((uint64_t)p[5] << 16) |
  79                 ((uint64_t)p[6] << 8) | ((uint64_t)p[7]);
  80 }
  81
  82
  83 static void
  84 compress(uint64_t state[8], const uint8_t buf[SHA512_BLOCK_SIZE])
  85 {
  86         uint64_t W[80], t;
  87         uint64_t a, b, c, d, e, f, g, h;
  88         int i;
  89
  90         a = state[0];
  91         b = state[1];
  92         c = state[2];
  93         d = state[3];
  94         e = state[4];
  95         f = state[5];
  96         g = state[6];
  97         h = state[7];
  98
  99         for (i = 0; i < 16; i++)
 100                 W[i] = load_be64(buf+8*i);
 101
 102         for (i = 16; i < 80; i++)
 103                 W[i] = W[i-16] + G0(W[i-15]) + W[i-7] + G1(W[i-2]);
 104
 105         for (i = 0; i < 80; i += 8) {
 106                 ROUND(i+0, a,b,c,d,e,f,g,h);
 107                 ROUND(i+1, h,a,b,c,d,e,f,g);
 108                 ROUND(i+2, g,h,a,b,c,d,e,f);
 109                 ROUND(i+3, f,g,h,a,b,c,d,e);
 110                 ROUND(i+4, e,f,g,h,a,b,c,d);
 111                 ROUND(i+5, d,e,f,g,h,a,b,c);
 112                 ROUND(i+6, c,d,e,f,g,h,a,b);
 113                 ROUND(i+7, b,c,d,e,f,g,h,a);
 114         }
 115
 116         state[0] += a;
 117         state[1] += b;
 118         state[2] += c;
 119         state[3] += d;
 120         state[4] += e;
 121         state[5] += f;
 122         state[6] += g;
 123         state[7] += h;
 124 }
 125
 126
 127 void
 128 sha512_init(struct sha512 *ctx)
 129 {
 130         ctx->fill = 0;
 131         ctx->count = 0;
 132
 133         ctx->state[0] = 0x6a09e667f3bcc908ULL;
 134         ctx->state[1] = 0xbb67ae8584caa73bULL;
 135         ctx->state[2] = 0x3c6ef372fe94f82bULL;
 136         ctx->state[3] = 0xa54ff53a5f1d36f1ULL;
 137         ctx->state[4] = 0x510e527fade682d1ULL;
 138         ctx->state[5] = 0x9b05688c2b3e6c1fULL;
 139         ctx->state[6] = 0x1f83d9abfb41bd6bULL;
 140         ctx->state[7] = 0x5be0cd19137e2179ULL;
 141 }
 142
 143 void
 144 sha512_add(struct sha512 *ctx, const uint8_t *data, size_t len)
 145 {
 146         if (ctx->fill > 0) {
 147                 /* fill internal buffer up and compress */
 148                 while (ctx->fill < SHA512_BLOCK_SIZE && len > 0) {
 149                         ctx->buffer[ctx->fill++] = *data++;
 150                         len--;
 151                 }
 152                 if (ctx->fill < SHA512_BLOCK_SIZE)
 153                         return;
 154
 155                 compress(ctx->state, ctx->buffer);
 156                 ctx->count++;
 157         }
 158
 159         /* ctx->fill is now zero */
 160
 161         while (len >= SHA512_BLOCK_SIZE) {
 162                 compress(ctx->state, data);
 163                 ctx->count++;
 164
 165                 data += SHA512_BLOCK_SIZE;
 166                 len -= SHA512_BLOCK_SIZE;
 167         }
 168
 169         /* save rest for next time */
 170         memcpy(ctx->buffer, data, len);
 171         ctx->fill = len;
 172 }
 173
 174
 175 void
 176 sha512_final(struct sha512 *ctx, uint8_t out[SHA512_HASH_LENGTH])
 177 {
 178         size_t rest;
 179         int i;
 180
 181         rest = ctx->fill;
 182
 183         /* append 1-bit to signal end of data */
 184         ctx->buffer[ctx->fill++] = 0x80;
 185
 186         if (ctx->fill > SHA512_BLOCK_SIZE - 16) {
 187                 while (ctx->fill < SHA512_BLOCK_SIZE)
 188                         ctx->buffer[ctx->fill++] = 0;
 189
 190                 compress(ctx->state, ctx->buffer);
 191                 ctx->fill = 0;
 192         }
 193         while (ctx->fill < SHA512_BLOCK_SIZE - 16)
 194                 ctx->buffer[ctx->fill++] = 0;
 195
 196         /* because rest < 128 our message length is
 197          * L := 128*ctx->count + rest == (ctx->count<<7)|rest,
 198          * now convert L to number of bits and write out as 128bit big-endian.
 199          */
 200         store_be64(ctx->buffer+SHA512_BLOCK_SIZE-16,
 201                         ctx->count >> 54);
 202         store_be64(ctx->buffer+SHA512_BLOCK_SIZE-8,
 203                         ((ctx->count << 7) | rest) << 3);
 204
 205         compress(ctx->state, ctx->buffer);
 206
 207
 208         for (i = 0; i < 8; i++)
 209                 store_be64(out + 8*i, ctx->state[i]);
 210 }