xref: /netbsd-src/external/bsd/openldap/dist/libraries/liblutil/sha1.c (revision 549b59ed3ccf0d36d3097190a0db27b770f3a839)
1 /*	$NetBSD: sha1.c,v 1.3 2021/08/14 16:14:58 christos Exp $	*/
2 
3 /* $OpenLDAP$ */
4 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
5  *
6  * Copyright 1998-2021 The OpenLDAP Foundation.
7  * All rights reserved.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted only as authorized by the OpenLDAP
11  * Public License.
12  *
13  * A copy of this license is available in the file LICENSE in the
14  * top-level directory of the distribution or, alternatively, at
15  * <http://www.OpenLDAP.org/license.html>.
16  */
17 /* This work was derived from code developed by Steve Reid and
18  * adapted for use in OpenLDAP by Kurt D. Zeilenga.
19  */
20 
21 
22 /*	Acquired from:
23  *	$OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $	*/
24 /*
25  * SHA-1 in C
26  * By Steve Reid <steve@edmweb.com>
27  * 100% Public Domain
28  *
29  * Test Vectors (from FIPS PUB 180-1)
30  * "abc"
31  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
32  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
33  *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
34  * A million repetitions of "a"
35  *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
36  */
37 /*
38  * This code assumes uint32 is 32 bits and char is 8 bits
39  */
40 
41 #include <sys/cdefs.h>
42 __RCSID("$NetBSD: sha1.c,v 1.3 2021/08/14 16:14:58 christos Exp $");
43 
44 #include "portable.h"
45 #include <ac/param.h>
46 #include <ac/string.h>
47 #include <ac/socket.h>
48 #include <ac/bytes.h>
49 
50 #include "lutil_sha1.h"
51 
52 #ifdef LUTIL_SHA1_BYTES
53 
54 /* undefining this will cause pointer alignment errors */
55 #define SHA1HANDSOFF		/* Copies data before messing with it. */
56 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
57 
58 /*
59  * blk0() and blk() perform the initial expand.
60  * I got the idea of expanding during the round function from SSLeay
61  */
62 #if BYTE_ORDER == LITTLE_ENDIAN
63 # define blk0(i) (block[i] = (rol(block[i],24)&0xFF00FF00) \
64     |(rol(block[i],8)&0x00FF00FF))
65 #else
66 # define blk0(i) block[i]
67 #endif
68 #define blk(i) (block[i&15] = rol(block[(i+13)&15]^block[(i+8)&15] \
69     ^block[(i+2)&15]^block[i&15],1))
70 
71 /*
72  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
73  */
74 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
75 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
76 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
77 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
78 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
79 
80 
81 /*
82  * Hash a single 512-bit block. This is the core of the algorithm.
83  */
84 void
lutil_SHA1Transform(uint32 * state,const unsigned char * buffer)85 lutil_SHA1Transform( uint32 *state, const unsigned char *buffer )
86 {
87     uint32 a, b, c, d, e;
88 
89 #ifdef SHA1HANDSOFF
90     uint32 block[16];
91     (void)AC_MEMCPY(block, buffer, 64);
92 #else
93     uint32 *block = (u_int32 *) buffer;
94 #endif
95 
96     /* Copy context->state[] to working vars */
97     a = state[0];
98     b = state[1];
99     c = state[2];
100     d = state[3];
101     e = state[4];
102 
103     /* 4 rounds of 20 operations each. Loop unrolled. */
104     R0(a,b,c,d,e, 0); R0(e,a,b,c,d, 1); R0(d,e,a,b,c, 2); R0(c,d,e,a,b, 3);
105     R0(b,c,d,e,a, 4); R0(a,b,c,d,e, 5); R0(e,a,b,c,d, 6); R0(d,e,a,b,c, 7);
106     R0(c,d,e,a,b, 8); R0(b,c,d,e,a, 9); R0(a,b,c,d,e,10); R0(e,a,b,c,d,11);
107     R0(d,e,a,b,c,12); R0(c,d,e,a,b,13); R0(b,c,d,e,a,14); R0(a,b,c,d,e,15);
108     R1(e,a,b,c,d,16); R1(d,e,a,b,c,17); R1(c,d,e,a,b,18); R1(b,c,d,e,a,19);
109     R2(a,b,c,d,e,20); R2(e,a,b,c,d,21); R2(d,e,a,b,c,22); R2(c,d,e,a,b,23);
110     R2(b,c,d,e,a,24); R2(a,b,c,d,e,25); R2(e,a,b,c,d,26); R2(d,e,a,b,c,27);
111     R2(c,d,e,a,b,28); R2(b,c,d,e,a,29); R2(a,b,c,d,e,30); R2(e,a,b,c,d,31);
112     R2(d,e,a,b,c,32); R2(c,d,e,a,b,33); R2(b,c,d,e,a,34); R2(a,b,c,d,e,35);
113     R2(e,a,b,c,d,36); R2(d,e,a,b,c,37); R2(c,d,e,a,b,38); R2(b,c,d,e,a,39);
114     R3(a,b,c,d,e,40); R3(e,a,b,c,d,41); R3(d,e,a,b,c,42); R3(c,d,e,a,b,43);
115     R3(b,c,d,e,a,44); R3(a,b,c,d,e,45); R3(e,a,b,c,d,46); R3(d,e,a,b,c,47);
116     R3(c,d,e,a,b,48); R3(b,c,d,e,a,49); R3(a,b,c,d,e,50); R3(e,a,b,c,d,51);
117     R3(d,e,a,b,c,52); R3(c,d,e,a,b,53); R3(b,c,d,e,a,54); R3(a,b,c,d,e,55);
118     R3(e,a,b,c,d,56); R3(d,e,a,b,c,57); R3(c,d,e,a,b,58); R3(b,c,d,e,a,59);
119     R4(a,b,c,d,e,60); R4(e,a,b,c,d,61); R4(d,e,a,b,c,62); R4(c,d,e,a,b,63);
120     R4(b,c,d,e,a,64); R4(a,b,c,d,e,65); R4(e,a,b,c,d,66); R4(d,e,a,b,c,67);
121     R4(c,d,e,a,b,68); R4(b,c,d,e,a,69); R4(a,b,c,d,e,70); R4(e,a,b,c,d,71);
122     R4(d,e,a,b,c,72); R4(c,d,e,a,b,73); R4(b,c,d,e,a,74); R4(a,b,c,d,e,75);
123     R4(e,a,b,c,d,76); R4(d,e,a,b,c,77); R4(c,d,e,a,b,78); R4(b,c,d,e,a,79);
124 
125     /* Add the working vars back into context.state[] */
126     state[0] += a;
127     state[1] += b;
128     state[2] += c;
129     state[3] += d;
130     state[4] += e;
131 
132     /* Wipe variables */
133     a = b = c = d = e = 0;
134 }
135 
136 
137 /*
138  * lutil_SHA1Init - Initialize new context
139  */
140 void
lutil_SHA1Init(lutil_SHA1_CTX * context)141 lutil_SHA1Init( lutil_SHA1_CTX *context )
142 {
143 
144     /* SHA1 initialization constants */
145     context->state[0] = 0x67452301;
146     context->state[1] = 0xEFCDAB89;
147     context->state[2] = 0x98BADCFE;
148     context->state[3] = 0x10325476;
149     context->state[4] = 0xC3D2E1F0;
150     context->count[0] = context->count[1] = 0;
151 }
152 
153 
154 /*
155  * Run your data through this.
156  */
157 void
lutil_SHA1Update(lutil_SHA1_CTX * context,const unsigned char * data,uint32 len)158 lutil_SHA1Update(
159     lutil_SHA1_CTX	*context,
160     const unsigned char	*data,
161     uint32		len
162 )
163 {
164     u_int i, j;
165 
166     j = context->count[0];
167     if ((context->count[0] += len << 3) < j)
168 	context->count[1] += (len>>29)+1;
169     j = (j >> 3) & 63;
170     if ((j + len) > 63) {
171 	(void)AC_MEMCPY(&context->buffer[j], data, (i = 64-j));
172 	lutil_SHA1Transform(context->state, context->buffer);
173 	for ( ; i + 63 < len; i += 64)
174 	    lutil_SHA1Transform(context->state, &data[i]);
175 	j = 0;
176     } else {
177 	i = 0;
178     }
179     (void)AC_MEMCPY(&context->buffer[j], &data[i], len - i);
180 }
181 
182 
183 /*
184  * Add padding and return the message digest.
185  */
186 void
lutil_SHA1Final(unsigned char * digest,lutil_SHA1_CTX * context)187 lutil_SHA1Final( unsigned char *digest, lutil_SHA1_CTX *context )
188 {
189     u_int i;
190     unsigned char finalcount[8];
191 
192     for (i = 0; i < 8; i++) {
193 	finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
194 	 >> ((3-(i & 3)) * 8) ) & 255);	 /* Endian independent */
195     }
196     lutil_SHA1Update(context, (unsigned char *)"\200", 1);
197     while ((context->count[0] & 504) != 448)
198 	lutil_SHA1Update(context, (unsigned char *)"\0", 1);
199     lutil_SHA1Update(context, finalcount, 8);  /* Should cause a SHA1Transform() */
200 
201     if (digest) {
202 	for (i = 0; i < 20; i++)
203 	    digest[i] = (unsigned char)
204 		((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
205     }
206 }
207 
208 
209 /* sha1hl.c
210  * ----------------------------------------------------------------------------
211  * "THE BEER-WARE LICENSE" (Revision 42):
212  * <phk@login.dkuug.dk> wrote this file.  As long as you retain this notice you
213  * can do whatever you want with this stuff. If we meet some day, and you think
214  * this stuff is worth it, you can buy me a beer in return.   Poul-Henning Kamp
215  * ----------------------------------------------------------------------------
216  */
217 
218 #if defined(LIBC_SCCS) && !defined(lint)
219 static char rcsid[] = "$OpenBSD: sha1hl.c,v 1.1 1997/07/12 20:06:03 millert Exp $";
220 #endif /* LIBC_SCCS and not lint */
221 
222 #include <stdio.h>
223 #include <ac/stdlib.h>
224 
225 #include <ac/errno.h>
226 #include <ac/unistd.h>
227 
228 #ifdef HAVE_SYS_FILE_H
229 #include <sys/file.h>
230 #endif
231 
232 #ifdef HAVE_IO_H
233 #include <io.h>
234 #endif
235 
236 #ifdef HAVE_FCNTL_H
237 #include <fcntl.h>
238 #endif
239 
240 
241 /* ARGSUSED */
242 char *
lutil_SHA1End(lutil_SHA1_CTX * ctx,char * buf)243 lutil_SHA1End( lutil_SHA1_CTX *ctx, char *buf )
244 {
245     int i;
246     char *p = buf;
247     unsigned char digest[20];
248     static const char hex[]="0123456789abcdef";
249 
250     if (p == NULL && (p = malloc(41)) == NULL)
251 	return 0;
252 
253     lutil_SHA1Final(digest,ctx);
254     for (i = 0; i < 20; i++) {
255 	p[i + i] = hex[digest[i] >> 4];
256 	p[i + i + 1] = hex[digest[i] & 0x0f];
257     }
258     p[i + i] = '\0';
259     return(p);
260 }
261 
262 char *
lutil_SHA1File(char * filename,char * buf)263 lutil_SHA1File( char *filename, char *buf )
264 {
265     unsigned char buffer[BUFSIZ];
266     lutil_SHA1_CTX ctx;
267     int fd, num, oerrno;
268 
269     lutil_SHA1Init(&ctx);
270 
271     if ((fd = open(filename,O_RDONLY)) < 0)
272 	return(0);
273 
274     while ((num = read(fd, buffer, sizeof(buffer))) > 0)
275 	lutil_SHA1Update(&ctx, buffer, num);
276 
277     oerrno = errno;
278     close(fd);
279     errno = oerrno;
280     return(num < 0 ? 0 : lutil_SHA1End(&ctx, buf));
281 }
282 
283 char *
lutil_SHA1Data(const unsigned char * data,size_t len,char * buf)284 lutil_SHA1Data( const unsigned char *data, size_t len, char *buf )
285 {
286     lutil_SHA1_CTX ctx;
287 
288     lutil_SHA1Init(&ctx);
289     lutil_SHA1Update(&ctx, data, len);
290     return(lutil_SHA1End(&ctx, buf));
291 }
292 
293 #endif
294