3 * Copyright 1998-1999 The OpenLDAP Foundation, All Rights Reserved.
4 * COPYING RESTRICTIONS APPLY, see COPYRIGHT file
7 * $OpenBSD: sha1.c,v 1.9 1997/07/23 21:12:32 kstailey Exp $ */
11 * By Steve Reid <steve@edmweb.com>
14 * Test Vectors (from FIPS PUB 180-1)
16 * A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
17 * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
18 * 84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
19 * A million repetitions of "a"
20 * 34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
24 * This code assumes uint32 is 32 bits and char is 8 bits
28 #include <ac/string.h>
30 /* include socket.h to get sys/types.h and/or winsock2.h */
31 #include <ac/socket.h>
35 #include "lutil_sha1.h"
37 #define SHA1HANDSOFF /* Copies data before messing with it. */
38 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
41 * blk0() and blk() perform the initial expand.
42 * I got the idea of expanding during the round function from SSLeay
44 #if BYTE_ORDER == LITTLE_ENDIAN
45 # define blk0(i) (block[i] = (rol(block[i],24)&0xFF00FF00) \
46 |(rol(block[i],8)&0x00FF00FF))
48 # define blk0(i) block[i]
50 #define blk(i) (block[i&15] = rol(block[(i+13)&15]^block[(i+8)&15] \
51 ^block[(i+2)&15]^block[i&15],1))
54 * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
56 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
57 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
58 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
59 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
60 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
64 * Hash a single 512-bit block. This is the core of the algorithm.
67 lutil_SHA1Transform( uint32 *state, const unsigned char *buffer )
73 (void)memcpy(block, buffer, 64);
75 uint32 *block = (u_int32 *) buffer;
78 /* Copy context->state[] to working vars */
85 /* 4 rounds of 20 operations each. Loop unrolled. */
86 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);
87 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);
88 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);
89 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);
90 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);
91 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);
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104 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);
105 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);
107 /* Add the working vars back into context.state[] */
115 a = b = c = d = e = 0;
120 * lutil_SHA1Init - Initialize new context
123 lutil_SHA1Init( lutil_SHA1_CTX *context )
126 /* SHA1 initialization constants */
127 context->state[0] = 0x67452301;
128 context->state[1] = 0xEFCDAB89;
129 context->state[2] = 0x98BADCFE;
130 context->state[3] = 0x10325476;
131 context->state[4] = 0xC3D2E1F0;
132 context->count[0] = context->count[1] = 0;
137 * Run your data through this.
141 lutil_SHA1_CTX *context,
142 const unsigned char *data,
148 j = context->count[0];
149 if ((context->count[0] += len << 3) < j)
150 context->count[1] += (len>>29)+1;
152 if ((j + len) > 63) {
153 (void)memcpy(&context->buffer[j], data, (i = 64-j));
154 lutil_SHA1Transform(context->state, context->buffer);
155 for ( ; i + 63 < len; i += 64)
156 lutil_SHA1Transform(context->state, &data[i]);
161 (void)memcpy(&context->buffer[j], &data[i], len - i);
166 * Add padding and return the message digest.
169 lutil_SHA1Final( unsigned char *digest, lutil_SHA1_CTX *context )
172 unsigned char finalcount[8];
174 for (i = 0; i < 8; i++) {
175 finalcount[i] = (unsigned char)((context->count[(i >= 4 ? 0 : 1)]
176 >> ((3-(i & 3)) * 8) ) & 255); /* Endian independent */
178 lutil_SHA1Update(context, (unsigned char *)"\200", 1);
179 while ((context->count[0] & 504) != 448)
180 lutil_SHA1Update(context, (unsigned char *)"\0", 1);
181 lutil_SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
184 for (i = 0; i < 20; i++)
185 digest[i] = (unsigned char)
186 ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
192 * ----------------------------------------------------------------------------
193 * "THE BEER-WARE LICENSE" (Revision 42):
194 * <phk@login.dkuug.dk> wrote this file. As long as you retain this notice you
195 * can do whatever you want with this stuff. If we meet some day, and you think
196 * this stuff is worth it, you can buy me a beer in return. Poul-Henning Kamp
197 * ----------------------------------------------------------------------------
200 #if defined(LIBC_SCCS) && !defined(lint)
201 static char rcsid[] = "$OpenBSD: sha1hl.c,v 1.1 1997/07/12 20:06:03 millert Exp $";
202 #endif /* LIBC_SCCS and not lint */
205 #include <ac/stdlib.h>
207 #include <ac/errno.h>
208 #include <ac/unistd.h>
210 #ifdef HAVE_SYS_FILE_H
211 #include <sys/file.h>
213 #ifdef HAVE_SYS_UIO_H
228 lutil_SHA1End( lutil_SHA1_CTX *ctx, char *buf )
232 unsigned char digest[20];
233 static const char hex[]="0123456789abcdef";
235 if (p == NULL && (p = malloc(41)) == NULL)
238 lutil_SHA1Final(digest,ctx);
239 for (i = 0; i < 20; i++) {
240 p[i + i] = hex[digest[i] >> 4];
241 p[i + i + 1] = hex[digest[i] & 0x0f];
248 lutil_SHA1File( char *filename, char *buf )
250 unsigned char buffer[BUFSIZ];
254 lutil_SHA1Init(&ctx);
256 if ((fd = open(filename,O_RDONLY)) < 0)
259 while ((num = read(fd, buffer, sizeof(buffer))) > 0)
260 lutil_SHA1Update(&ctx, buffer, num);
265 return(num < 0 ? 0 : lutil_SHA1End(&ctx, buf));
269 lutil_SHA1Data( const unsigned char *data, size_t len, char *buf )
273 lutil_SHA1Init(&ctx);
274 lutil_SHA1Update(&ctx, data, len);
275 return(lutil_SHA1End(&ctx, buf));