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