FreeBSD kernel crypto code
sha1.c
Go to the documentation of this file.
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__FBSDID("$FreeBSD$");
41
42#include <sys/types.h>
43#include <sys/cdefs.h>
44#include <sys/time.h>
45#include <sys/systm.h>
46
47#include <crypto/sha1.h>
48
49/* sanity check */
50#if BYTE_ORDER != BIG_ENDIAN
51# if BYTE_ORDER != LITTLE_ENDIAN
52# define unsupported 1
53# endif
54#endif
55
56#ifndef unsupported
57
58/* constant table */
59static uint32_t _K[] = { 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xca62c1d6 };
60#define K(t) _K[(t) / 20]
61
62#define F0(b, c, d) (((b) & (c)) | ((~(b)) & (d)))
63#define F1(b, c, d) (((b) ^ (c)) ^ (d))
64#define F2(b, c, d) (((b) & (c)) | ((b) & (d)) | ((c) & (d)))
65#define F3(b, c, d) (((b) ^ (c)) ^ (d))
66
67#define S(n, x) (((x) << (n)) | ((x) >> (32 - n)))
68
69#define H(n) (ctxt->h.b32[(n)])
70#define COUNT (ctxt->count)
71#define BCOUNT (ctxt->c.b64[0] / 8)
72#define W(n) (ctxt->m.b32[(n)])
73
74#define PUTBYTE(x) { \
75 ctxt->m.b8[(COUNT % 64)] = (x); \
76 COUNT++; \
77 COUNT %= 64; \
78 ctxt->c.b64[0] += 8; \
79 if (COUNT % 64 == 0) \
80 sha1_step(ctxt); \
81 }
82
83#define PUTPAD(x) { \
84 ctxt->m.b8[(COUNT % 64)] = (x); \
85 COUNT++; \
86 COUNT %= 64; \
87 if (COUNT % 64 == 0) \
88 sha1_step(ctxt); \
89 }
90
91static void sha1_step(struct sha1_ctxt *);
92
93static void
94sha1_step(struct sha1_ctxt *ctxt)
95{
96 uint32_t a, b, c, d, e;
97 size_t t, s;
98 uint32_t tmp;
99
100#if BYTE_ORDER == LITTLE_ENDIAN
101 struct sha1_ctxt tctxt;
102 bcopy(&ctxt->m.b8[0], &tctxt.m.b8[0], 64);
103 ctxt->m.b8[0] = tctxt.m.b8[3]; ctxt->m.b8[1] = tctxt.m.b8[2];
104 ctxt->m.b8[2] = tctxt.m.b8[1]; ctxt->m.b8[3] = tctxt.m.b8[0];
105 ctxt->m.b8[4] = tctxt.m.b8[7]; ctxt->m.b8[5] = tctxt.m.b8[6];
106 ctxt->m.b8[6] = tctxt.m.b8[5]; ctxt->m.b8[7] = tctxt.m.b8[4];
107 ctxt->m.b8[8] = tctxt.m.b8[11]; ctxt->m.b8[9] = tctxt.m.b8[10];
108 ctxt->m.b8[10] = tctxt.m.b8[9]; ctxt->m.b8[11] = tctxt.m.b8[8];
109 ctxt->m.b8[12] = tctxt.m.b8[15]; ctxt->m.b8[13] = tctxt.m.b8[14];
110 ctxt->m.b8[14] = tctxt.m.b8[13]; ctxt->m.b8[15] = tctxt.m.b8[12];
111 ctxt->m.b8[16] = tctxt.m.b8[19]; ctxt->m.b8[17] = tctxt.m.b8[18];
112 ctxt->m.b8[18] = tctxt.m.b8[17]; ctxt->m.b8[19] = tctxt.m.b8[16];
113 ctxt->m.b8[20] = tctxt.m.b8[23]; ctxt->m.b8[21] = tctxt.m.b8[22];
114 ctxt->m.b8[22] = tctxt.m.b8[21]; ctxt->m.b8[23] = tctxt.m.b8[20];
115 ctxt->m.b8[24] = tctxt.m.b8[27]; ctxt->m.b8[25] = tctxt.m.b8[26];
116 ctxt->m.b8[26] = tctxt.m.b8[25]; ctxt->m.b8[27] = tctxt.m.b8[24];
117 ctxt->m.b8[28] = tctxt.m.b8[31]; ctxt->m.b8[29] = tctxt.m.b8[30];
118 ctxt->m.b8[30] = tctxt.m.b8[29]; ctxt->m.b8[31] = tctxt.m.b8[28];
119 ctxt->m.b8[32] = tctxt.m.b8[35]; ctxt->m.b8[33] = tctxt.m.b8[34];
120 ctxt->m.b8[34] = tctxt.m.b8[33]; ctxt->m.b8[35] = tctxt.m.b8[32];
121 ctxt->m.b8[36] = tctxt.m.b8[39]; ctxt->m.b8[37] = tctxt.m.b8[38];
122 ctxt->m.b8[38] = tctxt.m.b8[37]; ctxt->m.b8[39] = tctxt.m.b8[36];
123 ctxt->m.b8[40] = tctxt.m.b8[43]; ctxt->m.b8[41] = tctxt.m.b8[42];
124 ctxt->m.b8[42] = tctxt.m.b8[41]; ctxt->m.b8[43] = tctxt.m.b8[40];
125 ctxt->m.b8[44] = tctxt.m.b8[47]; ctxt->m.b8[45] = tctxt.m.b8[46];
126 ctxt->m.b8[46] = tctxt.m.b8[45]; ctxt->m.b8[47] = tctxt.m.b8[44];
127 ctxt->m.b8[48] = tctxt.m.b8[51]; ctxt->m.b8[49] = tctxt.m.b8[50];
128 ctxt->m.b8[50] = tctxt.m.b8[49]; ctxt->m.b8[51] = tctxt.m.b8[48];
129 ctxt->m.b8[52] = tctxt.m.b8[55]; ctxt->m.b8[53] = tctxt.m.b8[54];
130 ctxt->m.b8[54] = tctxt.m.b8[53]; ctxt->m.b8[55] = tctxt.m.b8[52];
131 ctxt->m.b8[56] = tctxt.m.b8[59]; ctxt->m.b8[57] = tctxt.m.b8[58];
132 ctxt->m.b8[58] = tctxt.m.b8[57]; ctxt->m.b8[59] = tctxt.m.b8[56];
133 ctxt->m.b8[60] = tctxt.m.b8[63]; ctxt->m.b8[61] = tctxt.m.b8[62];
134 ctxt->m.b8[62] = tctxt.m.b8[61]; ctxt->m.b8[63] = tctxt.m.b8[60];
135#endif
136
137 a = H(0); b = H(1); c = H(2); d = H(3); e = H(4);
138
139 for (t = 0; t < 20; t++) {
140 s = t & 0x0f;
141 if (t >= 16) {
142 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
143 }
144 tmp = S(5, a) + F0(b, c, d) + e + W(s) + K(t);
145 e = d; d = c; c = S(30, b); b = a; a = tmp;
146 }
147 for (t = 20; t < 40; t++) {
148 s = t & 0x0f;
149 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
150 tmp = S(5, a) + F1(b, c, d) + e + W(s) + K(t);
151 e = d; d = c; c = S(30, b); b = a; a = tmp;
152 }
153 for (t = 40; t < 60; t++) {
154 s = t & 0x0f;
155 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
156 tmp = S(5, a) + F2(b, c, d) + e + W(s) + K(t);
157 e = d; d = c; c = S(30, b); b = a; a = tmp;
158 }
159 for (t = 60; t < 80; t++) {
160 s = t & 0x0f;
161 W(s) = S(1, W((s+13) & 0x0f) ^ W((s+8) & 0x0f) ^ W((s+2) & 0x0f) ^ W(s));
162 tmp = S(5, a) + F3(b, c, d) + e + W(s) + K(t);
163 e = d; d = c; c = S(30, b); b = a; a = tmp;
164 }
165
166 H(0) = H(0) + a;
167 H(1) = H(1) + b;
168 H(2) = H(2) + c;
169 H(3) = H(3) + d;
170 H(4) = H(4) + e;
171
172 bzero(&ctxt->m.b8[0], 64);
173}
174
175/*------------------------------------------------------------*/
176
177void
178sha1_init(struct sha1_ctxt *ctxt)
179{
180 bzero(ctxt, sizeof(struct sha1_ctxt));
181 H(0) = 0x67452301;
182 H(1) = 0xefcdab89;
183 H(2) = 0x98badcfe;
184 H(3) = 0x10325476;
185 H(4) = 0xc3d2e1f0;
186}
187
188void
189sha1_pad(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(struct sha1_ctxt *ctxt, const uint8_t *input, size_t len)
224{
225 size_t gaplen;
226 size_t gapstart;
227 size_t off;
228 size_t copysiz;
229
230 off = 0;
231
232 while (off < len) {
233 gapstart = COUNT % 64;
234 gaplen = 64 - gapstart;
235
236 copysiz = (gaplen < len - off) ? gaplen : len - off;
237 bcopy(&input[off], &ctxt->m.b8[gapstart], copysiz);
238 COUNT += copysiz;
239 COUNT %= 64;
240 ctxt->c.b64[0] += copysiz * 8;
241 if (COUNT % 64 == 0)
242 sha1_step(ctxt);
243 off += copysiz;
244 }
245}
246
247void
248sha1_result(struct sha1_ctxt *ctxt, char digest0[static SHA1_RESULTLEN])
249{
250 uint8_t *digest;
251
252 digest = (uint8_t *)digest0;
253 sha1_pad(ctxt);
254#if BYTE_ORDER == BIG_ENDIAN
255 bcopy(&ctxt->h.b8[0], digest, SHA1_RESULTLEN);
256#else
257 digest[0] = ctxt->h.b8[3]; digest[1] = ctxt->h.b8[2];
258 digest[2] = ctxt->h.b8[1]; digest[3] = ctxt->h.b8[0];
259 digest[4] = ctxt->h.b8[7]; digest[5] = ctxt->h.b8[6];
260 digest[6] = ctxt->h.b8[5]; digest[7] = ctxt->h.b8[4];
261 digest[8] = ctxt->h.b8[11]; digest[9] = ctxt->h.b8[10];
262 digest[10] = ctxt->h.b8[9]; digest[11] = ctxt->h.b8[8];
263 digest[12] = ctxt->h.b8[15]; digest[13] = ctxt->h.b8[14];
264 digest[14] = ctxt->h.b8[13]; digest[15] = ctxt->h.b8[12];
265 digest[16] = ctxt->h.b8[19]; digest[17] = ctxt->h.b8[18];
266 digest[18] = ctxt->h.b8[17]; digest[19] = ctxt->h.b8[16];
267#endif
268}
269
270#endif /*unsupported*/
sha1_result
void sha1_result(struct sha1_ctxt *ctxt, char digest0[static SHA1_RESULTLEN])
Definition: sha1.c:248
F2
#define F2(b, c, d)
Definition: sha1.c:64
sha1_step
static void sha1_step(struct sha1_ctxt *)
Definition: sha1.c:94
sha1_pad
void sha1_pad(struct sha1_ctxt *ctxt)
Definition: sha1.c:189
sha1_loop
void sha1_loop(struct sha1_ctxt *ctxt, const uint8_t *input, size_t len)
Definition: sha1.c:223
F1
#define F1(b, c, d)
Definition: sha1.c:63
F3
#define F3(b, c, d)
Definition: sha1.c:65
_K
static uint32_t _K[]
Definition: sha1.c:59
F0
#define F0(b, c, d)
Definition: sha1.c:62
COUNT
#define COUNT
Definition: sha1.c:70
K
#define K(t)
Definition: sha1.c:60
__FBSDID
__FBSDID("$FreeBSD$")
W
#define W(n)
Definition: sha1.c:72
H
#define H(n)
Definition: sha1.c:69
sha1_init
void sha1_init(struct sha1_ctxt *ctxt)
Definition: sha1.c:178
PUTPAD
#define PUTPAD(x)
Definition: sha1.c:83
S
#define S(n, x)
Definition: sha1.c:67
SHA1_RESULTLEN
#define SHA1_RESULTLEN
Definition: sha1.h:60
sha1_ctxt
Definition: sha1.h:43
sha1_ctxt::m
union sha1_ctxt::@21 m
sha1_ctxt::b8
uint8_t b8[20]
Definition: sha1.h:45
sha1_ctxt::h
union sha1_ctxt::@19 h
sha1_ctxt::c
union sha1_ctxt::@20 c
sha1_ctxt::b64
uint64_t b64[1]
Definition: sha1.h:50