Mercurial > libavutil.hg
annotate sha1.c @ 351:47335869d5f7 libavutil
Add proper license header.
author | diego |
---|---|
date | Wed, 27 Jun 2007 07:58:37 +0000 |
parents | 88e453a0975d |
children | f9a4c04ebb0e |
rev | line source |
---|---|
351 | 1 /* |
2 * Copyright (C) 2007 Michael Niedermayer <michaelni@gmx.at> | |
3 * based on public domain SHA-1 code by Steve Reid <steve@edmweb.com> | |
4 * | |
5 * This file is part of FFmpeg. | |
6 * | |
7 * FFmpeg is free software; you can redistribute it and/or | |
8 * modify it under the terms of the GNU Lesser General Public | |
9 * License as published by the Free Software Foundation; either | |
10 * version 2.1 of the License, or (at your option) any later version. | |
11 * | |
12 * FFmpeg is distributed in the hope that it will be useful, | |
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 * Lesser General Public License for more details. | |
16 * | |
17 * You should have received a copy of the GNU Lesser General Public | |
18 * License along with FFmpeg; if not, write to the Free Software | |
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | |
20 */ | |
288 | 21 |
22 #include "common.h" | |
332 | 23 #include "bswap.h" |
288 | 24 #include "sha1.h" |
25 | |
26 typedef struct AVSHA1 { | |
27 uint64_t count; | |
28 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
|
29 uint32_t state[5]; |
288 | 30 } AVSHA1; |
31 | |
32 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits)))) | |
33 | |
34 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */ | |
307 | 35 #define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i])) |
301 | 36 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1)) |
37 | |
38 #define R0(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk0(i)+0x5A827999+rol(v,5);w=rol(w,30); | |
39 #define R1(v,w,x,y,z,i) z+=((w&(x^y))^y) +blk (i)+0x5A827999+rol(v,5);w=rol(w,30); | |
40 #define R2(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0x6ED9EBA1+rol(v,5);w=rol(w,30); | |
41 #define R3(v,w,x,y,z,i) z+=(((w|x)&y)|(w&x))+blk (i)+0x8F1BBCDC+rol(v,5);w=rol(w,30); | |
42 #define R4(v,w,x,y,z,i) z+=( w^x ^y) +blk (i)+0xCA62C1D6+rol(v,5);w=rol(w,30); | |
288 | 43 |
44 /* Hash a single 512-bit block. This is the core of the algorithm. */ | |
45 | |
46 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
|
47 uint32_t block[80]; |
308 | 48 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
|
49 |
288 | 50 a = state[0]; |
51 b = state[1]; | |
52 c = state[2]; | |
53 d = state[3]; | |
54 e = state[4]; | |
310 | 55 #ifdef CONFIG_SMALL |
302 | 56 for(i=0; i<80; i++){ |
306 | 57 int t; |
58 if(i<16) t= be2me_32(((uint32_t*)buffer)[i]); | |
59 else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1); | |
60 block[i]= t; | |
61 t+= e+rol(a,5); | |
302 | 62 if(i<40){ |
63 if(i<20) t+= ((b&(c^d))^d) +0x5A827999; | |
64 else t+= ( b^c ^d) +0x6ED9EBA1; | |
65 }else{ | |
66 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC; | |
67 else t+= ( b^c ^d) +0xCA62C1D6; | |
68 } | |
299 | 69 e= d; |
70 d= c; | |
71 c= rol(b,30); | |
72 b= a; | |
73 a= t; | |
74 } | |
75 #else | |
301 | 76 for(i=0; i<15; i+=5){ |
288 | 77 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); |
78 } | |
301 | 79 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); |
80 for(i=20; i<40; i+=5){ | |
288 | 81 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); |
82 } | |
83 for(; i<60; i+=5){ | |
84 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); | |
85 } | |
86 for(; i<80; i+=5){ | |
87 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); | |
88 } | |
299 | 89 #endif |
288 | 90 state[0] += a; |
91 state[1] += b; | |
92 state[2] += c; | |
93 state[3] += d; | |
94 state[4] += e; | |
95 } | |
96 | |
315 | 97 void av_sha1_init(AVSHA1* ctx){ |
98 ctx->state[0] = 0x67452301; | |
99 ctx->state[1] = 0xEFCDAB89; | |
100 ctx->state[2] = 0x98BADCFE; | |
101 ctx->state[3] = 0x10325476; | |
102 ctx->state[4] = 0xC3D2E1F0; | |
103 ctx->count = 0; | |
288 | 104 } |
105 | |
315 | 106 void av_sha1_update(AVSHA1* ctx, uint8_t* data, unsigned int len){ |
288 | 107 unsigned int i, j; |
108 | |
315 | 109 j = ctx->count & 63; |
110 ctx->count += len; | |
311 | 111 #ifdef CONFIG_SMALL |
112 for( i = 0; i < len; i++ ){ | |
315 | 113 ctx->buffer[ j++ ] = data[i]; |
311 | 114 if( 64 == j ){ |
315 | 115 transform(ctx->state, ctx->buffer); |
311 | 116 j = 0; |
117 } | |
118 } | |
119 #else | |
288 | 120 if ((j + len) > 63) { |
315 | 121 memcpy(&ctx->buffer[j], data, (i = 64-j)); |
122 transform(ctx->state, ctx->buffer); | |
288 | 123 for ( ; i + 63 < len; i += 64) { |
315 | 124 transform(ctx->state, &data[i]); |
288 | 125 } |
304 | 126 j=0; |
288 | 127 } |
128 else i = 0; | |
315 | 129 memcpy(&ctx->buffer[j], &data[i], len - i); |
311 | 130 #endif |
288 | 131 } |
132 | |
315 | 133 void av_sha1_final(AVSHA1* ctx, uint8_t digest[20]){ |
288 | 134 int i; |
315 | 135 uint64_t finalcount= be2me_64(ctx->count<<3); |
288 | 136 |
315 | 137 av_sha1_update(ctx, "\200", 1); |
138 while ((ctx->count & 63) != 56) { | |
139 av_sha1_update(ctx, "", 1); | |
288 | 140 } |
315 | 141 av_sha1_update(ctx, &finalcount, 8); /* Should cause a transform() */ |
295 | 142 for(i=0; i<5; i++) |
315 | 143 ((uint32_t*)digest)[i]= be2me_32(ctx->state[i]); |
288 | 144 } |
145 | |
289 | 146 // use the following to test |
292 | 147 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1 |
288 | 148 #ifdef TEST |
149 #include <stdio.h> | |
150 #undef printf | |
151 | |
152 int main(){ | |
153 int i, k; | |
315 | 154 AVSHA1 ctx; |
288 | 155 unsigned char digest[20]; |
156 | |
157 for(k=0; k<3; k++){ | |
315 | 158 av_sha1_init(&ctx); |
288 | 159 if(k==0) |
315 | 160 av_sha1_update(&ctx, "abc", 3); |
288 | 161 else if(k==1) |
315 | 162 av_sha1_update(&ctx, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56); |
288 | 163 else |
164 for(i=0; i<1000*1000; i++) | |
315 | 165 av_sha1_update(&ctx, "a", 1); |
166 av_sha1_final(&ctx, digest); | |
288 | 167 for (i = 0; i < 20; i++) |
168 printf("%02X", digest[i]); | |
169 putchar('\n'); | |
170 } | |
171 //Test Vectors (from FIPS PUB 180-1) | |
172 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n" | |
173 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n" | |
174 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n"); | |
175 | |
176 return 0; | |
177 } | |
178 #endif |