Merge from vendor branch TNFTP:
[dragonfly.git] / sys / crypto / sha1.c
CommitLineData
984263bc 1/* $FreeBSD: src/sys/crypto/sha1.c,v 1.2.2.4 2001/07/03 11:01:27 ume Exp $ */
a6236b1a 2/* $DragonFly: src/sys/crypto/sha1.c,v 1.3 2003/08/27 10:59:04 rob Exp $ */
984263bc
MD
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 */
56static 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
a6236b1a 88static void sha1_step (struct sha1_ctxt *);
984263bc
MD
89
90static void
91sha1_step(ctxt)
92 struct sha1_ctxt *ctxt;
93{
94 u_int32_t a, b, c, d, e;
95 size_t t, s;
96 u_int32_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
175void
176sha1_init(ctxt)
177 struct sha1_ctxt *ctxt;
178{
179 bzero(ctxt, sizeof(struct sha1_ctxt));
180 H(0) = 0x67452301;
181 H(1) = 0xefcdab89;
182 H(2) = 0x98badcfe;
183 H(3) = 0x10325476;
184 H(4) = 0xc3d2e1f0;
185}
186
187void
188sha1_pad(ctxt)
189 struct sha1_ctxt *ctxt;
190{
191 size_t padlen; /*pad length in bytes*/
192 size_t padstart;
193
194 PUTPAD(0x80);
195
196 padstart = COUNT % 64;
197 padlen = 64 - padstart;
198 if (padlen < 8) {
199 bzero(&ctxt->m.b8[padstart], padlen);
200 COUNT += padlen;
201 COUNT %= 64;
202 sha1_step(ctxt);
203 padstart = COUNT % 64; /* should be 0 */
204 padlen = 64 - padstart; /* should be 64 */
205 }
206 bzero(&ctxt->m.b8[padstart], padlen - 8);
207 COUNT += (padlen - 8);
208 COUNT %= 64;
209#if BYTE_ORDER == BIG_ENDIAN
210 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
211 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
212 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
213 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
214#else
215 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
216 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
217 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
218 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
219#endif
220}
221
222void
223sha1_loop(ctxt, input, len)
224 struct sha1_ctxt *ctxt;
225 const u_int8_t *input;
226 size_t len;
227{
228 size_t gaplen;
229 size_t gapstart;
230 size_t off;
231 size_t copysiz;
232
233 off = 0;
234
235 while (off < len) {
236 gapstart = COUNT % 64;
237 gaplen = 64 - gapstart;
238
239 copysiz = (gaplen < len - off) ? gaplen : len - off;
240 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
241 COUNT += copysiz;
242 COUNT %= 64;
243 ctxt->c.b64[0] += copysiz * 8;
244 if (COUNT % 64 == 0)
245 sha1_step(ctxt);
246 off += copysiz;
247 }
248}
249
250void
251sha1_result(ctxt, digest0)
252 struct sha1_ctxt *ctxt;
253 caddr_t digest0;
254{
255 u_int8_t *digest;
256
257 digest = (u_int8_t *)digest0;
258 sha1_pad(ctxt);
259#if BYTE_ORDER == BIG_ENDIAN
260 bcopy(&ctxt->h.b8[0], digest, 20);
261#else
262 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
263 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
264 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
265 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
266 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
267 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
268 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
269 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
270 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
271 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
272#endif
273}
274
275#endif /*unsupported*/