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