lib/crypto/sha512.c

   1 /*
   2  * Copyright (c) 2006, 2010 Kungliga Tekniska Högskolan
   3  * (Royal Institute of Technology, Stockholm, Sweden).
   4  * All rights reserved.
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  *
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  *
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  *
  17  * 3. Neither the name of the Institute nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #include "replace.h"
  35 #include "sha512.h"
  36
  37 #ifndef min
  38 #define min(a,b) (((a)>(b))?(b):(a))
  39 #endif
  40
  41 static inline uint64_t
  42 cshift64 (uint64_t x, unsigned int n)
  43 {
  44   return ((uint64_t)x << (uint64_t)n) | ((uint64_t)x >> ((uint64_t)64 - (uint64_t)n));
  45 }
  46
  47
  48 #define Ch(x,y,z) (((x) & (y)) ^ ((~(x)) & (z)))
  49 #define Maj(x,y,z) (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
  50
  51 #define ROTR(x,n)   (((x)>>(n)) | ((x) << (64 - (n))))
  52
  53 #define Sigma0(x)       (ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39))
  54 #define Sigma1(x)       (ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41))
  55 #define sigma0(x)       (ROTR(x,1)  ^ ROTR(x,8)  ^ ((x)>>7))
  56 #define sigma1(x)       (ROTR(x,19) ^ ROTR(x,61) ^ ((x)>>6))
  57
  58 #define A m->counter[0]
  59 #define B m->counter[1]
  60 #define C m->counter[2]
  61 #define D m->counter[3]
  62 #define E m->counter[4]
  63 #define F m->counter[5]
  64 #define G m->counter[6]
  65 #define H m->counter[7]
  66
  67 static const uint64_t constant_512[80] = {
  68     0x428a2f98d728ae22ULL, 0x7137449123ef65cdULL,
  69     0xb5c0fbcfec4d3b2fULL, 0xe9b5dba58189dbbcULL,
  70     0x3956c25bf348b538ULL, 0x59f111f1b605d019ULL,
  71     0x923f82a4af194f9bULL, 0xab1c5ed5da6d8118ULL,
  72     0xd807aa98a3030242ULL, 0x12835b0145706fbeULL,
  73     0x243185be4ee4b28cULL, 0x550c7dc3d5ffb4e2ULL,
  74     0x72be5d74f27b896fULL, 0x80deb1fe3b1696b1ULL,
  75     0x9bdc06a725c71235ULL, 0xc19bf174cf692694ULL,
  76     0xe49b69c19ef14ad2ULL, 0xefbe4786384f25e3ULL,
  77     0x0fc19dc68b8cd5b5ULL, 0x240ca1cc77ac9c65ULL,
  78     0x2de92c6f592b0275ULL, 0x4a7484aa6ea6e483ULL,
  79     0x5cb0a9dcbd41fbd4ULL, 0x76f988da831153b5ULL,
  80     0x983e5152ee66dfabULL, 0xa831c66d2db43210ULL,
  81     0xb00327c898fb213fULL, 0xbf597fc7beef0ee4ULL,
  82     0xc6e00bf33da88fc2ULL, 0xd5a79147930aa725ULL,
  83     0x06ca6351e003826fULL, 0x142929670a0e6e70ULL,
  84     0x27b70a8546d22ffcULL, 0x2e1b21385c26c926ULL,
  85     0x4d2c6dfc5ac42aedULL, 0x53380d139d95b3dfULL,
  86     0x650a73548baf63deULL, 0x766a0abb3c77b2a8ULL,
  87     0x81c2c92e47edaee6ULL, 0x92722c851482353bULL,
  88     0xa2bfe8a14cf10364ULL, 0xa81a664bbc423001ULL,
  89     0xc24b8b70d0f89791ULL, 0xc76c51a30654be30ULL,
  90     0xd192e819d6ef5218ULL, 0xd69906245565a910ULL,
  91     0xf40e35855771202aULL, 0x106aa07032bbd1b8ULL,
  92     0x19a4c116b8d2d0c8ULL, 0x1e376c085141ab53ULL,
  93     0x2748774cdf8eeb99ULL, 0x34b0bcb5e19b48a8ULL,
  94     0x391c0cb3c5c95a63ULL, 0x4ed8aa4ae3418acbULL,
  95     0x5b9cca4f7763e373ULL, 0x682e6ff3d6b2b8a3ULL,
  96     0x748f82ee5defb2fcULL, 0x78a5636f43172f60ULL,
  97     0x84c87814a1f0ab72ULL, 0x8cc702081a6439ecULL,
  98     0x90befffa23631e28ULL, 0xa4506cebde82bde9ULL,
  99     0xbef9a3f7b2c67915ULL, 0xc67178f2e372532bULL,
 100     0xca273eceea26619cULL, 0xd186b8c721c0c207ULL,
 101     0xeada7dd6cde0eb1eULL, 0xf57d4f7fee6ed178ULL,
 102     0x06f067aa72176fbaULL, 0x0a637dc5a2c898a6ULL,
 103     0x113f9804bef90daeULL, 0x1b710b35131c471bULL,
 104     0x28db77f523047d84ULL, 0x32caab7b40c72493ULL,
 105     0x3c9ebe0a15c9bebcULL, 0x431d67c49c100d4cULL,
 106     0x4cc5d4becb3e42b6ULL, 0x597f299cfc657e2aULL,
 107     0x5fcb6fab3ad6faecULL, 0x6c44198c4a475817ULL
 108 };
 109
 110 void
 111 samba_SHA512_Init (SHA512_CTX *m)
 112 {
 113     m->sz[0] = 0;
 114     m->sz[1] = 0;
 115     A = 0x6a09e667f3bcc908ULL;
 116     B = 0xbb67ae8584caa73bULL;
 117     C = 0x3c6ef372fe94f82bULL;
 118     D = 0xa54ff53a5f1d36f1ULL;
 119     E = 0x510e527fade682d1ULL;
 120     F = 0x9b05688c2b3e6c1fULL;
 121     G = 0x1f83d9abfb41bd6bULL;
 122     H = 0x5be0cd19137e2179ULL;
 123 }
 124
 125 static void
 126 calc (SHA512_CTX *m, uint64_t *in)
 127 {
 128     uint64_t AA, BB, CC, DD, EE, FF, GG, HH;
 129     uint64_t data[80];
 130     int i;
 131
 132     AA = A;
 133     BB = B;
 134     CC = C;
 135     DD = D;
 136     EE = E;
 137     FF = F;
 138     GG = G;
 139     HH = H;
 140
 141     for (i = 0; i < 16; ++i)
 142         data[i] = in[i];
 143     for (i = 16; i < 80; ++i)
 144         data[i] = sigma1(data[i-2]) + data[i-7] +
 145             sigma0(data[i-15]) + data[i - 16];
 146
 147     for (i = 0; i < 80; i++) {
 148         uint64_t T1, T2;
 149
 150         T1 = HH + Sigma1(EE) + Ch(EE, FF, GG) + constant_512[i] + data[i];
 151         T2 = Sigma0(AA) + Maj(AA,BB,CC);
 152
 153         HH = GG;
 154         GG = FF;
 155         FF = EE;
 156         EE = DD + T1;
 157         DD = CC;
 158         CC = BB;
 159         BB = AA;
 160         AA = T1 + T2;
 161     }
 162
 163     A += AA;
 164     B += BB;
 165     C += CC;
 166     D += DD;
 167     E += EE;
 168     F += FF;
 169     G += GG;
 170     H += HH;
 171 }
 172
 173 /*
 174  * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
 175  */
 176
 177 #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
 178 static inline uint64_t
 179 swap_uint64_t (uint64_t t)
 180 {
 181     uint64_t temp;
 182
 183     temp   = cshift64(t, 32);
 184     temp = ((temp & 0xff00ff00ff00ff00ULL) >> 8) |
 185            ((temp & 0x00ff00ff00ff00ffULL) << 8);
 186     return ((temp & 0xffff0000ffff0000ULL) >> 16) |
 187            ((temp & 0x0000ffff0000ffffULL) << 16);
 188 }
 189
 190 struct x64{
 191     uint64_t a;
 192     uint64_t b;
 193 };
 194 #endif
 195
 196 void
 197 samba_SHA512_Update (SHA512_CTX *m, const void *v, size_t len)
 198 {
 199     const unsigned char *p = v;
 200     size_t old_sz = m->sz[0];
 201     size_t offset;
 202
 203     m->sz[0] += len * 8;
 204     if (m->sz[0] < old_sz)
 205         ++m->sz[1];
 206     offset = (old_sz / 8) % 128;
 207     while(len > 0){
 208         size_t l = min(len, 128 - offset);
 209         memcpy(m->save + offset, p, l);
 210         offset += l;
 211         p += l;
 212         len -= l;
 213         if(offset == 128){
 214 #if !defined(WORDS_BIGENDIAN) || defined(_CRAY)
 215             int i;
 216             uint64_t current[16];
 217             struct x64 *us = (struct x64*)m->save;
 218             for(i = 0; i < 8; i++){
 219                 current[2*i+0] = swap_uint64_t(us[i].a);
 220                 current[2*i+1] = swap_uint64_t(us[i].b);
 221             }
 222             calc(m, current);
 223 #else
 224             calc(m, (uint64_t*)m->save);
 225 #endif
 226             offset = 0;
 227         }
 228     }
 229 }
 230
 231 void
 232 samba_SHA512_Final (void *res, SHA512_CTX *m)
 233 {
 234     unsigned char zeros[128 + 16];
 235     unsigned offset = (m->sz[0] / 8) % 128;
 236     unsigned int dstart = (240 - offset - 1) % 128 + 1;
 237
 238     *zeros = 0x80;
 239     memset (zeros + 1, 0, sizeof(zeros) - 1);
 240     zeros[dstart+15] = (m->sz[0] >> 0) & 0xff;
 241     zeros[dstart+14] = (m->sz[0] >> 8) & 0xff;
 242     zeros[dstart+13] = (m->sz[0] >> 16) & 0xff;
 243     zeros[dstart+12] = (m->sz[0] >> 24) & 0xff;
 244     zeros[dstart+11] = (m->sz[0] >> 32) & 0xff;
 245     zeros[dstart+10] = (m->sz[0] >> 40) & 0xff;
 246     zeros[dstart+9]  = (m->sz[0] >> 48) & 0xff;
 247     zeros[dstart+8]  = (m->sz[0] >> 56) & 0xff;
 248
 249     zeros[dstart+7] = (m->sz[1] >> 0) & 0xff;
 250     zeros[dstart+6] = (m->sz[1] >> 8) & 0xff;
 251     zeros[dstart+5] = (m->sz[1] >> 16) & 0xff;
 252     zeros[dstart+4] = (m->sz[1] >> 24) & 0xff;
 253     zeros[dstart+3] = (m->sz[1] >> 32) & 0xff;
 254     zeros[dstart+2] = (m->sz[1] >> 40) & 0xff;
 255     zeros[dstart+1] = (m->sz[1] >> 48) & 0xff;
 256     zeros[dstart+0] = (m->sz[1] >> 56) & 0xff;
 257     samba_SHA512_Update (m, zeros, dstart + 16);
 258     {
 259         int i;
 260         unsigned char *r = (unsigned char*)res;
 261
 262         for (i = 0; i < 8; ++i) {
 263             r[8*i+7] = m->counter[i] & 0xFF;
 264             r[8*i+6] = (m->counter[i] >> 8) & 0xFF;
 265             r[8*i+5] = (m->counter[i] >> 16) & 0xFF;
 266             r[8*i+4] = (m->counter[i] >> 24) & 0xFF;
 267             r[8*i+3] = (m->counter[i] >> 32) & 0XFF;
 268             r[8*i+2] = (m->counter[i] >> 40) & 0xFF;
 269             r[8*i+1] = (m->counter[i] >> 48) & 0xFF;
 270             r[8*i]   = (m->counter[i] >> 56) & 0xFF;
 271         }
 272     }
 273 }