Mercurial > libavutil.hg
annotate sha1.c @ 299:5c84cfeb69a9 libavutil
2 other variants of how to implement the core part
benchmarks welcome ...
author | michael |
---|---|
date | Tue, 13 Mar 2007 00:17:55 +0000 |
parents | 37ef3886f6b3 |
children | 0ac5f1000ed1 |
rev | line source |
---|---|
288 | 1 // SHA-1 code Copyright 2007 Michael Nidermayer <michaelni@gmx.at> |
2 // license LGPL | |
3 // based on public domain SHA-1 code by Steve Reid <steve@edmweb.com> | |
4 | |
5 #include "common.h" | |
6 #include "sha1.h" | |
7 | |
8 typedef struct AVSHA1 { | |
9 uint32_t state[5]; | |
10 uint64_t count; | |
11 uint8_t buffer[64]; | |
12 } AVSHA1; | |
13 | |
14 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) | |
15 | |
16 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ | |
299 | 17 #define R0b(v,w,x,y,z,i) z+((w&(x^y))^y) +block[i]+0x5A827999+rol(v,5); |
18 #define R2b(v,w,x,y,z,i) z+( w^x ^y) +block[i]+0x6ED9EBA1+rol(v,5); | |
19 #define R3b(v,w,x,y,z,i) z+(((w|x)&y)|(w&x))+block[i]+0x8F1BBCDC+rol(v,5); | |
20 #define R4b(v,w,x,y,z,i) z+( w^x ^y) +block[i]+0xCA62C1D6+rol(v,5); | |
21 | |
298 | 22 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +block[i]+0x5A827999+rol(v,5);w=rol(w,30); |
23 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +block[i]+0x6ED9EBA1+rol(v,5);w=rol(w,30); | |
24 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+block[i]+0x8F1BBCDC+rol(v,5);w=rol(w,30); | |
25 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +block[i]+0xCA62C1D6+rol(v,5);w=rol(w,30); | |
288 | 26 |
27 /* Hash a single 512-bit block. This is the core of the algorithm. */ | |
28 | |
299 | 29 //#define VARIANT1 |
30 //#define VARIANT2 | |
31 | |
288 | 32 static void transform(uint32_t state[5], uint8_t buffer[64]){ |
291
78b11473f66a
avoid silly ring buffer logic (faster with -O2, -O3 is always slower then -O2)
michael
parents:
290
diff
changeset
|
33 uint32_t block[80]; |
299 | 34 unsigned int i; |
35 #ifdef VARIANT1 | |
36 uint32_t s[85]; | |
37 #else | |
38 unsigned int a, b, c, d, e; | |
39 #endif | |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
40 |
296 | 41 for(i=0; i<16; i++) |
42 block[i]= be2me_32(((uint32_t*)buffer)[i]); | |
43 for(;i<80; i++) | |
44 block[i]= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1); | |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
45 |
299 | 46 |
47 #ifdef VARIANT1 | |
48 s[0]= state[4]; | |
49 s[1]= state[3]; | |
50 s[2]= state[2]; | |
51 s[3]= state[1]; | |
52 s[4]= state[0]; | |
53 for(i=0; i<20; i++){ | |
54 s[5+i]= R0b(s[4+i], s[3+i], s[2+i], s[1+i], s[i], i); | |
55 s[3+i]= rol(s[3+i],30); | |
56 } | |
57 for(; i<40; i++){ | |
58 s[5+i]= R2b(s[4+i], s[3+i], s[2+i], s[1+i], s[i], i); | |
59 s[3+i]= rol(s[3+i],30); | |
60 } | |
61 for(; i<60; i++){ | |
62 s[5+i]= R3b(s[4+i], s[3+i], s[2+i], s[1+i], s[i], i); | |
63 s[3+i]= rol(s[3+i],30); | |
64 } | |
65 for(; i<80; i++){ | |
66 s[5+i]= R4b(s[4+i], s[3+i], s[2+i], s[1+i], s[i], i); | |
67 s[3+i]= rol(s[3+i],30); | |
68 } | |
69 state[0] += s[84]; | |
70 state[1] += s[83]; | |
71 state[2] += s[82]; | |
72 state[3] += s[81]; | |
73 state[4] += s[80]; | |
74 #else | |
288 | 75 a = state[0]; |
76 b = state[1]; | |
77 c = state[2]; | |
78 d = state[3]; | |
79 e = state[4]; | |
299 | 80 #ifdef VARIANT2 |
81 for(i=0; i<20; i++){ | |
82 int t= R0b(a,b,c,d,e,i); | |
83 e= d; | |
84 d= c; | |
85 c= rol(b,30); | |
86 b= a; | |
87 a= t; | |
88 } | |
89 for(; i<40; i++){ | |
90 int t= R2b(a,b,c,d,e,i); | |
91 e= d; | |
92 d= c; | |
93 c= rol(b,30); | |
94 b= a; | |
95 a= t; | |
96 } | |
97 for(; i<60; i++){ | |
98 int t= R3b(a,b,c,d,e,i); | |
99 e= d; | |
100 d= c; | |
101 c= rol(b,30); | |
102 b= a; | |
103 a= t; | |
104 } | |
105 for(; i<80; i++){ | |
106 int t= R4b(a,b,c,d,e,i); | |
107 e= d; | |
108 d= c; | |
109 c= rol(b,30); | |
110 b= a; | |
111 a= t; | |
112 } | |
113 #else | |
296 | 114 for(i=0; i<20; i+=5){ |
288 | 115 R0(a,b,c,d,e,0+i); R0(e,a,b,c,d,1+i); R0(d,e,a,b,c,2+i); R0(c,d,e,a,b,3+i); R0(b,c,d,e,a,4+i); |
116 } | |
296 | 117 for(; i<40; i+=5){ |
288 | 118 R2(a,b,c,d,e,0+i); R2(e,a,b,c,d,1+i); R2(d,e,a,b,c,2+i); R2(c,d,e,a,b,3+i); R2(b,c,d,e,a,4+i); |
119 } | |
120 for(; i<60; i+=5){ | |
121 R3(a,b,c,d,e,0+i); R3(e,a,b,c,d,1+i); R3(d,e,a,b,c,2+i); R3(c,d,e,a,b,3+i); R3(b,c,d,e,a,4+i); | |
122 } | |
123 for(; i<80; i+=5){ | |
124 R4(a,b,c,d,e,0+i); R4(e,a,b,c,d,1+i); R4(d,e,a,b,c,2+i); R4(c,d,e,a,b,3+i); R4(b,c,d,e,a,4+i); | |
125 } | |
299 | 126 #endif |
288 | 127 state[0] += a; |
128 state[1] += b; | |
129 state[2] += c; | |
130 state[3] += d; | |
131 state[4] += e; | |
299 | 132 #endif |
288 | 133 } |
134 | |
135 void av_sha1_init(AVSHA1* context){ | |
136 context->state[0] = 0x67452301; | |
137 context->state[1] = 0xEFCDAB89; | |
138 context->state[2] = 0x98BADCFE; | |
139 context->state[3] = 0x10325476; | |
140 context->state[4] = 0xC3D2E1F0; | |
141 context->count = 0; | |
142 } | |
143 | |
144 void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){ | |
145 unsigned int i, j; | |
146 | |
294
97f5321b12ad
make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents:
293
diff
changeset
|
147 j = context->count & 63; |
97f5321b12ad
make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents:
293
diff
changeset
|
148 context->count += len; |
288 | 149 if ((j + len) > 63) { |
150 memcpy(&context->buffer[j], data, (i = 64-j)); | |
151 transform(context->state, context->buffer); | |
152 for ( ; i + 63 < len; i += 64) { | |
153 transform(context->state, &data[i]); | |
154 } | |
155 } | |
156 else i = 0; | |
157 memcpy(&context->buffer[j], &data[i], len - i); | |
158 } | |
159 | |
160 void av_sha1_final(AVSHA1* context, uint8_t digest[20]){ | |
161 int i; | |
294
97f5321b12ad
make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents:
293
diff
changeset
|
162 uint64_t finalcount= be2me_64(context->count<<3); |
288 | 163 |
164 av_sha1_update(context, "\200", 1); | |
294
97f5321b12ad
make count count bytes not bits (this is simpler and leads to a very slightly smaller object file)
michael
parents:
293
diff
changeset
|
165 while ((context->count & 63) != 56) { |
288 | 166 av_sha1_update(context, "\0", 1); |
167 } | |
168 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */ | |
295 | 169 for(i=0; i<5; i++) |
170 ((uint32_t*)digest)[i]= be2me_32(context->state[i]); | |
288 | 171 } |
172 | |
289 | 173 // use the following to test |
292 | 174 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1 |
288 | 175 #ifdef TEST |
176 #include <stdio.h> | |
177 #undef printf | |
178 | |
179 int main(){ | |
180 int i, k; | |
181 AVSHA1 context; | |
182 unsigned char digest[20]; | |
183 | |
184 for(k=0; k<3; k++){ | |
185 av_sha1_init(&context); | |
186 if(k==0) | |
187 av_sha1_update(&context, "abc", 3); | |
188 else if(k==1) | |
189 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); | |
190 else | |
191 for(i=0; i<1000*1000; i++) | |
192 av_sha1_update(&context, "a", 1); | |
193 av_sha1_final(&context, digest); | |
194 for (i = 0; i < 20; i++) | |
195 printf("%02X", digest[i]); | |
196 putchar('\n'); | |
197 } | |
198 //Test Vectors (from FIPS PUB 180-1) | |
199 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" | |
200 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" | |
201 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); | |
202 | |
203 return 0; | |
204 } | |
205 #endif |