Debian Codegraph @

contrib/LibSha1.c

raw
1 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
2 // LibSha1
3 //
4 // Implementation of SHA1 hash function.
5 // Original author: Steve Reid <[email protected]>
6 // Contributions by: James H. Brown <[email protected]>, Saul Kravitz <[email protected]>,
7 // and Ralph Giles <[email protected]>
8 // Modified by WaterJuice retaining Public Domain license.
9 //
10 // This is free and unencumbered software released into the public domain - June 2013 waterjuice.org
11 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
12
13 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
14 // IMPORTS
15 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
16
17 #include "LibSha1.h"
18 #ifdef HAVE_MEMORY_H
19 # include <memory.h>
20 #endif
21
22 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
23 // TYPES
24 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
25
26 typedef union
27 {
28 uint8_t c [64];
29 uint32_t l [16];
30 } CHAR64LONG16;
31
32 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
33 // INTERNAL FUNCTIONS
34 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
35
36 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
37
38 // blk0() and blk() perform the initial expand.
39 #define blk0(i) (block->l[i] = (rol(block->l[i],24)&0xFF00FF00) \
40 |(rol(block->l[i],8)&0x00FF00FF))
41
42 #define blk(i) (block->l[i&15] = rol(block->l[(i+13)&15]^block->l[(i+8)&15] \
43 ^block->l[(i+2)&15]^block->l[i&15],1))
44
45 // (R0+R1), R2, R3, R4 are the different operations used in SHA1
46 #define R0(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk0(i)+ 0x5A827999 + rol(v,5); w=rol(w,30);
47 #define R1(v,w,x,y,z,i) z += ((w&(x^y))^y) + blk(i) + 0x5A827999 + rol(v,5); w=rol(w,30);
48 #define R2(v,w,x,y,z,i) z += (w^x^y) + blk(i) + 0x6ED9EBA1 + rol(v,5); w=rol(w,30);
49 #define R3(v,w,x,y,z,i) z += (((w|x)&y)|(w&x)) + blk(i) + 0x8F1BBCDC + rol(v,5); w=rol(w,30);
50 #define R4(v,w,x,y,z,i) z += (w^x^y) + blk(i) + 0xCA62C1D6 + rol(v,5); w=rol(w,30);
51
52
53 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
54 // TransformFunction
55 //
56 // Hash a single 512-bit block. This is the core of the algorithm
57 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
58 static
59 void
60 TransformFunction
61 (
62 uint32_t state[5],
63 const uint8_t buffer[64]
64 )
65 {
66 uint32_t a;
67 uint32_t b;
68 uint32_t c;
69 uint32_t d;
70 uint32_t e;
71 uint8_t workspace[64];
72 CHAR64LONG16* block = (CHAR64LONG16*) workspace;
73
74 memcpy( block, buffer, 64 );
75
76 // Copy context->state[] to working vars
77 a = state[0];
78 b = state[1];
79 c = state[2];
80 d = state[3];
81 e = state[4];
82
83 // 4 rounds of 20 operations each. Loop unrolled.
84 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);
85 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);
86 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);
87 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);
88 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);
89 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);
90 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);
91 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);
92 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);
93 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);
94 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);
95 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);
96 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);
97 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);
98 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);
99 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);
100 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);
101 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);
102 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);
103 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);
104
105 // Add the working vars back into context.state[]
106 state[0] += a;
107 state[1] += b;
108 state[2] += c;
109 state[3] += d;
110 state[4] += e;
111 }
112
113 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
114 // PUBLIC FUNCTIONS
115 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
116
117 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
118 // Sha1Initialise
119 //
120 // Initialises an SHA1 Context. Use this to initialise/reset a context.
121 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
122 void
123 Sha1Initialise
124 (
125 Sha1Context* Context
126 )
127 {
128 // SHA1 initialization constants
129 Context->State[0] = 0x67452301;
130 Context->State[1] = 0xEFCDAB89;
131 Context->State[2] = 0x98BADCFE;
132 Context->State[3] = 0x10325476;
133 Context->State[4] = 0xC3D2E1F0;
134 Context->Count[0] = 0;
135 Context->Count[1] = 0;
136 }
137
138 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
139 // Sha1Update
140 //
141 // Adds data to the SHA1 context. This will process the data and update the internal state of the context. Keep on
142 // calling this function until all the data has been added. Then call Sha1Finalise to calculate the hash.
143 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
144 void
145 Sha1Update
146 (
147 Sha1Context* Context,
148 void* Buffer,
149 uint32_t BufferSize
150 )
151 {
152 uint32_t i;
153 uint32_t j;
154
155 j = (Context->Count[0] >> 3) & 63;
156 if( (Context->Count[0] += BufferSize << 3) < (BufferSize << 3) )
157 {
158 Context->Count[1]++;
159 }
160
161 Context->Count[1] += (BufferSize >> 29);
162 if( (j + BufferSize) > 63 )
163 {
164 i = 64 - j;
165 memcpy( &Context->Buffer[j], Buffer, i );
166 TransformFunction(Context->State, Context->Buffer);
167 for( ; i + 63 < BufferSize; i += 64 )
168 {
169 TransformFunction(Context->State, (uint8_t*)Buffer + i);
170 }
171 j = 0;
172 }
173 else
174 {
175 i = 0;
176 }
177
178 memcpy( &Context->Buffer[j], &((uint8_t*)Buffer)[i], BufferSize - i );
179 }
180
181 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
182 // Sha1Finalise
183 //
184 // Performs the final calculation of the hash and returns the digest (20 byte buffer containing 160bit hash). After
185 // calling this, Sha1Initialised must be used to reuse the context.
186 ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
187 void
188 Sha1Finalise
189 (
190 Sha1Context* Context,
191 SHA1_HASH* Digest
192 )
193 {
194 uint32_t i;
195 uint8_t finalcount[8];
196
197 for( i=0; i<8; i++ )
198 {
199 finalcount[i] = (unsigned char)((Context->Count[(i >= 4 ? 0 : 1)]
200 >> ((3-(i & 3)) * 8) ) & 255); // Endian independent
201 }
202 Sha1Update( Context, (uint8_t*)"\x80", 1 );
203 while( (Context->Count[0] & 504) != 448 )
204 {
205 Sha1Update( Context, (uint8_t*)"\0", 1 );
206 }
207
208 Sha1Update( Context, finalcount, 8 ); // Should cause a Sha1TransformFunction()
209 for( i=0; i<SHA1_HASH_SIZE; i++ )
210 {
211 Digest->bytes[i] = (uint8_t)((Context->State[i>>2] >> ((3-(i & 3)) * 8) ) & 255);
212 }
213 }
214