Mercurial > libavutil.hg
annotate sha1.c @ 305:18d523d5c838 libavutil
remove middle variant (keep fastest and smallest)
author | michael |
---|---|
date | Tue, 13 Mar 2007 10:36:49 +0000 |
parents | a9cd369e2c4b |
children | d66e1c3838d7 |
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 */ | |
301 | 17 #define blk0(i) (block[i] = be2me_32(block[i])) |
18 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1)) | |
19 | |
20 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); | |
21 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30); | |
22 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); | |
23 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); | |
24 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30); | |
288 | 25 |
26 /* Hash a single 512-bit block. This is the core of the algorithm. */ | |
27 | |
299 | 28 //#define VARIANT2 |
29 | |
288 | 30 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
|
31 uint32_t block[80]; |
299 | 32 unsigned int i; |
33 unsigned int a, b, c, d, e; | |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
34 |
305 | 35 #if defined (VARIANT2) |
296 | 36 for(i=0; i<16; i++) |
37 block[i]= be2me_32(((uint32_t*)buffer)[i]); | |
38 for(;i<80; i++) | |
39 block[i]= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1); | |
301 | 40 #else |
41 memcpy(block, buffer, 64); | |
42 #endif | |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
43 |
299 | 44 |
288 | 45 a = state[0]; |
46 b = state[1]; | |
47 c = state[2]; | |
48 d = state[3]; | |
49 e = state[4]; | |
299 | 50 #ifdef VARIANT2 |
302 | 51 for(i=0; i<80; i++){ |
303 | 52 int t= e+block[i]+rol(a,5); |
302 | 53 if(i<40){ |
54 if(i<20) t+= ((b&(c^d))^d) +0x5A827999; | |
55 else t+= ( b^c ^d) +0x6ED9EBA1; | |
56 }else{ | |
57 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC; | |
58 else t+= ( b^c ^d) +0xCA62C1D6; | |
59 } | |
299 | 60 e= d; |
61 d= c; | |
62 c= rol(b,30); | |
63 b= a; | |
64 a= t; | |
65 } | |
66 #else | |
301 | 67 for(i=0; i<15; i+=5){ |
288 | 68 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); |
69 } | |
301 | 70 R0(a,b,c,d,e,15); 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); |
71 for(i=20; i<40; i+=5){ | |
288 | 72 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); |
73 } | |
74 for(; i<60; i+=5){ | |
75 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); | |
76 } | |
77 for(; i<80; i+=5){ | |
78 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); | |
79 } | |
299 | 80 #endif |
288 | 81 state[0] += a; |
82 state[1] += b; | |
83 state[2] += c; | |
84 state[3] += d; | |
85 state[4] += e; | |
86 } | |
87 | |
88 void av_sha1_init(AVSHA1* context){ | |
89 context->state[0] = 0x67452301; | |
90 context->state[1] = 0xEFCDAB89; | |
91 context->state[2] = 0x98BADCFE; | |
92 context->state[3] = 0x10325476; | |
93 context->state[4] = 0xC3D2E1F0; | |
94 context->count = 0; | |
95 } | |
96 | |
97 void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){ | |
98 unsigned int i, j; | |
99 | |
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
|
100 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
|
101 context->count += len; |
288 | 102 if ((j + len) > 63) { |
103 memcpy(&context->buffer[j], data, (i = 64-j)); | |
104 transform(context->state, context->buffer); | |
105 for ( ; i + 63 < len; i += 64) { | |
106 transform(context->state, &data[i]); | |
107 } | |
304 | 108 j=0; |
288 | 109 } |
110 else i = 0; | |
111 memcpy(&context->buffer[j], &data[i], len - i); | |
112 } | |
113 | |
114 void av_sha1_final(AVSHA1* context, uint8_t digest[20]){ | |
115 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
|
116 uint64_t finalcount= be2me_64(context->count<<3); |
288 | 117 |
118 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
|
119 while ((context->count & 63) != 56) { |
300 | 120 av_sha1_update(context, "", 1); |
288 | 121 } |
122 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */ | |
295 | 123 for(i=0; i<5; i++) |
124 ((uint32_t*)digest)[i]= be2me_32(context->state[i]); | |
288 | 125 } |
126 | |
289 | 127 // use the following to test |
292 | 128 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1 |
288 | 129 #ifdef TEST |
130 #include <stdio.h> | |
131 #undef printf | |
132 | |
133 int main(){ | |
134 int i, k; | |
135 AVSHA1 context; | |
136 unsigned char digest[20]; | |
137 | |
138 for(k=0; k<3; k++){ | |
139 av_sha1_init(&context); | |
140 if(k==0) | |
141 av_sha1_update(&context, "abc", 3); | |
142 else if(k==1) | |
143 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); | |
144 else | |
145 for(i=0; i<1000*1000; i++) | |
146 av_sha1_update(&context, "a", 1); | |
147 av_sha1_final(&context, digest); | |
148 for (i = 0; i < 20; i++) | |
149 printf("%02X", digest[i]); | |
150 putchar('\n'); | |
151 } | |
152 //Test Vectors (from FIPS PUB 180-1) | |
153 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" | |
154 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" | |
155 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); | |
156 | |
157 return 0; | |
158 } | |
159 #endif |