kore

Kore is a web application platform for writing scalable, concurrent web based processes in C or Python.
Commits | Files | Refs | README | LICENSE | git clone https://git.kore.io/kore.git

sha1.c (5268B)



      1 /*	$OpenBSD: sha1.c,v 1.27 2019/06/07 22:56:36 dtucker Exp $	*/
      2 
      3 /*
      4  * SHA-1 in C
      5  * By Steve Reid <steve@edmweb.com>
      6  * 100% Public Domain
      7  *
      8  * Test Vectors (from FIPS PUB 180-1)
      9  * "abc"
     10  *   A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D
     11  * "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq"
     12  *   84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1
     13  * A million repetitions of "a"
     14  *   34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F
     15  */
     16 
     17 #include <sys/types.h>
     18 #include <string.h>
     19 
     20 #include "kore.h"
     21 #include "sha1.h"
     22 
     23 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
     24 
     25 /*
     26  * blk0() and blk() perform the initial expand.
     27  * I got the idea of expanding during the round function from SSLeay
     28  */
     29 #if BYTE_ORDER == LITTLE_ENDIAN
     30 # define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
     31     |(rol(block->l[i],8)&0x00FF00FF))
     32 #else
     33 # define blk0(i) block->l[i]
     34 #endif
     35 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
     36     ^block->l[(i+2)&15]^block->l[i&15],1))
     37 
     38 /*
     39  * (R0+R1), R2, R3, R4 are the different operations (rounds) used in SHA1
     40  */
     41 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk0(i)+0x5A827999+rol(v,5);w=rol(w,30);
     42 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y)+blk(i)+0x5A827999+rol(v,5);w=rol(w,30);
     43 #define R2(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0x6ED9EBA1+rol(v,5);w=rol(w,30);
     44 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk(i)+0x8F1BBCDC+rol(v,5);w=rol(w,30);
     45 #define R4(v,w,x,y,z,i) z+=(w^x^y)+blk(i)+0xCA62C1D6+rol(v,5);w=rol(w,30);
     46 
     47 typedef union {
     48 	u_int8_t c[64];
     49 	u_int32_t l[16];
     50 } CHAR64LONG16;
     51 
     52 /*
     53  * Hash a single 512-bit block. This is the core of the algorithm.
     54  */
     55 void
     56 SHA1Transform(u_int32_t state[5], const u_int8_t buffer[SHA1_BLOCK_LENGTH])
     57 {
     58 	u_int32_t a, b, c, d, e;
     59 	u_int8_t workspace[SHA1_BLOCK_LENGTH];
     60 	CHAR64LONG16 *block = (CHAR64LONG16 *)workspace;
     61 
     62 	(void)memcpy(block, buffer, SHA1_BLOCK_LENGTH);
     63 
     64 	/* Copy context->state[] to working vars */
     65 	a = state[0];
     66 	b = state[1];
     67 	c = state[2];
     68 	d = state[3];
     69 	e = state[4];
     70 
     71 	/* 4 rounds of 20 operations each. Loop unrolled. */
     72 	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);
     73 	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);
     74 	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);
     75 	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);
     76 	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);
     77 	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);
     78 	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);
     79 	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);
     80 	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);
     81 	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);
     82 	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);
     83 	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);
     84 	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);
     85 	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);
     86 	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);
     87 	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);
     88 	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);
     89 	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);
     90 	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);
     91 	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);
     92 
     93 	/* Add the working vars back into context.state[] */
     94 	state[0] += a;
     95 	state[1] += b;
     96 	state[2] += c;
     97 	state[3] += d;
     98 	state[4] += e;
     99 
    100 	/* Wipe variables */
    101 	a = b = c = d = e = 0;
    102 }
    103 
    104 /*
    105  * SHA1Init - Initialize new context
    106  */
    107 void
    108 SHA1Init(SHA1_CTX *context)
    109 {
    110 	/* SHA1 initialization constants */
    111 	context->count = 0;
    112 	context->state[0] = 0x67452301;
    113 	context->state[1] = 0xEFCDAB89;
    114 	context->state[2] = 0x98BADCFE;
    115 	context->state[3] = 0x10325476;
    116 	context->state[4] = 0xC3D2E1F0;
    117 }
    118 
    119 /*
    120  * Run your data through this.
    121  */
    122 void
    123 SHA1Update(SHA1_CTX *context, const u_int8_t *data, size_t len)
    124 {
    125 	size_t i, j;
    126 
    127 	j = (size_t)((context->count >> 3) & 63);
    128 	context->count += ((u_int64_t)len << 3);
    129 	if ((j + len) > 63) {
    130 		(void)memcpy(&context->buffer[j], data, (i = 64-j));
    131 		SHA1Transform(context->state, context->buffer);
    132 		for ( ; i + 63 < len; i += 64)
    133 			SHA1Transform(context->state, &data[i]);
    134 		j = 0;
    135 	} else {
    136 		i = 0;
    137 	}
    138 	(void)memcpy(&context->buffer[j], &data[i], len - i);
    139 }
    140 
    141 /*
    142  * Add padding and return the message digest.
    143  */
    144 void
    145 SHA1Pad(SHA1_CTX *context)
    146 {
    147 	u_int8_t finalcount[8];
    148 	u_int i;
    149 
    150 	for (i = 0; i < 8; i++) {
    151 		finalcount[i] = (u_int8_t)((context->count >>
    152 		    ((7 - (i & 7)) * 8)) & 255);	/* Endian independent */
    153 	}
    154 	SHA1Update(context, (u_int8_t *)"\200", 1);
    155 	while ((context->count & 504) != 448)
    156 		SHA1Update(context, (u_int8_t *)"\0", 1);
    157 	SHA1Update(context, finalcount, 8); /* Should cause a SHA1Transform() */
    158 }
    159 
    160 void
    161 SHA1Final(u_int8_t digest[SHA1_DIGEST_LENGTH], SHA1_CTX *context)
    162 {
    163 	u_int i;
    164 
    165 	SHA1Pad(context);
    166 	for (i = 0; i < SHA1_DIGEST_LENGTH; i++) {
    167 		digest[i] = (u_int8_t)
    168 		   ((context->state[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
    169 	}
    170 
    171 	kore_mem_zero(context, sizeof(*context));
    172 }