1 // SHA-1 code Copyright 2007 Michael Nidermayer <michaelni@gmx.at>
3 // based on public domain SHA-1 code by Steve Reid <steve@edmweb.com>
8 typedef struct AVSHA1 {
14 #define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
16 /* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
17 #define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i]))
18 #define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
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);
26 /* Hash a single 512-bit block. This is the core of the algorithm. */
30 static void transform(uint32_t state[5], uint8_t buffer[64]){
32 unsigned int i, a, b, c, d, e;
42 if(i<16) t= be2me_32(((uint32_t*)buffer)[i]);
43 else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
47 if(i<20) t+= ((b&(c^d))^d) +0x5A827999;
48 else t+= ( b^c ^d) +0x6ED9EBA1;
50 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
51 else t+= ( b^c ^d) +0xCA62C1D6;
61 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);
63 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);
64 for(i=20; i<40; i+=5){
65 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);
68 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);
71 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);
81 void av_sha1_init(AVSHA1* context){
82 context->state[0] = 0x67452301;
83 context->state[1] = 0xEFCDAB89;
84 context->state[2] = 0x98BADCFE;
85 context->state[3] = 0x10325476;
86 context->state[4] = 0xC3D2E1F0;
90 void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
93 j = context->count & 63;
94 context->count += len;
96 memcpy(&context->buffer[j], data, (i = 64-j));
97 transform(context->state, context->buffer);
98 for ( ; i + 63 < len; i += 64) {
99 transform(context->state, &data[i]);
104 memcpy(&context->buffer[j], &data[i], len - i);
107 void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
109 uint64_t finalcount= be2me_64(context->count<<3);
111 av_sha1_update(context, "\200", 1);
112 while ((context->count & 63) != 56) {
113 av_sha1_update(context, "", 1);
115 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */
117 ((uint32_t*)digest)[i]= be2me_32(context->state[i]);
120 // use the following to test
121 // gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
129 unsigned char digest[20];
132 av_sha1_init(&context);
134 av_sha1_update(&context, "abc", 3);
136 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
138 for(i=0; i<1000*1000; i++)
139 av_sha1_update(&context, "a", 1);
140 av_sha1_final(&context, digest);
141 for (i = 0; i < 20; i++)
142 printf("%02X", digest[i]);
145 //Test Vectors (from FIPS PUB 180-1)
146 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
147 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
148 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");