annotate sha1.c @ 302:901256787a89 libavutil

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