Mercurial > libavutil.hg
annotate sha1.c @ 298:37ef3886f6b3 libavutil
cosmetic cleanup
author | michael |
---|---|
date | Mon, 12 Mar 2007 22:23:30 +0000 |
parents | 10b34dc4ecd2 |
children | 5c84cfeb69a9 |
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 */ | |
298 | 17 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +block[i]+0x5A827999+rol(v,5);w=rol(w,30); |
18 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +block[i]+0x6ED9EBA1+rol(v,5);w=rol(w,30); | |
19 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+block[i]+0x8F1BBCDC+rol(v,5);w=rol(w,30); | |
20 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +block[i]+0xCA62C1D6+rol(v,5);w=rol(w,30); | |
288 | 21 |
22 /* Hash a single 512-bit block. This is the core of the algorithm. */ | |
23 | |
24 static void transform(uint32_t state[5], uint8_t buffer[64]){ | |
25 unsigned int a, b, c, d, e, i; | |
291
78b11473f66a
avoid silly ring buffer logic (faster with -O2, -O3 is always slower then -O2)
michael
parents:
290
diff
changeset
|
26 uint32_t block[80]; |
290
8f02801da0f8
its faster to copy the data to the stack it seems ...
michael
parents:
289
diff
changeset
|
27 |
296 | 28 for(i=0; i<16; i++) |
29 block[i]= be2me_32(((uint32_t*)buffer)[i]); | |
30 for(;i<80; i++) | |
31 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
|
32 |
288 | 33 /* Copy context->state[] to working vars */ |
34 a = state[0]; | |
35 b = state[1]; | |
36 c = state[2]; | |
37 d = state[3]; | |
38 e = state[4]; | |
293 | 39 |
296 | 40 for(i=0; i<20; i+=5){ |
288 | 41 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); |
42 } | |
296 | 43 for(; i<40; i+=5){ |
288 | 44 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); |
45 } | |
46 for(; i<60; i+=5){ | |
47 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); | |
48 } | |
49 for(; i<80; i+=5){ | |
50 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); | |
51 } | |
293 | 52 |
288 | 53 state[0] += a; |
54 state[1] += b; | |
55 state[2] += c; | |
56 state[3] += d; | |
57 state[4] += e; | |
58 } | |
59 | |
60 void av_sha1_init(AVSHA1* context){ | |
61 context->state[0] = 0x67452301; | |
62 context->state[1] = 0xEFCDAB89; | |
63 context->state[2] = 0x98BADCFE; | |
64 context->state[3] = 0x10325476; | |
65 context->state[4] = 0xC3D2E1F0; | |
66 context->count = 0; | |
67 } | |
68 | |
69 void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){ | |
70 unsigned int i, j; | |
71 | |
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
|
72 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
|
73 context->count += len; |
288 | 74 if ((j + len) > 63) { |
75 memcpy(&context->buffer[j], data, (i = 64-j)); | |
76 transform(context->state, context->buffer); | |
77 for ( ; i + 63 < len; i += 64) { | |
78 transform(context->state, &data[i]); | |
79 } | |
80 } | |
81 else i = 0; | |
82 memcpy(&context->buffer[j], &data[i], len - i); | |
83 } | |
84 | |
85 void av_sha1_final(AVSHA1* context, uint8_t digest[20]){ | |
86 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
|
87 uint64_t finalcount= be2me_64(context->count<<3); |
288 | 88 |
89 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
|
90 while ((context->count & 63) != 56) { |
288 | 91 av_sha1_update(context, "\0", 1); |
92 } | |
93 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */ | |
295 | 94 for(i=0; i<5; i++) |
95 ((uint32_t*)digest)[i]= be2me_32(context->state[i]); | |
288 | 96 } |
97 | |
289 | 98 // use the following to test |
292 | 99 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1 |
288 | 100 #ifdef TEST |
101 #include <stdio.h> | |
102 #undef printf | |
103 | |
104 int main(){ | |
105 int i, k; | |
106 AVSHA1 context; | |
107 unsigned char digest[20]; | |
108 | |
109 for(k=0; k<3; k++){ | |
110 av_sha1_init(&context); | |
111 if(k==0) | |
112 av_sha1_update(&context, "abc", 3); | |
113 else if(k==1) | |
114 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); | |
115 else | |
116 for(i=0; i<1000*1000; i++) | |
117 av_sha1_update(&context, "a", 1); | |
118 av_sha1_final(&context, digest); | |
119 for (i = 0; i < 20; i++) | |
120 printf("%02X", digest[i]); | |
121 putchar('\n'); | |
122 } | |
123 //Test Vectors (from FIPS PUB 180-1) | |
124 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" | |
125 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" | |
126 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); | |
127 | |
128 return 0; | |
129 } | |
130 #endif |