The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/crypto/sha1.c

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*      $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $    */
    2 /*
    3  * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
    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  * 1. Redistributions of source code must retain the above copyright
   10  *    notice, this list of conditions and the following disclaimer.
   11  * 2. Redistributions in binary form must reproduce the above copyright
   12  *    notice, this list of conditions and the following disclaimer in the
   13  *    documentation and/or other materials provided with the distribution.
   14  * 3. Neither the name of the project nor the names of its contributors
   15  *    may be used to endorse or promote products derived from this software
   16  *    without specific prior written permission.
   17  *
   18  * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
   19  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   20  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   21  * ARE DISCLAIMED.  IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
   22  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   23  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   24  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   25  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   26  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   27  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   28  * SUCH DAMAGE.
   29  */
   30 
   31 /*
   32  * FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
   33  * based on: http://csrc.nist.gov/fips/fip180-1.txt
   34  * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
   35  */
   36 
   37 #include <sys/cdefs.h>
   38 __FBSDID("$FreeBSD: stable/8/sys/crypto/sha1.c 199583 2009-11-20 15:27:52Z jhb $");
   39 
   40 #include <sys/types.h>
   41 #include <sys/cdefs.h>
   42 #include <sys/time.h>
   43 #include <sys/systm.h>
   44 
   45 #include <crypto/sha1.h>
   46 
   47 /* sanity check */
   48 #if BYTE_ORDER != BIG_ENDIAN
   49 # if BYTE_ORDER != LITTLE_ENDIAN
   50 #  define unsupported 1
   51 # endif
   52 #endif
   53 
   54 #ifndef unsupported
   55 
   56 /* constant table */
   57 static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
   58 #define K(t)    _K[(t) / 20]
   59 
   60 #define F0(b, c, d)     (((b) & (c)) | ((~(b)) & (d)))
   61 #define F1(b, c, d)     (((b) ^ (c)) ^ (d))
   62 #define F2(b, c, d)     (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
   63 #define F3(b, c, d)     (((b) ^ (c)) ^ (d))
   64 
   65 #define S(n, x)         (((x) << (n)) | ((x) >> (32 - n)))
   66 
   67 #define H(n)    (ctxt->h.b32[(n)])
   68 #define COUNT   (ctxt->count)
   69 #define BCOUNT  (ctxt->c.b64[0] / 8)
   70 #define W(n)    (ctxt->m.b32[(n)])
   71 
   72 #define PUTBYTE(x)      { \
   73         ctxt->m.b8[(COUNT % 64)] = (x);         \
   74         COUNT++;                                \
   75         COUNT %= 64;                            \
   76         ctxt->c.b64[0] += 8;                    \
   77         if (COUNT % 64 == 0)                    \
   78                 sha1_step(ctxt);                \
   79      }
   80 
   81 #define PUTPAD(x)       { \
   82         ctxt->m.b8[(COUNT % 64)] = (x);         \
   83         COUNT++;                                \
   84         COUNT %= 64;                            \
   85         if (COUNT % 64 == 0)                    \
   86                 sha1_step(ctxt);                \
   87      }
   88 
   89 static void sha1_step(struct sha1_ctxt *);
   90 
   91 static void
   92 sha1_step(ctxt)
   93         struct sha1_ctxt *ctxt;
   94 {
   95         u_int32_t       a, b, c, d, e;
   96         size_t t, s;
   97         u_int32_t       tmp;
   98 
   99 #if BYTE_ORDER == LITTLE_ENDIAN
  100         struct sha1_ctxt tctxt;
  101         bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
  102         ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
  103         ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
  104         ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
  105         ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
  106         ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
  107         ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
  108         ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
  109         ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
  110         ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
  111         ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
  112         ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
  113         ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
  114         ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
  115         ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
  116         ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
  117         ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
  118         ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
  119         ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
  120         ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
  121         ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
  122         ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
  123         ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
  124         ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
  125         ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
  126         ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
  127         ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
  128         ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
  129         ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
  130         ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
  131         ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
  132         ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
  133         ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
  134 #endif
  135 
  136         a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
  137 
  138         for (t = 0; t < 20; t++) {
  139                 s = t & 0x0f;
  140                 if (t >= 16) {
  141                         W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
  142                 }
  143                 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
  144                 e = d; d = c; c = S(30, b); b = a; a = tmp;
  145         }
  146         for (t = 20; t < 40; t++) {
  147                 s = t & 0x0f;
  148                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
  149                 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
  150                 e = d; d = c; c = S(30, b); b = a; a = tmp;
  151         }
  152         for (t = 40; t < 60; t++) {
  153                 s = t & 0x0f;
  154                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
  155                 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
  156                 e = d; d = c; c = S(30, b); b = a; a = tmp;
  157         }
  158         for (t = 60; t < 80; t++) {
  159                 s = t & 0x0f;
  160                 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
  161                 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
  162                 e = d; d = c; c = S(30, b); b = a; a = tmp;
  163         }
  164 
  165         H(0) = H(0) + a;
  166         H(1) = H(1) + b;
  167         H(2) = H(2) + c;
  168         H(3) = H(3) + d;
  169         H(4) = H(4) + e;
  170 
  171         bzero(&ctxt->m.b8[0], 64);
  172 }
  173 
  174 /*------------------------------------------------------------*/
  175 
  176 void
  177 sha1_init(ctxt)
  178         struct sha1_ctxt *ctxt;
  179 {
  180         bzero(ctxt, sizeof(struct sha1_ctxt));
  181         H(0) = 0x67452301;
  182         H(1) = 0xefcdab89;
  183         H(2) = 0x98badcfe;
  184         H(3) = 0x10325476;
  185         H(4) = 0xc3d2e1f0;
  186 }
  187 
  188 void
  189 sha1_pad(ctxt)
  190         struct sha1_ctxt *ctxt;
  191 {
  192         size_t padlen;          /*pad length in bytes*/
  193         size_t padstart;
  194 
  195         PUTPAD(0x80);
  196 
  197         padstart = COUNT % 64;
  198         padlen = 64 - padstart;
  199         if (padlen < 8) {
  200                 bzero(&ctxt->m.b8[padstart], padlen);
  201                 COUNT += padlen;
  202                 COUNT %= 64;
  203                 sha1_step(ctxt);
  204                 padstart = COUNT % 64;  /* should be 0 */
  205                 padlen = 64 - padstart; /* should be 64 */
  206         }
  207         bzero(&ctxt->m.b8[padstart], padlen - 8);
  208         COUNT += (padlen - 8);
  209         COUNT %= 64;
  210 #if BYTE_ORDER == BIG_ENDIAN
  211         PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
  212         PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
  213         PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
  214         PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
  215 #else
  216         PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
  217         PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
  218         PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
  219         PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
  220 #endif
  221 }
  222 
  223 void
  224 sha1_loop(ctxt, input, len)
  225         struct sha1_ctxt *ctxt;
  226         const u_int8_t *input;
  227         size_t len;
  228 {
  229         size_t gaplen;
  230         size_t gapstart;
  231         size_t off;
  232         size_t copysiz;
  233 
  234         off = 0;
  235 
  236         while (off < len) {
  237                 gapstart = COUNT % 64;
  238                 gaplen = 64 - gapstart;
  239 
  240                 copysiz = (gaplen < len - off) ? gaplen : len - off;
  241                 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
  242                 COUNT += copysiz;
  243                 COUNT %= 64;
  244                 ctxt->c.b64[0] += copysiz * 8;
  245                 if (COUNT % 64 == 0)
  246                         sha1_step(ctxt);
  247                 off += copysiz;
  248         }
  249 }
  250 
  251 void
  252 sha1_result(ctxt, digest0)
  253         struct sha1_ctxt *ctxt;
  254         caddr_t digest0;
  255 {
  256         u_int8_t *digest;
  257 
  258         digest = (u_int8_t *)digest0;
  259         sha1_pad(ctxt);
  260 #if BYTE_ORDER == BIG_ENDIAN
  261         bcopy(&ctxt->h.b8[0], digest, 20);
  262 #else
  263         digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
  264         digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
  265         digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
  266         digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
  267         digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
  268         digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
  269         digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
  270         digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
  271         digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
  272         digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
  273 #endif
  274 }
  275 
  276 #endif /*unsupported*/

Cache object: 22bea0b7f89bafb8f8f3bcddf184e4a6


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.