sys/crypto/sha1.c

   1 /*      $FreeBSD: src/sys/crypto/sha1.c,v 1.2.2.4 2001/07/03 11:01:27 ume Exp $ */
   2 /*      $DragonFly: src/sys/crypto/sha1.c,v 1.4 2008/03/01 22:03:12 swildner Exp $      */
   3 /*      $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $    */
   4
   5 /*
   6  * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
   7  * All rights reserved.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted provided that the following conditions
  11  * are met:
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  * 2. Redistributions in binary form must reproduce the above copyright
  15  *    notice, this list of conditions and the following disclaimer in the
  16  *    documentation and/or other materials provided with the distribution.
  17  * 3. Neither the name of the project 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 PROJECT 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 PROJECT 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  * FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
  35  * based on: http://csrc.nist.gov/fips/fip180-1.txt
  36  * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
  37  */
  38
  39 #include <sys/types.h>
  40 #include <sys/cdefs.h>
  41 #include <sys/time.h>
  42 #include <sys/systm.h>
  43
  44 #include <crypto/sha1.h>
  45
  46 /* sanity check */
  47 #if BYTE_ORDER != BIG_ENDIAN
  48 # if BYTE_ORDER != LITTLE_ENDIAN
  49 #  define unsupported 1
  50 # endif
  51 #endif
  52
  53 #ifndef unsupported
  54
  55 /* constant table */
  56 static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
  57 #define K(t)    _K[(t) / 20]
  58
  59 #define F0(b, c, d)     (((b) & (c)) | ((~(b)) & (d)))
  60 #define F1(b, c, d)     (((b) ^ (c)) ^ (d))
  61 #define F2(b, c, d)     (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
  62 #define F3(b, c, d)     (((b) ^ (c)) ^ (d))
  63
  64 #define S(n, x)         (((x) << (n)) | ((x) >> (32 - n)))
  65
  66 #define H(n)    (ctxt->h.b32[(n)])
  67 #define COUNT   (ctxt->count)
  68 #define BCOUNT  (ctxt->c.b64[0] / 8)
  69 #define W(n)    (ctxt->m.b32[(n)])
  70
  71 #define PUTBYTE(x)      { \
  72         ctxt->m.b8[(COUNT % 64)] = (x);         \
  73         COUNT++;                                \
  74         COUNT %= 64;                            \
  75         ctxt->c.b64[0] += 8;                    \
  76         if (COUNT % 64 == 0)                    \
  77                 sha1_step(ctxt);                \
  78      }
  79
  80 #define PUTPAD(x)       { \
  81         ctxt->m.b8[(COUNT % 64)] = (x);         \
  82         COUNT++;                                \
  83         COUNT %= 64;                            \
  84         if (COUNT % 64 == 0)                    \
  85                 sha1_step(ctxt);                \
  86      }
  87
  88 static void sha1_step (struct sha1_ctxt *);
  89
  90 static void
  91 sha1_step(struct sha1_ctxt *ctxt)
  92 {
  93         u_int32_t       a, b, c, d, e;
  94         size_t t, s;
  95         u_int32_t       tmp;
  96
  97 #if BYTE_ORDER == LITTLE_ENDIAN
  98         struct sha1_ctxt tctxt;
  99         bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
 100         ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
 101         ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
 102         ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
 103         ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
 104         ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
 105         ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
 106         ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
 107         ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
 108         ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
 109         ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
 110         ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
 111         ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
 112         ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
 113         ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
 114         ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
 115         ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
 116         ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
 117         ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
 118         ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
 119         ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
 120         ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
 121         ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
 122         ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
 123         ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
 124         ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
 125         ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
 126         ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
 127         ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
 128         ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
 129         ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
 130         ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
 131         ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
 132 #endif
 133
 134         a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
 135
 136         for (t = 0; t < 20; t++) {
 137                 s = t & 0x0f;
 138                 if (t >= 16) {
 139                         W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
 140                 }
 141                 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
 142                 e = d; d = c; c = S(30, b); b = a; a = tmp;
 143         }
 144         for (t = 20; t < 40; t++) {
 145                 s = t & 0x0f;
 146                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
 147                 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
 148                 e = d; d = c; c = S(30, b); b = a; a = tmp;
 149         }
 150         for (t = 40; t < 60; t++) {
 151                 s = t & 0x0f;
 152                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
 153                 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
 154                 e = d; d = c; c = S(30, b); b = a; a = tmp;
 155         }
 156         for (t = 60; t < 80; t++) {
 157                 s = t & 0x0f;
 158                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
 159                 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
 160                 e = d; d = c; c = S(30, b); b = a; a = tmp;
 161         }
 162
 163         H(0) = H(0) + a;
 164         H(1) = H(1) + b;
 165         H(2) = H(2) + c;
 166         H(3) = H(3) + d;
 167         H(4) = H(4) + e;
 168
 169         bzero(&ctxt->m.b8[0], 64);
 170 }
 171
 172 /*------------------------------------------------------------*/
 173
 174 void
 175 sha1_init(struct sha1_ctxt *ctxt)
 176 {
 177         bzero(ctxt, sizeof(struct sha1_ctxt));
 178         H(0) = 0x67452301;
 179         H(1) = 0xefcdab89;
 180         H(2) = 0x98badcfe;
 181         H(3) = 0x10325476;
 182         H(4) = 0xc3d2e1f0;
 183 }
 184
 185 void
 186 sha1_pad(struct sha1_ctxt *ctxt)
 187 {
 188         size_t padlen;          /*pad length in bytes*/
 189         size_t padstart;
 190
 191         PUTPAD(0x80);
 192
 193         padstart = COUNT % 64;
 194         padlen = 64 - padstart;
 195         if (padlen < 8) {
 196                 bzero(&ctxt->m.b8[padstart], padlen);
 197                 COUNT += padlen;
 198                 COUNT %= 64;
 199                 sha1_step(ctxt);
 200                 padstart = COUNT % 64;  /* should be 0 */
 201                 padlen = 64 - padstart; /* should be 64 */
 202         }
 203         bzero(&ctxt->m.b8[padstart], padlen - 8);
 204         COUNT += (padlen - 8);
 205         COUNT %= 64;
 206 #if BYTE_ORDER == BIG_ENDIAN
 207         PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
 208         PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
 209         PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
 210         PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
 211 #else
 212         PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
 213         PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
 214         PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
 215         PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
 216 #endif
 217 }
 218
 219 void
 220 sha1_loop(struct sha1_ctxt *ctxt, const u_int8_t *input, size_t len)
 221 {
 222         size_t gaplen;
 223         size_t gapstart;
 224         size_t off;
 225         size_t copysiz;
 226
 227         off = 0;
 228
 229         while (off < len) {
 230                 gapstart = COUNT % 64;
 231                 gaplen = 64 - gapstart;
 232
 233                 copysiz = (gaplen < len - off) ? gaplen : len - off;
 234                 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
 235                 COUNT += copysiz;
 236                 COUNT %= 64;
 237                 ctxt->c.b64[0] += copysiz * 8;
 238                 if (COUNT % 64 == 0)
 239                         sha1_step(ctxt);
 240                 off += copysiz;
 241         }
 242 }
 243
 244 void
 245 sha1_result(struct sha1_ctxt *ctxt, caddr_t digest0)
 246 {
 247         u_int8_t *digest;
 248
 249         digest = (u_int8_t *)digest0;
 250         sha1_pad(ctxt);
 251 #if BYTE_ORDER == BIG_ENDIAN
 252         bcopy(&ctxt->h.b8[0], digest, 20);
 253 #else
 254         digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
 255         digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
 256         digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
 257         digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
 258         digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
 259         digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
 260         digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
 261         digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
 262         digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
 263         digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
 264 #endif
 265 }
 266
 267 #endif /*unsupported*/