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