#undef printf under #ifdef TEST (needed for testing)
[libav.git] / libavutil / sha1.c
CommitLineData
7c60e55b
MN
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
8typedef struct AVSHA1 {
7c60e55b
MN
9 uint64_t count;
10 uint8_t buffer[64];
20013045 11 uint32_t state[5];
7c60e55b
MN
12} AVSHA1;
13
14#define rol(value, bits) (((value) << (bits)) | ((value) >> (32 - (bits))))
15
7c60e55b 16/* (R0+R1), R2, R3, R4 are the different operations used in SHA1 */
15b6cae2 17#define blk0(i) (block[i] = be2me_32(((uint32_t*)buffer)[i]))
d6cf7804
MN
18#define blk(i) (block[i] = rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1))
19
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);
7c60e55b
MN
25
26/* Hash a single 512-bit block. This is the core of the algorithm. */
27
28static void transform(uint32_t state[5], uint8_t buffer[64]){
aa59433a 29 uint32_t block[80];
5fd7f87b 30 unsigned int i, a, b, c, d, e;
3479b72b 31
7c60e55b
MN
32 a = state[0];
33 b = state[1];
34 c = state[2];
35 d = state[3];
36 e = state[4];
104c30ee 37#ifdef CONFIG_SMALL
2fa3a22d 38 for(i=0; i<80; i++){
476f9b74
MN
39 int t;
40 if(i<16) t= be2me_32(((uint32_t*)buffer)[i]);
41 else t= rol(block[i-3]^block[i-8]^block[i-14]^block[i-16],1);
42 block[i]= t;
43 t+= e+rol(a,5);
2fa3a22d
MN
44 if(i<40){
45 if(i<20) t+= ((b&(c^d))^d) +0x5A827999;
46 else t+= ( b^c ^d) +0x6ED9EBA1;
47 }else{
48 if(i<60) t+= (((b|c)&d)|(b&c))+0x8F1BBCDC;
49 else t+= ( b^c ^d) +0xCA62C1D6;
50 }
6573578d
MN
51 e= d;
52 d= c;
53 c= rol(b,30);
54 b= a;
55 a= t;
56 }
57#else
d6cf7804 58 for(i=0; i<15; i+=5){
7c60e55b
MN
59 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);
60 }
d6cf7804
MN
61 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);
62 for(i=20; i<40; i+=5){
7c60e55b
MN
63 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);
64 }
65 for(; i<60; i+=5){
66 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);
67 }
68 for(; i<80; i+=5){
69 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);
70 }
6573578d 71#endif
7c60e55b
MN
72 state[0] += a;
73 state[1] += b;
74 state[2] += c;
75 state[3] += d;
76 state[4] += e;
77}
78
79void av_sha1_init(AVSHA1* context){
80 context->state[0] = 0x67452301;
81 context->state[1] = 0xEFCDAB89;
82 context->state[2] = 0x98BADCFE;
83 context->state[3] = 0x10325476;
84 context->state[4] = 0xC3D2E1F0;
85 context->count = 0;
86}
87
88void av_sha1_update(AVSHA1* context, uint8_t* data, unsigned int len){
89 unsigned int i, j;
90
11bf0eb6
MN
91 j = context->count & 63;
92 context->count += len;
36c7fa7e
MN
93#ifdef CONFIG_SMALL
94 for( i = 0; i < len; i++ ){
95 context->buffer[ j++ ] = data[i];
96 if( 64 == j ){
97 transform(context->state, context->buffer);
98 j = 0;
99 }
100 }
101#else
7c60e55b
MN
102 if ((j + len) > 63) {
103 memcpy(&context->buffer[j], data, (i = 64-j));
104 transform(context->state, context->buffer);
105 for ( ; i + 63 < len; i += 64) {
106 transform(context->state, &data[i]);
107 }
965ea9ba 108 j=0;
7c60e55b
MN
109 }
110 else i = 0;
111 memcpy(&context->buffer[j], &data[i], len - i);
36c7fa7e 112#endif
7c60e55b
MN
113}
114
115void av_sha1_final(AVSHA1* context, uint8_t digest[20]){
116 int i;
11bf0eb6 117 uint64_t finalcount= be2me_64(context->count<<3);
7c60e55b
MN
118
119 av_sha1_update(context, "\200", 1);
11bf0eb6 120 while ((context->count & 63) != 56) {
cb496e1f 121 av_sha1_update(context, "", 1);
7c60e55b
MN
122 }
123 av_sha1_update(context, &finalcount, 8); /* Should cause a transform() */
c6fd617a
MN
124 for(i=0; i<5; i++)
125 ((uint32_t*)digest)[i]= be2me_32(context->state[i]);
7c60e55b
MN
126}
127
ae76034c 128// use the following to test
82da03f7 129// gcc -DTEST -DHAVE_AV_CONFIG_H -I.. sha1.c -O2 -W -Wall -o sha1 && time ./sha1
7c60e55b
MN
130#ifdef TEST
131#include <stdio.h>
132#undef printf
133
134int main(){
135 int i, k;
136 AVSHA1 context;
137 unsigned char digest[20];
138
139 for(k=0; k<3; k++){
140 av_sha1_init(&context);
141 if(k==0)
142 av_sha1_update(&context, "abc", 3);
143 else if(k==1)
144 av_sha1_update(&context, "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq", 56);
145 else
146 for(i=0; i<1000*1000; i++)
147 av_sha1_update(&context, "a", 1);
148 av_sha1_final(&context, digest);
149 for (i = 0; i < 20; i++)
150 printf("%02X", digest[i]);
151 putchar('\n');
152 }
153 //Test Vectors (from FIPS PUB 180-1)
154 printf("A9993E36 4706816A BA3E2571 7850C26C 9CD0D89D\n"
155 "84983E44 1C3BD26E BAAE4AA1 F95129E5 E54670F1\n"
156 "34AA973C D4C4DAA4 F61EEB2B DBAD2731 6534016F\n");
157
158 return 0;
159}
160#endif