1 /* $KAME: sha1.c,v 1.5 2000/11/08 06:13:08 itojun Exp $ */
2 /*-
3 * SPDX-License-Identifier: BSD-3-Clause
4 *
5 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
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 * 3. Neither the name of the project nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
19 *
20 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
30 * SUCH DAMAGE.
31 */
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/cdefs.h>
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 uint32_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
sha1_step(struct sha1_ctxt * ctxt)92 sha1_step(struct sha1_ctxt *ctxt)
93 {
94 uint32_t a, b, c, d, e;
95 size_t t, s;
96 uint32_t tmp;
97
98 #if BYTE_ORDER == LITTLE_ENDIAN
99 struct sha1_ctxt tctxt;
100 bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
101 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
102 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
103 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
104 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
105 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
106 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
107 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
108 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
109 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
110 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
111 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
112 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
113 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
114 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
115 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
116 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
117 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
118 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
119 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
120 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
121 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
122 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
123 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
124 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
125 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
126 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
127 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
128 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
129 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
130 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
131 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
132 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
133 #endif
134
135 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
136
137 for (t = 0; t < 20; t++) {
138 s = t & 0x0f;
139 if (t >= 16) {
140 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
141 }
142 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
143 e = d; d = c; c = S(30, b); b = a; a = tmp;
144 }
145 for (t = 20; t < 40; t++) {
146 s = t & 0x0f;
147 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
148 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
149 e = d; d = c; c = S(30, b); b = a; a = tmp;
150 }
151 for (t = 40; t < 60; t++) {
152 s = t & 0x0f;
153 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
154 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
155 e = d; d = c; c = S(30, b); b = a; a = tmp;
156 }
157 for (t = 60; t < 80; t++) {
158 s = t & 0x0f;
159 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
160 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
161 e = d; d = c; c = S(30, b); b = a; a = tmp;
162 }
163
164 H(0) = H(0) + a;
165 H(1) = H(1) + b;
166 H(2) = H(2) + c;
167 H(3) = H(3) + d;
168 H(4) = H(4) + e;
169
170 bzero(&ctxt->m.b8[0], 64);
171 }
172
173 /*------------------------------------------------------------*/
174
175 void
sha1_init(struct sha1_ctxt * ctxt)176 sha1_init(struct sha1_ctxt *ctxt)
177 {
178 bzero(ctxt, sizeof(struct sha1_ctxt));
179 H(0) = 0x67452301;
180 H(1) = 0xefcdab89;
181 H(2) = 0x98badcfe;
182 H(3) = 0x10325476;
183 H(4) = 0xc3d2e1f0;
184 }
185
186 void
sha1_pad(struct sha1_ctxt * ctxt)187 sha1_pad(struct sha1_ctxt *ctxt)
188 {
189 size_t padlen; /*pad length in bytes*/
190 size_t padstart;
191
192 PUTPAD(0x80);
193
194 padstart = COUNT % 64;
195 padlen = 64 - padstart;
196 if (padlen < 8) {
197 bzero(&ctxt->m.b8[padstart], padlen);
198 COUNT += padlen;
199 COUNT %= 64;
200 sha1_step(ctxt);
201 padstart = COUNT % 64; /* should be 0 */
202 padlen = 64 - padstart; /* should be 64 */
203 }
204 bzero(&ctxt->m.b8[padstart], padlen - 8);
205 COUNT += (padlen - 8);
206 COUNT %= 64;
207 #if BYTE_ORDER == BIG_ENDIAN
208 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
209 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
210 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
211 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
212 #else
213 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
214 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
215 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
216 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
217 #endif
218 }
219
220 void
sha1_loop(struct sha1_ctxt * ctxt,const uint8_t * input,size_t len)221 sha1_loop(struct sha1_ctxt *ctxt, const uint8_t *input, size_t len)
222 {
223 size_t gaplen;
224 size_t gapstart;
225 size_t off;
226 size_t copysiz;
227
228 off = 0;
229
230 while (off < len) {
231 gapstart = COUNT % 64;
232 gaplen = 64 - gapstart;
233
234 copysiz = (gaplen < len - off) ? gaplen : len - off;
235 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
236 COUNT += copysiz;
237 COUNT %= 64;
238 ctxt->c.b64[0] += copysiz * 8;
239 if (COUNT % 64 == 0)
240 sha1_step(ctxt);
241 off += copysiz;
242 }
243 }
244
245 void
sha1_result(struct sha1_ctxt * ctxt,char digest0[static SHA1_RESULTLEN])246 sha1_result(struct sha1_ctxt *ctxt, char digest0[static SHA1_RESULTLEN])
247 {
248 uint8_t *digest;
249
250 digest = (uint8_t *)digest0;
251 sha1_pad(ctxt);
252 #if BYTE_ORDER == BIG_ENDIAN
253 bcopy(&ctxt->h.b8[0], digest, SHA1_RESULTLEN);
254 #else
255 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
256 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
257 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
258 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
259 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
260 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
261 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
262 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
263 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
264 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
265 #endif
266 }
267
268 #endif /*unsupported*/
269