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