source: project/release/5/sha1/trunk/sha1-base.c @ 37641

Last change on this file since 37641 was 37641, checked in by Kon Lovett, 4 months ago

update len is not size_t but uint32, test not unsafe

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