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