2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the project nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * FIPS pub 180-1: Secure Hash Algorithm (SHA-1)
31 * based on: http://csrc.nist.gov/fips/fip180-1.txt
32 * implemented by Jun-ichiro itojun Itoh <itojun@itojun.org>
35 #include <sys/types.h>
36 #include <sys/cdefs.h>
57 #if BYTE_ORDER != BIG_ENDIAN
58 # if BYTE_ORDER != LITTLE_ENDIAN
59 # define unsupported 1
66 static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
67 #define K(t) _K[(t) / 20]
69 #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
70 #define F1(b, c, d) (((b) ^ (c)) ^ (d))
71 #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
72 #define F3(b, c, d) (((b) ^ (c)) ^ (d))
74 #define S(n, x) (((x) << (n)) | ((x) >> (32 - n)))
76 #define H(n) (ctxt->h.b32[(n)])
77 #define COUNT (ctxt->count)
78 #define BCOUNT (ctxt->c.b64[0] / 8)
79 #define W(n) (ctxt->m.b32[(n)])
81 #define PUTBYTE(x) { \
82 ctxt->m.b8[(COUNT % 64)] = (x); \
85 ctxt->c.b64[0] += 8; \
86 if (COUNT % 64 == 0) \
91 ctxt->m.b8[(COUNT % 64)] = (x); \
94 if (COUNT % 64 == 0) \
98 static void sha1_step __P((struct sha1_ctxt *));
101 sha1_step(struct sha1_ctxt *ctxt)
103 u_int32_t a, b, c, d, e;
107 #if BYTE_ORDER == LITTLE_ENDIAN
108 struct sha1_ctxt tctxt;
110 memcpy(&tctxt.m.b8[0], &ctxt->m.b8[0], 64);
111 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
112 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
113 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
114 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
115 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
116 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
117 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
118 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
119 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
120 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
121 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
122 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
123 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
124 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
125 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
126 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
127 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
128 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
129 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
130 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
131 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
132 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
133 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
134 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
135 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
136 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
137 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
138 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
139 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
140 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
141 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
142 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
145 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
147 for (t = 0; t < 20; t++) {
150 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
152 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
153 e = d; d = c; c = S(30, b); b = a; a = tmp;
155 for (t = 20; t < 40; t++) {
157 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
158 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
159 e = d; d = c; c = S(30, b); b = a; a = tmp;
161 for (t = 40; t < 60; t++) {
163 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
164 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
165 e = d; d = c; c = S(30, b); b = a; a = tmp;
167 for (t = 60; t < 80; t++) {
169 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
170 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
171 e = d; d = c; c = S(30, b); b = a; a = tmp;
180 bzero(&ctxt->m.b8[0], 64);
183 /*------------------------------------------------------------*/
186 sha1_init(struct sha1_ctxt *ctxt)
188 bzero(ctxt, sizeof(struct sha1_ctxt));
197 sha1_pad(struct sha1_ctxt *ctxt)
199 size_t padlen; /*pad length in bytes*/
204 padstart = COUNT % 64;
205 padlen = 64 - padstart;
207 bzero(&ctxt->m.b8[padstart], padlen);
211 padstart = COUNT % 64; /* should be 0 */
212 padlen = 64 - padstart; /* should be 64 */
214 bzero(&ctxt->m.b8[padstart], padlen - 8);
215 COUNT += (padlen - 8);
217 #if BYTE_ORDER == BIG_ENDIAN
218 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
219 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
220 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
221 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
223 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
224 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
225 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
226 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
231 sha1_loop(struct sha1_ctxt *ctxt, const u_int8_t *input, size_t len)
241 gapstart = COUNT % 64;
242 gaplen = 64 - gapstart;
244 copysiz = (gaplen < len - off) ? gaplen : len - off;
245 memcpy(&ctxt->m.b8[gapstart], &input[off], copysiz);
248 ctxt->c.b64[0] += copysiz * 8;
256 sha1_result(struct sha1_ctxt *ctxt, caddr_t digest0)
260 digest = (u_int8_t *)digest0;
262 #if BYTE_ORDER == BIG_ENDIAN
263 memcpy(digest, &ctxt->h.b8[0], 20);
265 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
266 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
267 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
268 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
269 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
270 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
271 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
272 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
273 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
274 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
279 * This should look and work like the libcrypto implementation
283 SHA1(const unsigned char *d, size_t n, unsigned char *md)
285 struct sha1_ctxt ctx;
288 sha1_loop(&ctx, d, n);
289 sha1_result(&ctx, (caddr_t)md);
294 #endif /*unsupported*/