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