Merge branch 'master' of ssh://crater.dragonflybsd.org/repository/git/dragonfly
[dragonfly.git] / sys / crypto / sha1.c
blob396c8cac25ea2c2976b2f19fa818634dacf4bdaa
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.
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.
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.
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>
38 #include <sys/types.h>
39 #include <sys/cdefs.h>
40 #include <sys/time.h>
41 #include <sys/systm.h>
43 #include <crypto/sha1.h>
45 /* sanity check */
46 #if BYTE_ORDER != BIG_ENDIAN
47 # if BYTE_ORDER != LITTLE_ENDIAN
48 # define unsupported 1
49 # endif
50 #endif
52 #ifndef unsupported
54 /* constant table */
55 static u_int32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
56 #define K(t) _K[(t) / 20]
58 #define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
59 #define F1(b, c, d) (((b) ^ (c)) ^ (d))
60 #define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
61 #define F3(b, c, d) (((b) ^ (c)) ^ (d))
63 #define S(n, x) (((x) << (n)) | ((x) >> (32 - n)))
65 #define H(n) (ctxt->h.b32[(n)])
66 #define COUNT (ctxt->count)
67 #define BCOUNT (ctxt->c.b64[0] / 8)
68 #define W(n) (ctxt->m.b32[(n)])
70 #define PUTBYTE(x) { \
71 ctxt->m.b8[(COUNT % 64)] = (x); \
72 COUNT++; \
73 COUNT %= 64; \
74 ctxt->c.b64[0] += 8; \
75 if (COUNT % 64 == 0) \
76 sha1_step(ctxt); \
79 #define PUTPAD(x) { \
80 ctxt->m.b8[(COUNT % 64)] = (x); \
81 COUNT++; \
82 COUNT %= 64; \
83 if (COUNT % 64 == 0) \
84 sha1_step(ctxt); \
87 static void sha1_step(struct sha1_ctxt *);
89 static void
90 sha1_step(struct sha1_ctxt *ctxt)
92 u_int32_t a, b, c, d, e;
93 size_t t, s;
94 u_int32_t tmp;
96 #if BYTE_ORDER == LITTLE_ENDIAN
97 struct sha1_ctxt tctxt;
98 bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
99 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
100 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
101 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
102 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
103 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
104 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
105 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
106 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
107 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
108 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
109 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
110 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
111 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
112 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
113 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
114 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
115 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
116 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
117 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
118 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
119 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
120 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
121 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
122 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
123 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
124 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
125 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
126 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
127 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
128 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
129 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
130 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
131 #endif
133 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
135 for (t = 0; t < 20; t++) {
136 s = t & 0x0f;
137 if (t >= 16) {
138 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
140 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
141 e = d; d = c; c = S(30, b); b = a; a = tmp;
143 for (t = 20; t < 40; t++) {
144 s = t & 0x0f;
145 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
146 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
147 e = d; d = c; c = S(30, b); b = a; a = tmp;
149 for (t = 40; t < 60; t++) {
150 s = t & 0x0f;
151 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
152 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
153 e = d; d = c; c = S(30, b); b = a; a = tmp;
155 for (t = 60; t < 80; t++) {
156 s = t & 0x0f;
157 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
158 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
159 e = d; d = c; c = S(30, b); b = a; a = tmp;
162 H(0) = H(0) + a;
163 H(1) = H(1) + b;
164 H(2) = H(2) + c;
165 H(3) = H(3) + d;
166 H(4) = H(4) + e;
168 bzero(&ctxt->m.b8[0], 64);
171 /*------------------------------------------------------------*/
173 void
174 sha1_init(struct sha1_ctxt *ctxt)
176 bzero(ctxt, sizeof(struct sha1_ctxt));
177 H(0) = 0x67452301;
178 H(1) = 0xefcdab89;
179 H(2) = 0x98badcfe;
180 H(3) = 0x10325476;
181 H(4) = 0xc3d2e1f0;
184 void
185 sha1_pad(struct sha1_ctxt *ctxt)
187 size_t padlen; /*pad length in bytes*/
188 size_t padstart;
190 PUTPAD(0x80);
192 padstart = COUNT % 64;
193 padlen = 64 - padstart;
194 if (padlen < 8) {
195 bzero(&ctxt->m.b8[padstart], padlen);
196 COUNT += padlen;
197 COUNT %= 64;
198 sha1_step(ctxt);
199 padstart = COUNT % 64; /* should be 0 */
200 padlen = 64 - padstart; /* should be 64 */
202 bzero(&ctxt->m.b8[padstart], padlen - 8);
203 COUNT += (padlen - 8);
204 COUNT %= 64;
205 #if BYTE_ORDER == BIG_ENDIAN
206 PUTPAD(ctxt->c.b8[0]); PUTPAD(ctxt->c.b8[1]);
207 PUTPAD(ctxt->c.b8[2]); PUTPAD(ctxt->c.b8[3]);
208 PUTPAD(ctxt->c.b8[4]); PUTPAD(ctxt->c.b8[5]);
209 PUTPAD(ctxt->c.b8[6]); PUTPAD(ctxt->c.b8[7]);
210 #else
211 PUTPAD(ctxt->c.b8[7]); PUTPAD(ctxt->c.b8[6]);
212 PUTPAD(ctxt->c.b8[5]); PUTPAD(ctxt->c.b8[4]);
213 PUTPAD(ctxt->c.b8[3]); PUTPAD(ctxt->c.b8[2]);
214 PUTPAD(ctxt->c.b8[1]); PUTPAD(ctxt->c.b8[0]);
215 #endif
218 void
219 sha1_loop(struct sha1_ctxt *ctxt, const u_int8_t *input, size_t len)
221 size_t gaplen;
222 size_t gapstart;
223 size_t off;
224 size_t copysiz;
226 off = 0;
228 while (off < len) {
229 gapstart = COUNT % 64;
230 gaplen = 64 - gapstart;
232 copysiz = (gaplen < len - off) ? gaplen : len - off;
233 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
234 COUNT += copysiz;
235 COUNT %= 64;
236 ctxt->c.b64[0] += copysiz * 8;
237 if (COUNT % 64 == 0)
238 sha1_step(ctxt);
239 off += copysiz;
243 void
244 sha1_result(struct sha1_ctxt *ctxt, caddr_t digest0)
246 u_int8_t *digest;
248 digest = (u_int8_t *)digest0;
249 sha1_pad(ctxt);
250 #if BYTE_ORDER == BIG_ENDIAN
251 bcopy(&ctxt->h.b8[0], digest, 20);
252 #else
253 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
254 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
255 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
256 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
257 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
258 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
259 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
260 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
261 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
262 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
263 #endif
266 #endif /*unsupported*/